Abstract
Given a set of products and a set of markets, the traveling purchaser problem looks for a tour visiting a subset of the markets to satisfy products demand at the minimum purchasing and traveling costs. In this paper, we analyze the dynamic variant of the problem (D-TPP) where the quantity made available in each market for each product may decrease over time. We introduce and compare several greedy strategies and test their impact on the solution in terms of feasibility and costs. In particular, we study an incremental approach where an initial naive strategy is improved and refined by a number of variants. Some of the proposed heuristics take into account either one of the two objective costs, while others are based on both traveling and purchasing costs. Extensive computational results are also provided on randomly generated instances.
Similar content being viewed by others
References
Boctor FF, Laporte G, Renaud J (2003) Heuristics for the traveling purchaser problem. Comput Oper Res 30: 491–504
Burstall RM (1966) A heuristic method for a job sequencing problem. Oper Res Q 17: 291–304
Buzacott JA, Dutta SK (1971) Sequencing many jobs on a multipurpose facility. Naval Res Logistics Q 18: 75–82
Das C (1975) Supply and redistribution rules for two-location inventory systems: one period analysis. Manage Sci 12: 756–776
Golden B, Levy L, Dahl R (1981) Two generalizations of the traveling salesman problem. Omega 9: 439–455
Gross D (1963) Centralized inventory control in multilocation supply systems. In: Scarf HE, Gilford DM, Shelly MW (eds) Multistage inventory models and tecniques. Stanford University Press, Stanford California
Hoadley B, Heyman DP (1977) A two-echelon inventory model with purchases, disposition, shipments, return and transshipments. Naval Res Logistics Q 24: 1–19
Karmarkar U (1981) The multiperiod multilocation inventory problem. Oper Res 29: 215–228
Laporte G, Riera-Ledesma J, Salazar-González JJ (2003) A branch-and-cut algorithm for the undirected traveling purchaser problem. Oper Res 6: 940–951
Mansini R, Pelizzari M, Saccomandi R (2005) An effective tabu search algorithm for the capacitated Traveling Purchaser Problem, Technical Report R.T. 2005-10-49 of the Department of Electronics for Automation, University of Brescia
Ong HL (1982) Approximate algorithms for the traveling purchaser problem. Oper Res Lett 1: 201–205
Pearn WL, Chien RC (1998) Improved solutions for the traveling purchaser problem. Comput Oper Res 25(11): 879–885
Psaraftis HN (1988) Dynamic vehicle routing problems. In: Golden BL, Assad AA (eds) Vehicle routing: methods and studies. North-Holland, Amsterdam, pp 223–249
Psaraftis HN (1995) Dynamic Vehicle Routing: status and prospects. Ann Opns Res 61: 143–164
Ramesh T (1978) Travelling Purchaser Problem, Technical Report, Department of Mathematics, Regional Engineering College, Warangal
Riera-Ledesma J, Salazar-González JJ (2005) A heuristic approach for the traveling purchaser problem. Eur J Oper Res 162: 142–152
Singh KN, van Oudheusden DL (1997) A branch and bound algorithm for the traveling purchaser problem. Eur J Oper Res 97: 571–579
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Angelelli, E., Mansini, R. & Vindigni, M. Exploring greedy criteria for the dynamic traveling purchaser problem. Cent Eur J Oper Res 17, 141–158 (2009). https://doi.org/10.1007/s10100-008-0080-0
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10100-008-0080-0