A fast optimization method based on a hierarchical strategy for the travelling salesman problem

T. Sun, P. Meakin and T. Jøssang

Physica A: Statistical Mechanics and its Applications, 1993, vol. 199, issue 2, 232-242

Abstract: An algorithm based on a hierarchical strategy is proposed for solving the travelling salesman problem. The tour patterns have been analyzed and compared with those generated from different stages of simulated annealing. A set of problems with known solutions has been used to evaluate the new algorithm. The hierarchical algorithm is shown to be very fast. It finds a path length similar to that obtained using simulated annealing algorithm. The path length is quite far from the global minimum but compares favorably to that obtained using simulated annealing.

Date: 1993
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/037843719390004N
Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000

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:eee:phsmap:v:199:y:1993:i:2:p:232-242

DOI: 10.1016/0378-4371(93)90004-N

Access Statistics for this article

Physica A: Statistical Mechanics and its Applications is currently edited by K. A. Dawson, J. O. Indekeu, H.E. Stanley and C. Tsallis

More articles in Physica A: Statistical Mechanics and its Applications from Elsevier
Bibliographic data for series maintained by Catherine Liu ().