New genetic approach for the Traveling salesman problem

Thang N. Bui, Byung R. Moon

Research output: Contribution to conferencePaper

38 Scopus citations

Abstract

A new genetic algorithm (GA) for the Traveling Salesman Problem (TSP) is given. Two novel features of this algorithm are: (i) a new locus-based encoding/crossover pair, and (ii) a static preprocessing step which changes the encoding order of the vertices. It is believed that this algorithm is also applicable to other ordering problems, not just TSP. Experimental results on the standard benchmarks for TSP are favorable.

Original languageEnglish (US)
Pages7-12
Number of pages6
StatePublished - Dec 1 1994
EventProceedings of the 1st IEEE Conference on Evolutionary Computation. Part 1 (of 2) - Orlando, FL, USA
Duration: Jun 27 1994Jun 29 1994

Other

OtherProceedings of the 1st IEEE Conference on Evolutionary Computation. Part 1 (of 2)
CityOrlando, FL, USA
Period6/27/946/29/94

All Science Journal Classification (ASJC) codes

  • Engineering(all)

Fingerprint Dive into the research topics of 'New genetic approach for the Traveling salesman problem'. Together they form a unique fingerprint.

  • Cite this

    Bui, T. N., & Moon, B. R. (1994). New genetic approach for the Traveling salesman problem. 7-12. Paper presented at Proceedings of the 1st IEEE Conference on Evolutionary Computation. Part 1 (of 2), Orlando, FL, USA, .