Description:
In this algorithm, candidate movements are those that introduce at least one candidate edge into the solution. Candidate edges are defined by selecting 10 other nearest vertices for each vertex. This parameter can also be adjusted experimentally to achieve optimal results. For example, the process of examining movements (between routes or within a route) can be as follows:
For each vertex ( n1 ):
For each vertex ( n2 ) from the list of the nearest vertices to ( n1 ):
Evaluate the movement(s) introducing the edge ( n1-n2 ) into the solution. (Note: This is not equivalent to exchanging vertex ( n1 ) with ( n2 )).
Note: It's crucial to understand that the process involves assessing movements introducing specific edges into the solution, not merely exchanging vertices.
Description: In this algorithm, candidate movements are those that introduce at least one candidate edge into the solution. Candidate edges are defined by selecting 10 other nearest vertices for each vertex. This parameter can also be adjusted experimentally to achieve optimal results. For example, the process of examining movements (between routes or within a route) can be as follows:
For each vertex ( n1 ):
Note: It's crucial to understand that the process involves assessing movements introducing specific edges into the solution, not merely exchanging vertices.