Heuristics for the traveling purchaser problem
From MaRDI portal
Publication:1870801
DOI10.1016/S0305-0548(02)00020-5zbMath1026.90016MaRDI QIDQ1870801
Fayez F. Boctor, Gilbert Laporte, Jacques Renaud
Publication date: 14 May 2003
Published in: Computers \& Operations Research (Search for Journal in Brave)
90C59: Approximation methods and heuristics in mathematical programming
90B20: Traffic problems in operations research
Related Items
A heuristic approach for the travelling purchaser problem, Solving the asymmetric traveling purchaser problem, The traveling purchaser problem with budget constraint, Ant colony optimization for the traveling purchaser problem
Cites Work
- An approximation algorithm for the TSP
- Travelling purchaser problem
- A branch and bound algorithm for the traveling purchaser problem
- An efficient composite heuristic for the symmetric generalized traveling salesman problem
- Improved solutions for the traveling purchaser problem.
- Perturbation heuristics for the pickup and delivery traveling salesman problem
- Approximate algorithms for the travelling purchaser problem
- Dynamic tabu search strategies for the traveling purchaser problem
- A Branch-and-Cut Algorithm for the Undirected Traveling Purchaser Problem
- Genetic Algorithms-a Tool for OR?
- A Fast Composite Heuristic for the Symmetric Traveling Salesman Problem
- Sequencing many jobs on a multi-purpose facility
