Journal
OPERATIONS RESEARCH
Volume 53, Issue 6, Pages 982-995Publisher
INFORMS
DOI: 10.1287/opre.1040.0205
Keywords
-
Ask authors/readers for more resources
The general routing problem (GRP) is the problem of finding a minimum length tour, visiting a number of specified vertices and edges in an undirected graph. In this paper, we describe how the well-known 2-opt and 3-opt local search procedures for node routing problems can be adapted to solve arc and general routing problems successfully. Two forms of the 2-opt and 3-opt approaches are applied to the GRP. The first version is similar to the conventional approach for the traveling salesman problem; the second version includes a dynamic programming procedure and explores a larger neighborhood at the expense of higher running times. Extensive computational tests, including ones on larger instances than previously reported in the arc routing literature, are performed with variants of both algorithms. In combination with the guided local search metaheuristic and the mechanisms of marking and neighbor lists, the procedures systematically detect optimal or high-quality solutions within limited computation time.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available