Heuristics for the traveling purchaser problem

DOI10.1016/S0305-0548(02)00020-5zbMath1026.90016MaRDI QIDQ1870801

Jacques Renaud, Gilbert Laporte, Fayez F. Boctor

Publication date: 14 May 2003

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

zbMATH Keywords

routingtraveling purchaser problemperturbation heuristics

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Traffic problems in operations research (90B20)

Related Items (18)

The bi-objective traveling purchaser problem with deliveries ⋮ Ant colony optimization for the traveling purchaser problem ⋮ The traveling purchaser problem, with multiple stacks and deliveries: a branch-and-cut approach ⋮ Solving the asymmetric traveling purchaser problem ⋮ The traveling purchaser problem with fast service option ⋮ A GRASP/Path‐Relinking algorithm for the traveling purchaser problem ⋮ Heuristic approaches for the family traveling salesman problem ⋮ The traveling purchaser problem with stochastic prices: exact and approximate algorithms ⋮ On the general problem statement of cargo carriages scheduling and ways to solve it ⋮ Exploring greedy criteria for the dynamic traveling purchaser problem ⋮ Inbound and outbound flow integration for cross-docking operations ⋮ The traveling purchaser problem and its variants ⋮ A heuristic approach for the travelling purchaser problem ⋮ Models for a traveling purchaser problem with additional side-constraints ⋮ Solving the family traveling salesman problem ⋮ The traveling purchaser problem with budget constraint ⋮ Transgenetic algorithm for the traveling purchaser problem ⋮ Effective Algorithms for a Bounded Version of the Uncapacitated TPP

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

This page was built for publication: Heuristics for the traveling purchaser problem