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.90010OpenAlexW1985879170MaRDI QIDQ1296791

Mohammad M. Amini, Lawrence J. Schmitt

Publication date: 14 November 1999

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

Full work available at URL: https://doi.org/10.1016/s0377-2217(97)00206-3

zbMATH Keywords

genetic algorithmstraveling salesman problemcomputational analysiscombinational analysisstatistical experimental design

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Transportation, logistics and supply chain management (90B06)

Related Items (7)

Heuristic approaches for batching jobs in printed circuit board assembly ⋮ A GROUPING GENETIC ALGORITHM FOR THE MULTIPLE TRAVELING SALESPERSON PROBLEM ⋮ A fishing route optimization decision support system: the case of the tuna purse seiner ⋮ A new approach to solving the multiple traveling salesperson problem using genetic algorithms ⋮ Quality inspection scheduling for multi-unit service enterprises ⋮ Randomized gravitational emulation search algorithm for symmetric traveling salesman problem ⋮ A genetic algorithm with a mixed region search for the asymmetric traveling salesman problem

Uses Software

• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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

This page was built for publication: Performance characteristics of alternative genetic algorithmic approaches to the traveling salesman problem using path representation: An empirical study