An empirical investigation into randomly generated Euclidean symmetric traveling salesman problems

Diptesh Ghosh and Megha Sharma

No WP2006-06-03, IIMA Working Papers from Indian Institute of Management Ahmedabad, Research and Publication Department

Abstract: The traveling salesman problem is one of the most well-solved hard combinatorial optimization problems. Any new algorithm or heuristic for the traveling salesman problem is empirically evaluated based on its performance on standard test instances, as well as on randomly generated instances. However, properties of randomly generated traveling salesman instances have not been reported in the literature. In this paper, we report the results from an empirical investigation on the properties of randomly generated Euclidean traveling salesman problem. Our experiments focus on the properties of the edge lengths and the distribution of the tour lengths of all tours in instances for symmetric traveling salesman problems.

Date: 2006-06-03
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.iima.ac.in/sites/default/files/rnpfiles/2006-06-03dghosh.pdf English Version (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:iim:iimawp:wp01960

Access Statistics for this paper

More papers in IIMA Working Papers from Indian Institute of Management Ahmedabad, Research and Publication Department Contact information at EDIRC.
Bibliographic data for series maintained by ().