Exact solution of the generalized routing problem through graph transformations

Journal of the Operational Research Society

Volumn 54, Issue 8, 2003, Pages 906-910

  Blais, M ^a,b   Laporte, G ^a  

^a HEC MONTRÉAL   (Canada)

^b Integrale MBD   (Canada)

Author keywords

Generalized routing problem; Generalized traveling salesman problem; Rural postman problem; Traveling salesman problem

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COSTS; GRAPH THEORY; HEURISTIC METHODS; PROBLEM SOLVING; SET THEORY;

GENERALIZED ROUTING PROBLEM; GRAPH TRANSFORMATION; RURAL POSTMAN PROBLEM;

TRAVELING SALESMAN PROBLEM;

EID: 0042744917     PISSN: 01605682     EISSN: None     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2601590     Document Type: Article

References (17)

1. Orloff CS (1974). A fundamental problem in vehicle routing. Networks 4: 35-64.
2. Lenstra JK and Rinnooy Kan AHG (1976). On general routing problems. Networks 6: 273-280.
3. Edmonds J and Johnson EL (1973). Matching, Euler tours and the Chinese postman problem. Math Programming 5: 88-124.
4. Bellmore M and Malone J (1971). Pathology of traveling salesman subtour elimination algorithms. Opns Res 19: 278-307.
5. Male JW, Liebman JC and Orloff CS (1977). An improvement of Orloff's general routing problem. Networks 7: 89-92.
6. Orloff CS and Caprera D (1976). Reduction and solution of large scale vehicle routing problems. Transp Sci. 10: 361-373.
7. Jansen K (1992). An approximation algorithm for the general routing problem. Inform Process Lett 41: 333-339.
8. Christofides N (1976). Worst case analysis of a new heuristic for the traveling salesman problem. Management Science Research Report 388 Carnegie Mellon University, Pittsburgh.
9. Corberán A, Letchford AN and Sanchis JM (2001). A cutting plane algorithm for the general routing problem. Math Programming Ser A 90: 291-316.
10. Noon CE and Bean JC (1991). A lagrangian based approach for the asymmetric generalized traveling salesman problem. Opns Res 39: 623-632.
11. Noon CE and Bean JC (1993). An efficient transformation of the generalized traveling salesman problem. INFOR 31: 39-44.
12. Lenstra JK and Rinnooy Kan AHG (1975). Some simple applications of the traveling salesman problem. Opl Res Q 26: 717-733.
13. Laporte G (1997). Modeling and solving several classes of arc routing problems as traveling salesman problems. Comput Opns Res 24: 1057-1061.
14. Carpaneto G, Dell'Amico M and Toth P (1995). Exact solution of large scale, asymmetric traveling salesman problems. ACM Trans Math Software 21: 395-409.
15. Carpaneto G, Dell'Amico M and Toth P (1995). A subroutine for the exact solution of large-scale, asymmetric traveling salesman problems. ACM Trans Math Software 21: 410-415.
16. Ghiani G and Laporte G (2000). A branch-and-cut algorithm for the undirected rural postman problem. Math Programming, Ser A 87: 467-481.
17. Ahuja RK, Magnanti TL and Orlin JB (1993). Network Flows. Prentice-Hall: Englewood Cliffs, NJ.