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

Ascheuer, 2000, A polyhedral study of the asymmetric traveling salesman problem with time windows, Networks, 36, 69, 10.1002/1097-0037(200009)36:2<69::AID-NET1>3.0.CO;2-Q Ascheuer, 2001, Solving the asymmetric travelling salesman problem with time windows by branch-and-cut, Mathematical Programming Series A, 90, 475, 10.1007/PL00011432 Benavent, 1999, The directed rural postman problem with turn penalties, Transportation Science, 33, 408, 10.1287/trsc.33.4.408 Blais, 2003, Exact solution of the generalized routing problem through graph transformations, Journal of the Operational Research Society, 54, 906, 10.1057/palgrave.jors.2601590 Carlton, 1996, Solving the traveling-salesman problem with time windows using tabu search, IIE Transactions, 28, 617, 10.1080/15458830.1996.11770707 Carpaneto, 1995, Exact solution of large-scale, asymmetric traveling salesman problems, ACM Transactions on Mathematical Software, 21, 394, 10.1145/212066.212081 Carpaneto, 1995, Algorithm 750: CDT: A subroutine for the exact solution of large-scale, asymmetric traveling salesman problems, ACM Transactions on Mathematical Software, 21, 410, 10.1145/212066.212084 Chopra, 1996, The graphical asymmetric traveling salesman polyhedron: Symmetric inequalities, SIAM Journal on Discrete Mathematics, 9, 602, 10.1137/S089548019122232X Corberán, 2002, The rural postman problem on mixed graphs with turn penalties, Computers and Operations Research, 29, 887, 10.1016/S0305-0548(00)00091-5 Corberán, 2003, The mixed general routing polyhedron, Mathematical Programming Series A, 96, 103, 10.1007/s10107-003-0391-9 Corberán, 2005, New results on the mixed general routing problem, Operations Research, 53, 363, 10.1287/opre.1040.0168 ILOG, S.A., ILOG CPLEX 8.0, 2002. Desaulniers, 2000, The shortest path problem with time windows and linear waiting costs, Transportation Science, 34, 312, 10.1287/trsc.34.3.312.12298 Dumas, 1995, An optimal algorithm for the traveling salesman problem with time windows, Operations Research, 43, 367, 10.1287/opre.43.2.367 Fischetti, 1992, An additive bounding procedure for the asymmetric traveling salesman problem, Mathematical Programming, 53, 173, 10.1007/BF01585701 Fischetti, 1997, A polyhedral approach to the asymmetric traveling salesman problem, Management Science, 43, 1520, 10.1287/mnsc.43.11.1520 Fischetti, 2002, Exact methods for the ATSP, 169 Fleischmann, 2004, Time-varying travel times in vehicle routing, Transportation Science, 38, 160, 10.1287/trsc.1030.0062 Focacci, 2002, A hybrid exact algorithm for the TSPTW, INFORMS Journal on Computing, 14, 403, 10.1287/ijoc.14.4.403.2827 Ichoua, 2003, Vehicle dispatching with time-dependent travel times, European Journal of Operational Research, 144, 379, 10.1016/S0377-2217(02)00147-9 Gendreau, 1998, A generalized insertion heuristic for the traveling salesman problem with time windows, Operations Research, 46, 330, 10.1287/opre.46.3.330 Haghani, 2005, A dynamic vehicle routing problem with time-dependent travel times, Computers and Operations Research, 32, 2959, 10.1016/j.cor.2004.04.013 Laporte, 1997, Modeling and solving several classes of arc routing problems as traveling salesman problems, Computers and Operations Research, 24, 1057, 10.1016/S0305-0548(97)00013-0 Malandraki, 1992, Time dependent vehicle routing problems: Formulations, properties and heuristic algorithms, Transportation Science, 26, 185, 10.1287/trsc.26.3.185 Malandraki, 1996, A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem, European Journal of Operational Research, 90, 45, 10.1016/0377-2217(94)00299-1 Noon, 1993, An efficient transformation of the generalized traveling salesman problem, INFOR, 31, 39 Pesant, 1998, An exact constraint logic programming algorithm for the traveling salesman problem with time windows, Transportation Science, 32, 12, 10.1287/trsc.32.1.12 Potvin, 2006, Vehicle routing and scheduling with dynamic travel times, Computers and Operations Research, 33, 1129, 10.1016/j.cor.2004.09.015 Wolfer Calvo, 2000, A new heuristic for the traveling salesman problem with time windows, Transportation Science, 34, 113, 10.1287/trsc.34.1.113.12284 http://impa.webs.upv.es/informes.php?inf=11. http://www.iwr.uni-heidelberg.de/groups/comopt/software/TSPLIB95/.