Genetic algorithms for the traveling salesman problem
type: Item
instance of: scholarly article
title: Genetic algorithms for the traveling salesman problem
zbMATH Open document ID: 0851.90130
DOI: 10.1007/BF02125403
author: Jean-Yves Potvin
published in: Annals of Operations Research
publication date: 1996-11-25T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 68T05
zbMATH DE Number: 910211
zbMATH Keywords: stochastic search
zbMATH Keywords: survey
zbMATH Keywords: genetic algorithms
zbMATH Keywords: traveling salesman
zbMATH Keywords: randomized search
describes a project that uses: GIDEON
MaRDI profile type: Publication
cites work: A quantitative analysis of the simulated annealing algorithm: A case study for the traveling salesman problem.
cites work: Fast Algorithms for Geometric Traveling Salesman Problems
cites work: Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
cites work: Q5527536
cites work: New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
cites work: Q3829367
cites work: Q4692508
cites work: Q3829370
cites work: The Traveling-Salesman Problem and Minimum Spanning Trees
cites work: ``Neural'' computation of decisions in optimization problems
cites work: Optimization by Simulated Annealing
cites work: A man-machine approach toward solving the traveling salesman problem
cites work: The traveling salesman problem: An overview of exact and approximate algorithms
cites work: Q5187226
cites work: Computer Solutions of the Traveling Salesman Problem
cites work: An Effective Heuristic Algorithm for the Traveling-Salesman Problem
cites work: Serial and parallel simulated annealing and tabu search algorithms for the traveling salesman problem
cites work: A Nonstandard Genetic Algorithm for the Nonlinear Transportation Problem
cites work: Evolution algorithms in combinatorial optimization
cites work: Optimization of a 532-city symmetric traveling salesman problem by branch and cut
cites work: A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
cites work: Facet identification for the symmetric traveling salesman polytope
cites work: An Analysis of Several Heuristics for the Traveling Salesman Problem
cites work: A genetic algorithm for the linear transportation problem
full work available at URL: https://doi.org/10.1007/bf02125403
OpenAlex ID: W2069024107
description: scientific article; zbMATH DE number 910211