Genetic Algorithm for Traveling Salesman Problem with Modified Cycle Crossover Operator

Genetic algorithms are evolutionary techniques used for optimization purposes according to survival of the fittest idea. These methods do not ensure optimal solutions; however, they give good approximation usually in time. The genetic algorithms are useful for NP-hard problems, especially the travel...

Full description

Saved in:
Bibliographic Details
Published in:Computational Intelligence and Neuroscience 2017-01, Vol.2017 (2017), p.1-7
Main Authors: Mohamd Shoukry, Alaa, Hussain, Ijaz, Nauman Sajid, M., Shad, Muhammad Yousaf, Hussain, Abid, Gani, Showkat
Format: Article
Language:English
Subjects:
Algorithms
Approximation
Chromosomes
Computer applications
Computer science
Cooperative learning
Crossovers
Cybernetics
Evolutionary algorithms
Genetic algorithms
Heuristic
International conferences
Mutation
Neural networks
Operations research
Population
Traveling salesman problem
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Genetic algorithms are evolutionary techniques used for optimization purposes according to survival of the fittest idea. These methods do not ensure optimal solutions; however, they give good approximation usually in time. The genetic algorithms are useful for NP-hard problems, especially the traveling salesman problem. The genetic algorithm depends on selection criteria, crossover, and mutation operators. To tackle the traveling salesman problem using genetic algorithms, there are various representations such as binary, path, adjacency, ordinal, and matrix representations. In this article, we propose a new crossover operator for traveling salesman problem to minimize the total distance. This approach has been linked with path representation, which is the most natural way to represent a legal tour. Computational results are also reported with some traditional path representation methods like partially mapped and order crossovers along with new cycle crossover operator for some benchmark TSPLIB instances and found improvements.
ISSN:1687-5265
1687-5273
DOI:10.1155/2017/7430125