Genetic algorithms and traveling salesman problems

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

Sangit Chatterjee, Lucy A. Lynch, Cecilia Carrera

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 salesman; genetic algorithm; asexual reproduction plan

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

68T05: Learning and adaptive systems in artificial intelligence

Related Items

A genetic algorithm approach to the product line design problem using the seller's return criterion: An extensive comparative computational study, An efficient evolutionary algorithm for accurate polygonal approximation, Genetic algorithms and their statistical applications: an introduction, Heuristic approaches for batching jobs in printed circuit board assembly, A new genetic algorithm for solving nonconvex nonlinear programming problems, Quality inspection scheduling for multi-unit service enterprises, Performance characteristics of alternative genetic algorithmic approaches to the traveling salesman problem using path representation: An empirical study, A dynamic vehicle routing problem with time-dependent travel times, A genetic algorithm with a mixed region search for the asymmetric traveling salesman problem, 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, A new approach to solving the multiple traveling salesperson problem using genetic algorithms, Optimality conditions to the acyclic travelling salesman problem., An effective genetic algorithm approach to large scale mixed integer programming problems, A variable-grouping based genetic algorithm for large-scale integer programming

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