Self-Adaptive Genetic Algorithm and Travelling Salesman Problem

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F47813059%3A19520%2F10%3A%230000578" target="_blank" >RIV/47813059:19520/10:#0000578 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
Self-Adaptive Genetic Algorithm and Travelling Salesman Problem
Original language description
The aim of this paper is presentation of encoding for self-adaptation of genetic algorithms which is suitable for travelling salesman problem. Comparing to previous approaches here is designed the encoding for self-adaptation not only one parameter or several ones but for all possible parameters of genetic algorithms at the same time. The proposed self-adaptive genetic algorithm is then applied for solving various instances of travelling salesman problem and compared with a standard genetic algorithm. The main advantage of this approach is that it makes possible to solve wide range of combinatorial problems without setting parameters for each type of problem in advance.
Czech name
—
Czech description
—

Project
<a href="/en/project/GA402%2F09%2F0405" target="_blank" >GA402/09/0405: Development of Non-standard Optimization Methods and their Applications in Economy and Management</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year
2010
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection
Mendel 2010. 16th International Conference on Sot Computing.
ISBN
978-80-214-4120-0
ISSN
—
e-ISSN
—
Number of pages
8
Pages from-to
—
Publisher name
VUT Brno
Place of publication
Brno
Event location
Brno
Event date
Jan 1, 2010
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
BTU85

Similar results(10)