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 language | English (US) |
|---|---|
| Pages | 7-12 |
| Number of pages | 6 |
| State | Published - 1994 |
| Event | Proceedings of the 1st IEEE Conference on Evolutionary Computation. Part 1 (of 2) - Orlando, FL, USA Duration: Jun 27 1994 → Jun 29 1994 |
Other
| Other | Proceedings of the 1st IEEE Conference on Evolutionary Computation. Part 1 (of 2) |
|---|---|
| City | Orlando, FL, USA |
| Period | 6/27/94 → 6/29/94 |
All Science Journal Classification (ASJC) codes
- General Engineering