A hybrid random-key genetic algorithm for a symmetric travelling salesman problem
type: Item
instance of: scholarly article
title: A hybrid random-key genetic algorithm for a symmetric travelling salesman problem
zbMATH Open document ID: 1278.90478
DOI: 10.1504/IJOR.2007.011443
author: Funda Samanlioglu
author: Mary Beth Kurz
author: Sarat Tangudu
author: William G. jun. Ferrell
published in: International Journal of Operational Research
publication date: 2007-06-14T00:00:00Z
review text: Summary: We describe 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.
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 5164571
MaRDI profile type: Publication
Wikidata QID: Q59270012
description: scientific article; zbMATH DE number 5164571