A genetic algorithm with a mixed region search for the asymmetric traveling salesman problem

DOI10.1016/S0305-0548(02)00050-3zbMath1026.90073OpenAlexW2157005019MaRDI QIDQ1870831

Seong-In Kim, Hak-Soo Kim, In-Chan Choi

Publication date: 14 May 2003

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0305-0548(02)00050-3

zbMATH Keywords

combinatorial optimizationgenetic algorithmasymmetric traveling salesman problemsheuristic proceduremixed region search

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (12)

Efficient preprocessing methods for tabu search: an application on asymmetric travelling salesman problem ⋮ A multi-agent approach for solving traveling salesman problem ⋮ Using a genetic algorithm-based RAROC model for the performance and persistence of the funds ⋮ A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem ⋮ A hybrid genetic algorithm for the heterogeneous dial-a-ride problem ⋮ Evolutionary operators for the Hamiltonian completion problem ⋮ Multiprogramming genetic algorithm for optimization problems with permutation property ⋮ Genetic algorithm for asymmetric traveling salesman problem with imprecise travel times ⋮ A survey of repair methods used as constraint handling techniques in evolutionary algorithms ⋮ An application of real-coded genetic algorithm (for mixed integer non-linear programming in an optimal two-warehouse inventory policy for deteriorating items with a linear trend in demand and a fixed planning horizon) ⋮ An Efficient Genetic Algorithm for the Traveling Salesman Problem ⋮ New Imperialist Competitive Algorithm to solve the travelling salesman problem

Uses Software

• CDT
• VRP

Cites Work

• Unnamed Item
• Unnamed Item
• Results from a parallel branch-and-bound algorithm for the asymmetric traveling salesman problem
• A worst-case analysis of two approximate algorithms for the asymmetric travelling salesman problem
• The vehicle routing problem: An overview of exact and approximate algorithms
• Optimizing tabu list size for the traveling salesman problem
• Genetic algorithms and traveling salesman problems
• Performance characteristics of alternative genetic algorithmic approaches to the traveling salesman problem using path representation: An empirical study
• Tabu search performance on the symmetric travelling salesman problem
• Genetic algorithm crossover operators for ordering applications
• A note on the complexity of the asymmetric traveling salesman problem
• Job shop scheduling with separable sequence-dependent setups
• The final NETLIB-LP results
• The asymmetric travelling salesman problem and a reformulation of the Miller-Tucker-Zemlin constraints
• Genetic algorithms for the traveling salesman problem
• A Patching Algorithm for the Nonsymmetric Traveling-Salesman Problem
• Algorithm 750: CDT
• A Polyhedral Approach to the Asymmetric Traveling Salesman Problem
• The Graphical Asymmetric Traveling Salesman Polyhedron: Symmetric Inequalities
• An Algorithm for the Traveling Salesman Problem
• Pathology of Traveling-Salesman Subtour-Elimination Algorithms
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem

This page was built for publication: A genetic algorithm with a mixed region search for the asymmetric traveling salesman problem