Improved heuristics for the traveling purchaser problem

Authors:
A. Teeninga;A. Volgenant
Affiliations:
Operations Research Group, Faculty of Economics and Econometrics, University of Amsterdam Roetersstraat 11, 1018 WB Amsterdam, The Netherlands;Operations Research Group, Faculty of Economics and Econometrics, University of Amsterdam Roetersstraat 11, 1018 WB Amsterdam, The Netherlands
Venue:
Computers and Operations Research
Year:
2004

Citing 3
Cited 2

Improved solutions for the traveling purchaser problem

Computers and Operations Research
Algorithm 97: Shortest path

Communications of the ACM
Approximation Algorithms for the Traveling Purchaser Problem and its Variants in Network Design

ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms

Ant colony optimization for the traveling purchaser problem

Computers and Operations Research
The multiple traveling purchaser problem for maximizing system's reliability with budget constraints

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.01

Visualization

Abstract

For the Traveling Purchaser Problem we describe improvement subprocedures that can be incorporated in known heuristics. Computational results show the effectiveness of these subprocedures in general savings, commodity adding and tour reduction heuristics for test instances up to size 200 and four different cost types, including both symmetric and non symmetric costs as well as coordinate based costs. The average improvement of the solutions is substantial, i.e., from three to more than seven times smaller gaps for the best heuristic, based on savings.