Performance characteristics of alternative genetic algorithmic approaches to the traveling salesman problem using path representation: An empirical study

DOI10.1016/S0377-2217(97)00206-3zbMath0951.90010MaRDI QIDQ1296791

Mohammad M. Amini, Lawrence J. Schmitt

Publication date: 14 November 1999

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

zbMATH Keywords

genetic algorithms; traveling salesman problem; computational analysis; combinational analysis; statistical experimental design

Mathematics Subject Classification ID

90C90: Applications of mathematical programming

90B06: Transportation, logistics and supply chain management

Related Items

Heuristic approaches for batching jobs in printed circuit board assembly, Quality inspection scheduling for multi-unit service enterprises, A genetic algorithm with a mixed region search for the asymmetric traveling salesman problem, A new approach to solving the multiple traveling salesperson problem using genetic algorithms, A GROUPING GENETIC ALGORITHM FOR THE MULTIPLE TRAVELING SALESPERSON PROBLEM

Uses Software

• Tabu search

Cites Work

• The traveling salesman problem: An overview of exact and approximate algorithms
• Genetic algorithms and traveling salesman problems
• Genetic algorithms and tabu search: Hybrids for optimization
• Heuristics Based on Spacefilling Curves for Combinatorial Problems in Euclidean Space
• Network Reoptimization Algorithms: A Statistically Designed Comparison
• A Rigorous Computational Comparison of Alternative Solution Methods for the Generalized Assignment Problem
• Computer Solutions of the Traveling Salesman Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item