A heuristic approach for the travelling purchaser problem

DOI10.1016/j.ejor.2003.10.032zbMath1132.90366OpenAlexW2069183558MaRDI QIDQ707139

Jorge Riera-Ledesma, Juan-José Salazar-González

Publication date: 9 February 2005

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2003.10.032

zbMATH Keywords

HeuristicsTravelling Salesman

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items

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, An effective matheuristic for the capacitated total quantity discount problem, The traveling purchaser problem with time-dependent quantities, Solving the asymmetric traveling purchaser problem, The traveling purchaser problem with fast service option, A GRASP/Path‐Relinking algorithm for the traveling purchaser problem, Exploring greedy criteria for the dynamic traveling purchaser problem, The traveling purchaser problem and its variants, An experimental analysis of evolutionary heuristics for the biobjective traveling purchaser problem, Models for a traveling purchaser problem with additional side-constraints, The traveling purchaser problem with budget constraint, Transgenetic algorithm for the traveling purchaser problem, Effective Algorithms for a Bounded Version of the Uncapacitated TPP

Uses Software

• Concorde

Cites Work

• Unnamed Item
• Algorithms to solve the orienteering problem: A comparison
• Travelling purchaser problem
• A branch and bound algorithm for the traveling purchaser problem
• Improved solutions for the traveling purchaser problem.
• Approximate algorithms for the travelling purchaser problem
• Heuristics for the traveling purchaser problem
• Dynamic tabu search strategies for the traveling purchaser problem
• A Branch-and-Cut Algorithm for the Undirected Traveling Purchaser Problem
• Sequencing many jobs on a multi-purpose facility
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem