A hybrid random-key genetic algorithm for a symmetric travelling salesman problem

Funda Samanlioglu, Mary Beth Kurz, William G. Ferrell and Sarat Tangudu

International Journal of Operational Research, 2007, vol. 2, issue 1, 47-63

Abstract: This paper describes a methodology that finds approximate and sometimes optimal solutions to the symmetric Travelling Salesman Problem (TSP) using a hybrid approach that combines a Random-Key Genetic Algorithm (RKGA) with a local search procedure. The random keys representation ensures that feasible tours are constructed during the application of genetic operators, whereas the genetic algorithm approach with local search efficiently generates optimal or near-optimal solutions. The results of experiments are provided that use examples taken from a well-known online library to confirm the quality of the proposed algorithm.

Keywords: travelling salesman problem; TSP; genetic algorithms; GA; memetic algorithms; random keys; local search; operational research. (search for similar items in EconPapers)
Date: 2007
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=11443 (text/html)
Access to full text is restricted to subscribers.

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:ids:ijores:v:2:y:2007:i:1:p:47-63

Access Statistics for this article

More articles in International Journal of Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().