Exploring variants of 2-opt and 3-opt for the general routing problem
成果类型：
Article
署名作者：
Muyldermans, L; Beullens, P; Cattrysse, D; Van Oudheusden, D
署名单位：
University of Nottingham; University of Portsmouth; KU Leuven
刊物名称：
OPERATIONS RESEARCH
ISSN/ISSBN：
0030-364X
DOI：
10.1287/opre.1040.0205
发表日期：
2005
页码：
982-995
关键词：
摘要：
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.