Random tours in the traveling salesman problem: Analysis and application

Citation
H. Basel et Tr. Willemain, Random tours in the traveling salesman problem: Analysis and application, COMPUT OP A, 20(2), 2001, pp. 211-217
Citations number
20
Categorie Soggetti
Engineering Mathematics
Journal title
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS
ISSN journal
09266003 → ACNP
Volume
20
Issue
2
Year of publication
2001
Pages
211 - 217
Database
ISI
SICI code
0926-6003(200111)20:2<211:RTITTS>2.0.ZU;2-C
Abstract
Random solutions to the traveling salesman problem (TSP) exhibit statistica l regularities across problem instances. These patterns can assist heuristi c search for good solutions by providing easy estimates of the length of th e optimal tour.