The noisy euclidean traveling salesman problem: A computational analysis

Operations Research/ Computer Science Interfaces Series

Volumn 36, Issue , 2006, Pages 247-270

  Li, Feiyue ^a   Golden, Bruce L ^b   Wasil, Edward A ^c  

^a Bldg 142   (United States)

^b UNIVERSITY OF MARYLAND   (United States)

^c AMERICAN UNIVERSITY   (United States)

Author keywords

Average trajectory; Computational analysis; Traveling salesman problem

Indexed keywords

EID: 84888788139     PISSN: 1387666X     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-0-387-39934-8_15     Document Type: Article

References (9)

1. M. L. Braun and J. M. Buhmann. The noisy Euclidean traveling salesman problem and learning, in Advances in Neural Information Processing Systems 14, T. Dietterich, S. Becker, and Z. Ghahramani, eds., 251-258, MIT Press, Cambridge, MA, 2002.
2. S. Coy, B. Golden, G. Runger, and E. Wasil. See the forest before the trees: Fine-tuned learning and its application to the traveling salesman problem. IEEE Transactions on Systems, Man, and Cybernetics, 28A: 454-464, 1998.
3. R. A. Finkel and J. L. Bentley. Quad trees, a data structure for retrieval on composite keys. Acta Informatica, 4: 1-9, 1974.
4. P. Jaillet. A priori solution of a traveling salesman problem in which a random subset of the customers are visited. Operations Research, 36: 929-936, 1988.
5. D. Johnson and L. McGeoch. The traveling salesman problem: A case study in local optimization, in Local Search in Combinatorial Optimization, E. Aarts and J. K. Lenstra, eds., 215-310, Wiley, London, 1997.
6. M. Jiinger, G. Reinelt, and G. Rinaldi. The traveling salesman problem, in Network Models, Volume 7, Handbooks in Operations Research and Management Science, M. Ball, T. Magnanti, C. Monma, and G. Nemhauser, eds., 225-330, North-Holland, Amsterdam, 1995.
7. S. Kirkpatrick, C. Gelatt, and M. Vecchi. Optimization by simulated annealing. Science, 220: 671-680,1983.
8. F. Li. Modeling and solving variants of the vehicle routing problem: Algorithms, test problems, and computational results. Ph.D. dissertation, University of Maryland, College Park, Maryland, 2005.
9. J. Pepper, B. Golden, and E. Wasil. Solving the traveling salesman problem with annealing-based heuristics: A computational study. IEEE Transactions on Systems, Man, and Cybernetics, 32A: 72-77, 2002.