An asymmetric TSP with time windows and with time-dependent travel times and costs: An exact solution through a graph transformation

European Journal of Operational Research

Volumn 189, Issue 3, 2008, Pages 789-802

  Albiach, José ^a   Sanchis, José María ^a   Soler, David ^a  

^a UNIVERSITAT POLITÈCNICA DE VALÈNCIA   (Spain)

Author keywords

Time window; Time dependence; Traveling salesman problem

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; COST ACCOUNTING; GRAPH THEORY; ROUTING PROTOCOLS;

MIXED GENERAL ROUTING PROBLEMS; TIME DEPENDENCE; TIME WINDOWS;

TRAVELING SALESMAN PROBLEM;

EID: 40849094266     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2006.09.099     Document Type: Article

References (31)

1. Ascheuer N., Fischetti M., and Grötschel M. A polyhedral study of the asymmetric traveling salesman problem with time windows. Networks 36 (2000) 69-79
2. Ascheuer N., Fischetti M., and Grötschel M. Solving the asymmetric travelling salesman problem with time windows by branch-and-cut. Mathematical Programming Series A 90 (2001) 475-506
3. Benavent E., and Soler D. The directed rural postman problem with turn penalties. Transportation Science 33 (1999) 408-418
4. Blais M., and Laporte G. Exact solution of the generalized routing problem through graph transformations. Journal of the Operational Research Society 54 (2003) 906-910
5. Carlton W.B., and Barnes J.W. Solving the traveling-salesman problem with time windows using tabu search. IIE Transactions 28 (1996) 617-629
6. Carpaneto G., Dell'Amico M., and Toth P. Exact solution of large-scale, asymmetric traveling salesman problems. ACM Transactions on Mathematical Software 21 4 (1995) 394-409
7. Carpaneto G., Dell'Amico M., and Toth P. Algorithm 750: CDT: A subroutine for the exact solution of large-scale, asymmetric traveling salesman problems. ACM Transactions on Mathematical Software 21 4 (1995) 410-415
8. Chopra S., and Rinaldi G. The graphical asymmetric traveling salesman polyhedron: Symmetric inequalities. SIAM Journal on Discrete Mathematics 9 4 (1996) 602-624
9. Corberán A., Martí R., Martínez E., and Soler D. The rural postman problem on mixed graphs with turn penalties. Computers and Operations Research 29 (2002) 887-903
10. Corberán A., Romero A., and Sanchis J.M. The mixed general routing polyhedron. Mathematical Programming Series A 96 (2003) 103-137
11. Corberán A., Mejía G., and Sanchis J.M. New results on the mixed general routing problem. Operations Research 53 (2005) 363-376
12. ILOG, S.A., ILOG CPLEX 8.0, 2002.
13. Desaulniers G., and Villeneuve D. The shortest path problem with time windows and linear waiting costs. Transportation Science 34 (2000) 312-319
14. Dumas Y., Desrosiers J., Gelinas E., and Solomon M.M. An optimal algorithm for the traveling salesman problem with time windows. Operations Research 43 2 (1995) 367-371
15. Fischetti M., and Toth P. An additive bounding procedure for the asymmetric traveling salesman problem. Mathematical Programming 53 (1992) 173-197
16. Fischetti M., and Toth P. A polyhedral approach to the asymmetric traveling salesman problem. Management Science 43 (1997) 1520-1536
17. Fischetti M., Lodi A., and Toth P. Exact methods for the ATSP. In: Gutin G., and Punnen A.P. (Eds). The Traveling Salesman Problem and its Variants (2002), Kluwer Academic Publishers 169-206
18. Fleischmann B., Gietz M., and Gnutzmann S. Time-varying travel times in vehicle routing. Transportation Science 38 (2004) 160-173
19. Focacci F., Lodi A., and Milano M. A hybrid exact algorithm for the TSPTW. INFORMS Journal on Computing 14 4 (2002) 403-417
20. Ichoua S., Gendreau M., and Potvin J.Y. Vehicle dispatching with time-dependent travel times. European Journal of Operational Research 144 (2003) 379-396
21. Gendreau M., Hertz A., Laporte G., and Stan M. A generalized insertion heuristic for the traveling salesman problem with time windows. Operations Research 46 3 (1998) 330-335
22. Haghani A., and Jung S. A dynamic vehicle routing problem with time-dependent travel times. Computers and Operations Research 32 (2005) 2959-2986
23. Laporte G. Modeling and solving several classes of arc routing problems as traveling salesman problems. Computers and Operations Research 24 (1997) 1057-1061
24. Malandraki C., and Daskin M.S. Time dependent vehicle routing problems: Formulations, properties and heuristic algorithms. Transportation Science 26 3 (1992) 185-200
25. Malandraki C., and Dial R.B. A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem. European Journal of Operational Research 90 (1996) 45-55
26. Noon C.E., and Bean J.C. An efficient transformation of the generalized traveling salesman problem. INFOR 31 (1993) 39-44
27. Pesant G., Gendreau M., Potvin J.Y., and Rousseau J.M. An exact constraint logic programming algorithm for the traveling salesman problem with time windows. Transportation Science 32 1 (1998) 12-29
28. Potvin J.Y., Xu Y., and Benyahia I. Vehicle routing and scheduling with dynamic travel times. Computers and Operations Research 33 4 (2006) 1129-1137
29. Wolfer Calvo R. A new heuristic for the traveling salesman problem with time windows. Transportation Science 34 1 (2000) 113-124
30. http://impa.webs.upv.es/informes.php?inf=11.
31. http://www.iwr.uni-heidelberg.de/groups/comopt/software/TSPLIB95/.