Exploring variants of 2-opt and 3-opt for the general routing problem

Operations Research

Volumn 53, Issue 6, 2005, Pages 982-992

  Muyldermans, Luc ^a   Beullens, Patrick ^b   Cattrysse, Dirk ^c   Van Oudheusden, Dirk ^c  

^a UNIVERSITY OF NOTTINGHAM   (United Kingdom)

^b UNIVERSITY OF PORTSMOUTH   (United Kingdom)

^c UNIVERSITY OF LEUVEN   (Belgium)

Author keywords

2 opt; networks graphs; General routing problem; Rural postman problem; Transportation; Traveling salesman: arc routing; Vehicle routing: local search

Indexed keywords

DYNAMIC PROGRAMMING; GRAPH THEORY; ROUTERS; TRANSPORTATION;

2-OPT: NETWORKS/GRAPH; GENERAL ROUTING PROBLEM; RURAL POSTMAN PROBLEM; TRAVELING SALESMAN: ARC ROUTING; VEHICLE ROUTING: LOCAL SEARCH;

PROBLEM SOLVING;

EID: 30344482559     PISSN: 0030364X     EISSN: 15265463     Source Type: Journal    
DOI: 10.1287/opre.1040.0205     Document Type: Article

References (31)

1. Assad, A. A., B. L. Golden. 1995. Arc routing methods and applications. M. O. Ball, T. L. Magnanti, C. L. Monma, G. L. Nemhauser, eds. Network Routing. Handbooks in Operations Research and Management Science. North-Holland, Amsterdam, The Netherlands, 375-483.
2. Benavent, E., A. Corberàn, J. M. Sanchis. 2000. Linear programming based methods for solving arc routing problems. M. Dror, ed. Arc Routing: Theory, Solutions and Applications. Kluwer Academic Publishers, Dordrecht, The Netherlands, 231-275.
3. Bentley, J. L. 1992. Fast algorithms for geometric traveling salesman problems. ORSA J. Comput. 4 387-411.
4. Beullens, P., L. Muyldermans, D. Cattrysse, D. Van Oudheusden. 2003. A guided local search heuristic for the capacitated arc routing problem. Eur. J. Oper. Res. 147 629-643.
5. Christofides, N. 1976. Worst-case analysis of a new heuristic for the traveling salesman problem. Report 388, Graduate School of Industrial Administration, Carnegie Mellon University, Pittsburgh, PA.
6. Christofides, N., V. Campos, A. Corberán, E. Mota. 1981. An algorithm for the rural postman problem. Report I.C.O.R. 81.5, Imperial College, London, UK.
7. Corberán, A., J. M. Sanchis. 1994. A polyhedral approach to the rural postman problem. Eur. J. Oper. Res. 79 95-114.
8. Corberán, A., A. N. Letchford, J. M. Sanchis. 2001. A cutting plane algorithm for the general routing problem. Math. Programming Series A 90 291-316.
9. Cornuéjols, G., J. Fonlupt, D. Naddef. 1985. The traveling salesman problem on a graph and some related integer polyhedra. Math. Programming 33 1-27.
10. Croes, G. A. 1958. A method for solving traveling salesman problems. Oper. Res. 6 791-812.
11. Dror, M., ed. 2000. Arc Routing: Theory, Solutions and Applications. Kluwer Academic Publishers, Dordrecht, The Netherlands.
12. Edmonds, J. 1963. The Chinese postman problem. Oper. Res. 13(Supplement 1) B73-B77.
13. Edmonds, J., E. J. Johnson. 1973. Matching, Euler tours and the Chinese postman problem. Math. Programming 5 88-124.
14. Eiselt, H. A., M. Gendreau, G. Laporte. 1995. Arc routing problems, Part II: The rural postman problem. Oper. Res. 43 399-414.
15. Fleischmann, B. 1985. A cutting plane procedure for the traveling sales-man problem on a road network. Eur. J. Oper. Res. 21 307-317.
16. Frederickson, G. N. 1979. Approximation algorithms for some postman problems. J. Assoc. Comput. Machinery 26 538-554.
17. Ghiani, G., G. Laporte. 2000. A branch and cut algorithm for the undirected rural postman problem. Math. Programming Series A 87 467-481.
18. Gomory, R. E., T. C. Hu. 1961. Multi-terminal network flows. SIAM J. Appl. Math. 9 551-570.
19. Guan, M. 1962. Graphic programming using odd or even points. Chinese Math. 1 237-277.
20. Hertz, A., G. Laporte, P. Nanchen Hugo. 1999. Improvement procedures for the undirected rural postman problem. INFORMS J. Comput. 11 53-62.
21. Johnson, D. S., L. A. McGeoch. 1997. The traveling salesman problem: A case study. E. Aarts, J. K. Lenstra, eds. Local Search in Combinatorial Optimization. John Wiley and Sons, Chichester, UK, 215-310.
22. Jünger, M., G. Reinelt, G. Rinaldi. 1995. The traveling salesman problem. M. O. Ball, T. L. Magnanti, C. L. Monma, G. L. Nemhauser, eds. Network Models. Handbooks in Operations Research and Management Science. North-Holland, Amsterdam, The Netherlands, 225-330.
23. Lawler, E. L., J. K. Lenstra, A. H. G. Rinnooy Kan, D. B. Shmoys, eds. 1985. The Traveling Salesman Problem. John Wiley and Sons, Chichester, UK.
24. Lenstra, J. K., A. H. G. Rinnooy Kan. 1976. On general routing problems. Networks 6 273-280.
25. Lin, S. 1965. Computer solutions of the traveling salesman problem. Bell System Tech. J. 44 2245-2269.
26. Lin, S., B. W. Kernighan. 1973. An effective heuristic algorithm for the traveling salesman problem. Oper. Res. 21 498-516.
27. Muyldermans, L. 2003. Routing, districting and location for arc traversal problems. Ph.D. dissertation, Center for Industrial Management, Katholieke Universiteit Leuven, Heverlee, Belgium.
28. Orloff, C. S. 1974. A fundamental problem in vehicle routing. Networks 4 35-64.
29. Padberg, M. W., M. R. Rao. 1982. Odd minimum cut-sets and b-matchings. Math. Oper. Res. 7 67-80.
30. Voudouris, C., E. Tsang. 1996. Partial constraint satisfaction problems and guided local search. Proc. Second Internat. Conf. on Practical Application of Constraint Technology (PACT '96), London, UK, 337-356.
31. Voudouris, C., E. Tsang. 1999. Guided local search and its application to the traveling salesman problem. Eur. J. Oper. Res. 113 469-499.