Genetic algorithms and traveling salesman problems

DOI10.1016/0377-2217(95)00077-1zbMath0912.90276OpenAlexW2130137264MaRDI QIDQ1268132

Cecilia Carrera, Lucy A. Lynch, Sangit Chatterjee

Publication date: 18 October 1998

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(95)00077-1

zbMATH Keywords

traveling salesmangenetic algorithmasexual reproduction plan

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Learning and adaptive systems in artificial intelligence (68T05)

Related Items (22)

An evolutionary algorithm approach to the share of choices problem in the product line design ⋮ Particle swarm optimization combined with genetic operators for job shop scheduling problem with fuzzy processing time ⋮ Social structure optimization in team formation ⋮ Heuristic approaches for batching jobs in printed circuit board assembly ⋮ A double-loop hybrid algorithm for the traveling salesman problem with arbitrary neighbourhoods ⋮ A new approach to solving the multiple traveling salesperson problem using genetic algorithms ⋮ A new genetic algorithm for solving nonconvex nonlinear programming problems ⋮ Genetic algorithms and their statistical applications: an introduction ⋮ Optimality conditions to the acyclic travelling salesman problem. ⋮ Quality inspection scheduling for multi-unit service enterprises ⋮ An effective genetic algorithm approach to large scale mixed integer programming problems ⋮ A genetic algorithm approach to the product line design problem using the seller's return criterion: An extensive comparative computational study ⋮ A dynamic vehicle routing problem with time-dependent travel times ⋮ An efficient evolutionary algorithm for accurate polygonal approximation ⋮ Randomized gravitational emulation search algorithm for symmetric traveling salesman problem ⋮ A variable-grouping based genetic algorithm for large-scale integer programming ⋮ Completion time variance minimization in single machine and multi-machine systems ⋮ GENETIC ALGORITHMS WITH DYNAMIC MUTATION RATES AND THEIR INDUSTRIAL APPLICATIONS ⋮ Performance characteristics of alternative genetic algorithmic approaches to the traveling salesman problem using path representation: An empirical study ⋮ A set covering approach for multi-depot train driver scheduling ⋮ A new crossover approach for solving the multiple travelling salesmen problem using genetic algorithms ⋮ A genetic algorithm with a mixed region search for the asymmetric traveling salesman problem

Uses Software

• TSPLIB

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Evolution algorithms in combinatorial optimization
• The traveling salesman problem: An overview of exact and approximate algorithms
• Quick updates for \(p\)-opt TSP heuristics
• Neighborhood search algorithms for guaranteeing optimal traveling salesman tours must be inefficient
• A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
• Approximate Traveling Salesman Algorithms
• TSPLIB—A Traveling Salesman Problem Library
• A Computational Study of Local Search Algorithms for Job Shop Scheduling
• Computer Solutions of the Traveling Salesman Problem
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem

This page was built for publication: Genetic algorithms and traveling salesman problems