Tackling The Travelling Salesman Problem With Evolutionary Algorithms: Representations And Operators (1994)
| Citations: | 1 - 0 self |
BibTeX
@MISC{Larrañaga94tacklingthe,
author = {P. Larrañaga and C. M. H. Kuijpers and R.H. Murga},
title = {Tackling The Travelling Salesman Problem With Evolutionary Algorithms: Representations And Operators},
year = {1994}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
This report is the result of a study of literature carried out by the authors. It is a review of earlier studies by other researchers' published articles. The authors have not added any new information to them. Rather, they have tried to produce a review of the dierent attempts made to solve the Travelling Salesman Problem (TSP) with evolutionary algorithms. Because of time and space limitations, the authors restricted themselves to three branches of evolutionary algorithms: genetic algorithms, evolution strategies and evolutionary programming. The dierent operators which might be used in these evolutionary algorithms make up the main subject of this report. Other subjects, e.g. selection and stop criterions of the algorithms, are not concerned, and the performance of algorithms is dealt with only briey. Keywords: Evolutionary algorithms
