Genetic algorithms for the traveling salesman problem

From MaRDI portal
Revision as of 14:50, 1 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:1919848

DOI10.1007/BF02125403zbMath0851.90130OpenAlexW2069024107MaRDI QIDQ1919848

Jean-Yves Potvin

Publication date: 25 November 1996

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

Full work available at URL: https://doi.org/10.1007/bf02125403




Related Items (27)

A simple and effective evolutionary algorithm for the vehicle routing problemAn evolutionary algorithm approach to the share of choices problem in the product line designSolving the dynamic traveling salesman problem using a genetic algorithm with trajectory prediction: an application to fish aggregating devicesEvolution-inspired local improvement algorithm solving orienteering problemMetaheuristics: A bibliographyA hybrid scatter search for the probabilistic traveling salesman problemA matheuristic algorithm for the pollution and energy minimization traveling salesman problemsHeuristics for a cash-collection routing problem with a cluster-first route-second approachMetaheuristics: A Canadian PerspectiveTo improve the performance of genetic algorithms by using a novel selection operatorA generic construction for crossovers of graph-like structures and its realization in the Eclipse Modeling FrameworkA hyper-heuristic based artificial bee colony algorithm for \(k\)-interconnected multi-depot multi-traveling salesman problemA new approach to solving the multiple traveling salesperson problem using genetic algorithmsOptimization of real-time multiserver system with two different channels and shortage of maintenance facilities.A GA based heuristic for the vehicle routing problem with multiple tripsSolving fixed charge transportation problem with truck load constraint using metaheuristicsDiversified local search strategy under scatter search framework for the probabilistic traveling salesman problemDifferent initial solution generators in genetic algorithms for solving the probabilistic traveling salesman problemA note on a new greedy-solution representation and a new greedy parallelizable heuristic for the traveling salesman problemRandomized gravitational emulation search algorithm for symmetric traveling salesman problemA genetic algorithm approach to estimate lower bounds of the star discrepancyLast-Mile Shared Delivery: A Discrete Sequential Packing ApproachAn efficient genetic algorithm for the traveling salesman problem with precedence constraintsA hybrid genetic-GRASP algorithm using Lagrangean relaxation for the traveling salesman problemReal-time multiserver and multichannel systems with shortage of maintenance crews.A genetic algorithm with a mixed region search for the asymmetric traveling salesman problemMetaheuristics in combinatorial optimization


Uses Software


Cites Work


This page was built for publication: Genetic algorithms for the traveling salesman problem