New binary representation in genetic algorithms for solving TSP by mapping permutations to a list of ordered numbers

Authors:
Amin Mohebifar
Affiliations:
Computer Department of Faculty of Engineering, University of Isfahan, Isfahan, Iran
Venue:
CIMMACS'06 Proceedings of the 5th WSEAS International Conference on Computational Intelligence, Man-Machine Systems and Cybernetics
Year:
2006

Citing 8
Cited 1

A study of permutation crossover operators on the traveling salesman problem

Proceedings of the Second International Conference on Genetic Algorithms on Genetic algorithms and their application
Adaptation in natural and artificial systems

Adaptation in natural and artificial systems
Genetic algorithms + data structures = evolution programs (3rd ed.)

Genetic algorithms + data structures = evolution programs (3rd ed.)
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms for the Travelling Salesman Problem: A Review of Representations and Operators

Artificial Intelligence Review
Genetic Algorithms for the Traveling Salesman Problem

Proceedings of the 1st International Conference on Genetic Algorithms
AllelesLociand the Traveling Salesman Problem

Proceedings of the 1st International Conference on Genetic Algorithms
Scheduling Problems and Traveling Salesmen: The Genetic Edge Recombination Operator

Proceedings of the 3rd International Conference on Genetic Algorithms

A mobile disaster management system using the android technology

WSEAS TRANSACTIONS on COMMUNICATIONS

Quantified Score

Hi-index	0.01

Visualization

Abstract

There have been various representations used for encoding TSP tours in Genetic Algorithms. These representations, except binary representation, are forced to define their own crossover and mutation operators, and they cannot work with classical operators. In the other hand, in such cases, there is no guarantee that solutions, which obtained by crossover and mutation operators, are valid. So, we need some operation to repair chromosomes and transform invalid tours to valid tours. This operation is a time-consuming process. However binary representation is not recommended, in this paper we propose our binary representation based on mapping all possible solutions to a list of ordered binary representations which has some advantages.