Heuristics for the traveling purchaser problem

This article deals with two versions of the traveling purchaser problem. In the uncapacitated version, the number of units of a given product availablle 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.