Genetic algorithms for the traveling salesman problem
From MaRDI portal
Publication:1919848
DOI10.1007/BF02125403zbMath0851.90130OpenAlexW2069024107MaRDI QIDQ1919848
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
Programming involving graphs or networks (90C35) Learning and adaptive systems in artificial intelligence (68T05)
Related Items (27)
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 ⋮ Solving the dynamic traveling salesman problem using a genetic algorithm with trajectory prediction: an application to fish aggregating devices ⋮ Evolution-inspired local improvement algorithm solving orienteering problem ⋮ Metaheuristics: A bibliography ⋮ A hybrid scatter search for the probabilistic traveling salesman problem ⋮ A matheuristic algorithm for the pollution and energy minimization traveling salesman problems ⋮ Heuristics for a cash-collection routing problem with a cluster-first route-second approach ⋮ Metaheuristics: A Canadian Perspective ⋮ To improve the performance of genetic algorithms by using a novel selection operator ⋮ A generic construction for crossovers of graph-like structures and its realization in the Eclipse Modeling Framework ⋮ A hyper-heuristic based artificial bee colony algorithm for \(k\)-interconnected multi-depot multi-traveling salesman problem ⋮ A new approach to solving the multiple traveling salesperson problem using genetic algorithms ⋮ Optimization 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 trips ⋮ Solving fixed charge transportation problem with truck load constraint using metaheuristics ⋮ Diversified local search strategy under scatter search framework for the probabilistic traveling salesman problem ⋮ Different initial solution generators in genetic algorithms for solving the probabilistic traveling salesman problem ⋮ A note on a new greedy-solution representation and a new greedy parallelizable heuristic for the traveling salesman problem ⋮ Randomized gravitational emulation search algorithm for symmetric traveling salesman problem ⋮ A genetic algorithm approach to estimate lower bounds of the star discrepancy ⋮ Last-Mile Shared Delivery: A Discrete Sequential Packing Approach ⋮ An efficient genetic algorithm for the traveling salesman problem with precedence constraints ⋮ A hybrid genetic-GRASP algorithm using Lagrangean relaxation for the traveling salesman problem ⋮ Real-time multiserver and multichannel systems with shortage of maintenance crews. ⋮ A genetic algorithm with a mixed region search for the asymmetric traveling salesman problem ⋮ Metaheuristics in combinatorial optimization
Uses Software
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
This page was built for publication: Genetic algorithms for the traveling salesman problem