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
Shuffled Linear Regression with Outliers in Both Covariates and Responses
TL;DR: This work generalizes the formulation of shuffled linear regression to a broader range of conditions where only a part of the data should correspond, and presents a simple yet effective algorithm for deriving the solution.
3
Analytical Gradient-Guided Nonlinear Programming Approach for Multitarget Rendezvous Mission
TL;DR: Huang et al. as discussed by the authors proposed an analytical gradient-guided nonlinear programming approach for multitarget rendezvous with low-thrust active removal in low-Earth orbit.
3
Traveling salesman problem with drone and bicycle: multimodal last‐mile e‐mobility
Erfan Babaee Tirkolaee,Emre Cakmak,Saliha Karadayi-Usta +2 more
TL;DR: Traveling salesman problem with drone and bicycle (TSP‐D‐B) is a novel application of multimodal e‐mobility for last-mile delivery. A mixed integer linear programming model is developed to minimize total traveling time. The model considers a fleet of three vehicles and is able to efficiently solve benchmarks for up to 50 customers in 685 s maximum.
3
•Journal Article
Espacio literario relevante sobre el problema del vendedor viajero (TSP): contenido, clasificación, métodos y campos de inspiración Relevant literary space on travelling salesman problem (TSP): contents, classification, methods and fields of inspiration
TL;DR: This paper describes and analyzes the types of TSP, methods and fields of inspiration - the most relevant "literary space" on TSP - based on the top most cited on the TSP history and the Top 10 cited from 2006 to 2010.
3
•Dissertation
Parameterized analysis of bio-inspired computation and the traveling salesperson problem.
Samadhi Nethmini Nallaperuma
- 01 Jan 2015
TL;DR: ”parameterized analysis” of bio-inspired computation is introduced by linking together several emerging methods of algorithm analysis and design with the aim of explaining the relationship between various problem and algorithm parameters and their effects on the algorithm performance.
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