Improved heuristics for the traveling purchaser problem.

DOI10.1016/S0305-0548(02)00193-4zbMath1039.90005MaRDI QIDQ1422388

A. Teeninga, A. Volgenant

Publication date: 14 February 2004

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

zbMATH Keywords

HeuristicsNetwork optimizationTraveling purchaser

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)

Related Items

The bi-objective traveling purchaser problem with deliveries, Ant colony optimization for the traveling purchaser problem, The traveling purchaser problem with fast service option, A GRASP/Path‐Relinking algorithm for the traveling purchaser problem, The traveling purchaser problem and its variants, Models for a traveling purchaser problem with additional side-constraints, Transgenetic algorithm for the traveling purchaser problem

Cites Work

• Unnamed Item
• 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
• Dynamic tabu search strategies for the traveling purchaser problem