The effect of the asymmetry of road transportation networks on the traveling salesman problem

Computers and Operations Research

Volumn 39, Issue 7, 2012, Pages 1566-1576

  Rodríguez, Alejandro ^a   Ruiz, Rubén ^b  

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

^b INSTITUTO TECNOLÓGICO DE INFORMÁTICA   (Spain)

Author keywords

Algorithms; Asymmetric traveling salesman problem; Asymmetry; Geographic information systems; Road transportation networks

Indexed keywords

ASYMMETRIC TRAVELING SALESMAN PROBLEM; ASYMMETRIC VARIANTS; ASYMMETRY; BEST-KNOWN ALGORITHMS; DISTANCE MATRICES; EUCLIDEAN; GEOGRAPHICAL LOCATIONS; ROAD TRANSPORTATION NETWORKS; SCIENTIFIC LITERATURE; SOLUTION TIME; TRANSPORTATION PLANNERS; WORK STUDY;

ALGORITHMS; GEOGRAPHIC INFORMATION SYSTEMS; MOTOR TRANSPORTATION; ROADS AND STREETS;

TRAVELING SALESMAN PROBLEM;

EID: 81555198353     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2011.09.005     Document Type: Article

References (30)

1. E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, and D.B. Shmoys The traveling salesman problem. A guided tour of combinatorial optimization 1985 John Wiley & Sons Ltd New York
2. G. Gutin, and A. Punnen The traveling salesman problem and its variations vol. 12 2002 Kluwer Dordrecht, Boston, London
3. M. Flood The TSP Operations Research 4 1 1956 61 75
4. G. Clarke, and J. Wright Scheduling of vehicles from central depot to number of delivery points Operations Research 12 4 1964 568 581
5. P. Toth, D. Vigo, S. for Industrial, and A. Mathematics An overview of vehicle routing problems 2001 SIAM - Society for Industrial and Applied Mathematics Philadelphia
6. C. Daganzo The length of tours in zones of different shapes Transportation Research Part B 18 2 1984 135 145 (Pubitemid 14611754)
7. N. Christofides, and S. Eilon Expected distances in distribution problems Operations Research 20 4 1969 437 443
8. R. Love, and J. Morris Modeling inter-city road distances by mathematical functions Operational Research Quarterly 23 1 1972 61 71
9. R. Love, and J. Morris On estimating road distances by mathematical functions European Journal of Operational Research 36 2 1988 251 253 (Pubitemid 18650931)
10. N. Dubois, and F. Semet Estimation and determination of shortest-path length in a road network with obstacles European Journal of Operational Research 83 1 1995 105 116
11. S. Arora Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems Journal of the ACM 45 5 1998 753 782 (Pubitemid 128497506)
12. A. Asadpour, M.X. Goemans, A. Madry, S.O. Gharan, and A. Saberi An O(log n/log log n)-approximation algorithm for the asymmetric traveling salesman problem Proceedings of 21st annual ACM-SIAM symposium on discrete algorithms. Proceedings in applied mathematics vol. 135 2010 ACM, SIAM Activ Grp Discrete Math; SIGACT, SIAM Philadelphia 379 389
13. L. Gouveia, and J. Pires The asymmetric travelling salesman problem and a reformulation of the MillerTuckerZemlin constraints European Journal of Operational Research 112 1 1999 134 146
14. Fischetti M, Lodi A, Toth P. Solving real-world ATSP instances by branch-and-cut. In: Junger M, Reinelt G, Rinaldi G. editors. Combinatorial optimization Eureka Papers dedicated to Jack Edmonds. Lecture notes in computer science, vol. 2570, 2003. p. 6477.
15. B. Bontoux, C. Artigues, and D. Feillet A memetic algorithm with a large neighborhood crossover operator for the generalized traveling salesman problem Computers & Operations Research 37 11 2010 1844 1852 [Metaheuristics for logistics and vehicle routing]
16. R. Germs, B. Goldengorin, and M. Turkensteen Lower tolerance-based branch and bound algorithms for the ATSP Computers & Operations Research 39 2 2012 291 298
17. M. Goodchild, and K. Kemp NCGIA core curriculum in GIS. National Center for Geographic Information and Analysis 1990 University of California Santa Barbara, CA
18. R. Jonker, and T. Volgenant Transforming asymmetric into symmetric traveling salesman problems Operations Research Letters 2 4 1983 161 163 (Pubitemid 14505558)
19. D.C. Montgomery Design and analysis of experiments 7th ed. 2009 Wiley New York
20. T. Schiavinotto, and T. Stützle A review of metrics on permutations for search landscape analysis Computers & Operations Research 34 10 2007 3143 3153 (Pubitemid 46356742)
21. R. Hamming Error detecting and error correcting codes Bell System Technology Journal 29 2 1950 147 160
22. E. Alba Parallel metaheuristics. A new class of algorithms 2006 Wiley New York
23. G. Croes A method for solving traveling-salesman problems Operations Research 6 6 1958 791 812
24. D.L. Applegate, W.J. Cook, S. Dash, and A. Rohe Solution of a min-max vehicle routing problem INFORMS Journal on Computing 14 2 2002 132 143
25. S. Lin, and B. Kernighan Effective heuristic algorithm for traveling-salesman problem Operations Research 21 2 1973 498 516
26. K. Helsgaun An effective implementation of the LinKernighan traveling salesman heuristic European Journal of Operational Research 126 1 2000 106 130
27. Y. Nagata, and S. Kobayashi Edge assembly crossover: A high-power genetic algorithm for the travelling salesman problem ICGA 1997 450 457
28. Y. Nagata New EAX crossover for large TSP instances T.P. Runarsson, H.-G. Beyer, E.K. Burke, J.J.M. Guervós, L.D. Whitley, X. Yao, PPSN of lecture notes in computer science vol. 4193 2006 Springer 372 381 (Pubitemid 44609413)
29. Goldengorin B, Jaeger G, Molitor P, Tolerance based Contract-or-Patch heuristic-for the asymmetric TSP. In: Erlebach T. editors. Combinatorial and algorithmic aspects of networking. Lecture notes in computer science, Chester, England, vol. 4235, 2006. p. 8697.
30. D.L. Applegate, R.E. Bixby, V. Chvátal, and W.J. Cook The traveling salesman problem: a computational study 2006 Princeton University Press New Jersey