A genetic algorithm with a mixed region search for the asymmetric traveling salesman problem
type: Item
instance of: scholarly article
title: A genetic algorithm with a mixed region search for the asymmetric traveling salesman problem
zbMATH Open document ID: 1026.90073
DOI: 10.1016/S0305-0548(02)00050-3
author: Seong-In Kim
author: Hak-Soo Kim
author: In-Chan Choi
published in: Computers \& Operations Research
publication date: 2003-05-14T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 1910193
zbMATH Keywords: asymmetric traveling salesman problems
zbMATH Keywords: genetic algorithm
zbMATH Keywords: mixed region search
zbMATH Keywords: heuristic procedure
zbMATH Keywords: combinatorial optimization
describes a project that uses: CDT
describes a project that uses: VRP
MaRDI profile type: Publication
cites work: The vehicle routing problem: An overview of exact and approximate algorithms
cites work: Q5187226
cites work: An Effective Heuristic Algorithm for the Traveling-Salesman Problem
cites work: Tabu search performance on the symmetric travelling salesman problem
cites work: Optimizing tabu list size for the traveling salesman problem
cites work: Genetic algorithm crossover operators for ordering applications
cites work: Genetic algorithms for the traveling salesman problem
cites work: Genetic algorithms and traveling salesman problems
cites work: Performance characteristics of alternative genetic algorithmic approaches to the traveling salesman problem using path representation: An empirical study
cites work: Job shop scheduling with separable sequence-dependent setups
cites work: A Patching Algorithm for the Nonsymmetric Traveling-Salesman Problem
cites work: An Algorithm for the Traveling Salesman Problem
cites work: Results from a parallel branch-and-bound algorithm for the asymmetric traveling salesman problem
cites work: A Polyhedral Approach to the Asymmetric Traveling Salesman Problem
cites work: The asymmetric travelling salesman problem and a reformulation of the Miller-Tucker-Zemlin constraints
cites work: The Graphical Asymmetric Traveling Salesman Polyhedron: Symmetric Inequalities
cites work: A worst-case analysis of two approximate algorithms for the asymmetric travelling salesman problem
cites work: A note on the complexity of the asymmetric traveling salesman problem
cites work: Pathology of Traveling-Salesman Subtour-Elimination Algorithms
cites work: Q4003376
cites work: Algorithm 750: CDT
cites work: The final NETLIB-LP results
full work available at URL: s0305-0548(02)00050-3
OpenAlex ID: W2157005019
description: scientific article; zbMATH DE number 1910193