A new memetic algorithm for the asymmetric traveling salesman problem
From MaRDI portal
Publication:1771206
DOI10.1023/B:HEUR.0000045321.59202.52zbMath1062.90052OpenAlexW2060358758MaRDI QIDQ1771206
Luciana S. Buriol, Pablo Moscato, Paulo Morelato França
Publication date: 7 April 2005
Published in: Journal of Heuristics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/b:heur.0000045321.59202.52
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (14)
Efficient preprocessing methods for tabu search: an application on asymmetric travelling salesman problem ⋮ Survey of robot 3D path planning algorithms ⋮ A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem ⋮ A genetic algorithm/mathematical programming approach to solve a two-level soft drink production problem ⋮ Multiprogramming genetic algorithm for optimization problems with permutation property ⋮ Global optimization using a genetic algorithm with hierarchically structured population ⋮ A matheuristic algorithm for the pollution and energy minimization traveling salesman problems ⋮ Genetic Algorithm with Optimal Recombination for the Asymmetric Travelling Salesman Problem ⋮ Combinação de abordagens GLSP e ATSP para o problema de dimensionamento e sequenciamento de lotes de produção de suplementos para nutrição animal ⋮ Production setup-sequencing and lot-sizing at an animal nutrition plant through ATSP subtour elimination and patching ⋮ Tolerance-based branch and bound algorithms for the ATSP ⋮ Parallel hybrid heuristics for the permutation flow shop problem ⋮ Iterative patching and the asymmetric traveling salesman problem ⋮ Models and algorithms for the traveling salesman problem with time-dependent service times
Uses Software
This page was built for publication: A new memetic algorithm for the asymmetric traveling salesman problem
