Genetic algorithms for the traveling salesman problem

DOI10.1007/BF02125403zbMath0851.90130MaRDI QIDQ1919848

Jean-Yves Potvin

Publication date: 25 November 1996

Published in: Annals of Operations Research (Search for Journal in Brave)

zbMATH Keywords

survey; traveling salesman; genetic algorithms; stochastic search; randomized search

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

68T05: Learning and adaptive systems in artificial intelligence

Related Items

A note on a new greedy-solution representation and a new greedy parallelizable heuristic for the traveling salesman problem, Metaheuristics in combinatorial optimization, A hybrid scatter search for the probabilistic traveling salesman problem, Optimization of real-time multiserver system with two different channels and shortage of maintenance facilities., Real-time multiserver and multichannel systems with shortage of maintenance crews., An efficient genetic algorithm for the traveling salesman problem with precedence constraints, A genetic algorithm with a mixed region search for the asymmetric traveling salesman problem, A simple and effective evolutionary algorithm for the vehicle routing problem, An evolutionary algorithm approach to the share of choices problem in the product line design, Metaheuristics: A bibliography, A new approach to solving the multiple traveling salesperson problem using genetic algorithms, A hybrid genetic-GRASP algorithm using Lagrangean relaxation for the traveling salesman problem

Uses Software

• GIDEON

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
• Serial and parallel simulated annealing and tabu search algorithms for the traveling salesman problem
• Facet identification for the symmetric traveling salesman polytope
• ``Neural computation of decisions in optimization problems
• Optimization of a 532-city symmetric traveling salesman problem by branch and cut
• Evolution algorithms in combinatorial optimization
• The traveling salesman problem: An overview of exact and approximate algorithms
• A quantitative analysis of the simulated annealing algorithm: A case study for the traveling salesman problem.
• A genetic algorithm for the linear transportation problem
• A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
• A Nonstandard Genetic Algorithm for the Nonlinear Transportation Problem
• Fast Algorithms for Geometric Traveling Salesman Problems
• New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
• An Analysis of Several Heuristics for the Traveling Salesman Problem
• Computer Solutions of the Traveling Salesman Problem
• A man-machine approach toward solving the traveling salesman problem
• The Traveling-Salesman Problem and Minimum Spanning Trees
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem