Genetic Algorithm for TSP Problem

DOI

10.2991/iiicec-15.2015.319How to use a DOI?

Keywords

TSP problem; genetic algorithm; elitist strategy; adaptive mutation operator; convergence speed

Abstract

The TSP is a typical NPproblem. Therefore it is very important to the optimization for solving TSP problem. The genetic algorithm is one of ideal methods in solving it. However, the traditional genetic algorithm has the problems of slow convergence speed and local optimum. Aiming at the existing problems, the paper improved various operations and operatorsof traditional genetic algorithm, so that a better solution was put forward to solve the problem of local optimum prematurely. After making the selection operation, the elitist strategy was introduced to ensure the quality of the population gene; using adaptive mutation operator in mutation operation to improve the mutation quality and search result of algorithm. Genetic algorithm has characteristics of accurate result and fast convergence in solving TSP problem.

Copyright

© 2015, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Lijun Sun
PY  - 2015/03
DA  - 2015/03
TI  - Genetic Algorithm for TSP Problem
BT  - Proceedings of the 2015 International Industrial Informatics and Computer Engineering Conference
PB  - Atlantis Press
SP  - 1436
EP  - 1439
SN  - 2352-538X
UR  - https://doi.org/10.2991/iiicec-15.2015.319
DO  - 10.2991/iiicec-15.2015.319
ID  - Sun2015/03
ER  -