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.
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. In case of further problems read
the IDEAS help
page. Note that these files are not on the IDEAS
site. Please be patient as the files may be large.
Publisher Info
Paper provided by Indian Institute of Management Ahmedabad, Research and Publication Department in its series IIMA Working Papers with number
2006-06-03.
Did you know? All full texts are decentralized with the publishers, none reside on this server, thus making it possible to offer this service for free to all parties.