Journal Article10.1023/A:1006529012972
Genetic Algorithms for the Travelling Salesman Problem: A Review of Representations and Operators
TL;DR: This paper presents crossover and mutation operators, developed to tackle the Travelling Salesman Problem with Genetic Algorithms with different representations such as: binary representation, path representation, adjacency representation, ordinal representation and matrix representation.
read more
Abstract: This paper is the result of a literature study carried out by the authors. It is a review of the different attempts made to solve the Travelling Salesman Problem with Genetic Algorithms. We present crossover and mutation operators, developed to tackle the Travelling Salesman Problem with Genetic Algorithms with different representations such as: binary representation, path representation, adjacency representation, ordinal representation and matrix representation. Likewise, we show the experimental results obtained with different standard examples using combination of crossover and mutation operators in relation with path representation.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
•Journal Article
Two Individual Genetic Algorithm
Younis R. Elhaddad,Aiman Gannous +1 more
TL;DR: According to the results, the simple Genetic Algorithms with Multi-crossovers is much better than starting with population of 100 individuals and using only one type crossover (order crossover OX).
Optimization of a Generalized Traveling Salesmen Problem with Uncertainties
Ameneh Shahsavari,Nasser Shahsavari Pour +1 more
- 01 Jan 2014
TL;DR: In this paper mathematical modeling of the problem for several salesmen and uncertain parameters is addressed and further details such as demand queues in nodes and nodes priorities are considered to enrich the model.
Job-Scheduling for automated Car Parking Systems : A Machine Learning Approach
Jan Lödige
- 01 Jan 2018
TL;DR: The ever growing amount of cars and their requirement for parking space has led to the development of highly sophisticated public automated car parking systems.
References
Genetic algorithms in search, optimization and machine learning
David E. Goldberg
- 01 Jan 1989
TL;DR: This book brings together the computer techniques, mathematical tools, and research results that will enable both students and practitioners to apply genetic algorithms to problems in many fields.
58.6K
•Book
Genetic algorithms in search, optimization, and machine learning
David E. Goldberg
- 01 Sep 1988
TL;DR: In this article, the authors present the computer techniques, mathematical tools, and research results that will enable both students and practitioners to apply genetic algorithms to problems in many fields, including computer programming and mathematics.
Optimization by Simulated Annealing
TL;DR: There is a deep and useful connection between statistical mechanics and multivariate or combinatorial optimization (finding the minimum of a given function depending on many parameters), and a detailed analogy with annealing in solids provides a framework for optimization of very large and complex systems.
46.9K
•Book
Adaptation in natural and artificial systems
John H. Holland
- 01 Jan 1975
TL;DR: Names of founding work in the area of Adaptation and modiication, which aims to mimic biological optimization, and some (Non-GA) branches of AI.
•Book
Genetic Programming: On the Programming of Computers by Means of Natural Selection
John R. Koza
- 01 Jan 1992
TL;DR: This book discusses the evolution of architecture, primitive functions, terminals, sufficiency, and closure, and the role of representation and the lens effect in genetic programming.
15K