Heuristics for the traveling purchaser problem

Authors:
Fayez F. Boctor;Gilbert Laporte;Jacques Renaud
Affiliations:
Faculté des sciences de l'administration and Centre de recherche sur les technologies de l'organisation réseau, Université Laval, Qué., Canada G1K 7P4;Chaire de recherche du Canada en Distributique, École des Hautes Études Commerciales and Centre de recherche sur les transports, Université de Montréal, CP 6128, succursale "Ce ...;Faculté des sciences de l'administration, Université and Centre de recherche sur les technologies de l'organisation réseau, Université Laval, Qué., Canada G1K 7P4
Venue:
Computers and Operations Research
Year:
2003

Citing 3
Cited 7

An approximation algorithm for the TSP

Information Processing Letters
Improved solutions for the traveling purchaser problem

Computers and Operations Research
Perturbation heuristics for the pickup and delivery traveling salesman problem

Computers and Operations Research

Transgenetic algorithm: a new evolutionary perspective for heuristics design

Proceedings of the 9th annual conference companion on Genetic and evolutionary computation
Ant colony optimization for the traveling purchaser problem

Computers and Operations Research
The traveling purchaser problem with budget constraint

Computers and Operations Research
Collaborative production-distribution planning for semiconductor production turnkey service

ICCSA'07 Proceedings of the 2007 international conference on Computational science and its applications - Volume Part I
The multiple traveling purchaser problem for maximizing system's reliability with budget constraints

Expert Systems with Applications: An International Journal
Look-ahead heuristics for the dynamic traveling purchaser problem

Computers and Operations Research
The traveling purchaser problem, with multiple stacks and deliveries: A branch-and-cut approach

Computers and Operations Research

Quantified Score

Hi-index	0.02

Visualization

Abstract

This article deals with two versions of the traveling purchaser problem. In the uncapacitated version, the number of units of a given product available at any market where it is sold is either larger than or equal to the demand. In the capacitated version, the availability may be smaller than the demand. This study extends some known heuristics and presents some new ones capable of solving either version of the problem. The new heuristics are compared to each other and to some previous heuristics. Computational results confirm the quality of the proposed heuristics.