New genetic approach for the Traveling salesman problem

Thang Nguyen Bui, Byung R. Moon

Research output: Contribution to conferencePaper

38 Citations (Scopus)

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

Fingerprint

Traveling salesman problem
Genetic algorithms

All Science Journal Classification (ASJC) codes

  • Engineering(all)

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, .
Bui, Thang Nguyen ; Moon, Byung R. / New genetic approach for the Traveling salesman problem. Paper presented at Proceedings of the 1st IEEE Conference on Evolutionary Computation. Part 1 (of 2), Orlando, FL, USA, .6 p.
@conference{3f92c97be8384be1a8ba6a2f045b05a0,
title = "New genetic approach for the Traveling salesman problem",
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.",
author = "Bui, {Thang Nguyen} and Moon, {Byung R.}",
year = "1994",
month = "12",
day = "1",
language = "English (US)",
pages = "7--12",
note = "Proceedings of the 1st IEEE Conference on Evolutionary Computation. Part 1 (of 2) ; Conference date: 27-06-1994 Through 29-06-1994",

}

Bui, TN & Moon, BR 1994, 'New genetic approach for the Traveling salesman problem' Paper presented at Proceedings of the 1st IEEE Conference on Evolutionary Computation. Part 1 (of 2), Orlando, FL, USA, 6/27/94 - 6/29/94, pp. 7-12.

New genetic approach for the Traveling salesman problem. / Bui, Thang Nguyen; Moon, Byung R.

1994. 7-12 Paper presented at Proceedings of the 1st IEEE Conference on Evolutionary Computation. Part 1 (of 2), Orlando, FL, USA, .

Research output: Contribution to conferencePaper

TY - CONF

T1 - New genetic approach for the Traveling salesman problem

AU - Bui, Thang Nguyen

AU - Moon, Byung R.

PY - 1994/12/1

Y1 - 1994/12/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0028608407&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0028608407&partnerID=8YFLogxK

M3 - Paper

SP - 7

EP - 12

ER -

Bui TN, Moon BR. New genetic approach for the Traveling salesman problem. 1994. Paper presented at Proceedings of the 1st IEEE Conference on Evolutionary Computation. Part 1 (of 2), Orlando, FL, USA, .