Journal of the Korean Operations Research and Management Science Society (한국경영과학회지)

The Korean Operations Research and Management Science Society (한국경영과학회)
권호 표지

Heterogeneous Multiple Traveling Purchaser Problem with Budget Constraint

예산 제약을 고려한 다용량 복수 순회구매자 문제

  • 최명진 (국방대학교 운영분석학과) ;
  • 이상헌 (국방대학교 운영분석학과)
  • Received : 2009.10.26
  • Accepted : 2010.02.11
  • Published : 2010.03.31
Download PDF
⟨ Previous Next ⟩

Abstract

In the last decade, traveling purchaser problem (TPP) has received some attention of the researchers in the operational research area. TPP is a generalization of the well-known traveling salesman problem (TSP), which has many real-world applications such as purchasing the required raw materials for the manufacturing factories and the scheduling of a set of jobs over some machines, and many others. In this paper we suggest heterogeneous multiple traveling purchaser problem with budget constraint (HMTPP-B) which looks for several cycles starting at and ending to the depot and visiting a subset at a minimum traveling cost and such that the demand for each product is satisfied and the cost spent for purchasing the products does not exceed a given budget threshold. All the past studies of TPP are restricted on a single purchaser. Therefore we randomly generated some instances. CPLEX is used for getting optimal solutions in these experiments.

Keywords

References

  1. 서상범, 이재민, 국가물류비 산정 및 추이분석, 한국교통연구원, 2007.
  2. 조한선, 이동민, 전국 교통혼잡비용 산출과 추이분석, 한국교통연구원, 2008.
  3. Angelelli, E., R. Mansini, and M. Vindigni, "Exploring greedy criteria for the dynamic traveling purchaser problem," Central European Journal of Operations Research(online published), 2008.
  4. Boctor, F.F., G. Laporte, and J. Renaud, "Heuristics for the traveling purchaser problem," Computers and Operations Research, Vol.30 (2003), pp.491-504. https://doi.org/10.1016/S0305-0548(02)00020-5
  5. Bontoux, B. and D. Feillet, "Ant colony optimization for the traveling purchaser problem," Computers and Operations Research, Vol.35(2008), pp.628-637. https://doi.org/10.1016/j.cor.2006.03.023
  6. Bowersox, D.J. and D.J. Closs, Logistical management : The integrated supply chain process, New York, NY, McGraw-Hill, 1996.
  7. Burstall, R.M., "A heuristic method for a job sequencing problem," Operational Research Quarterly, Vol.17(1966), pp.291-304. https://doi.org/10.1057/jors.1966.56
  8. Buzacott, J.A. and S.K. Dutta, "Sequencing many jobs on a multipurpose facility," Naval Research Logistics Quarterly, Vol.18(1971), pp.75-82. https://doi.org/10.1002/nav.3800180106
  9. Dantzig, G.B. and J.H. Ramser, "The Truck Dispatching Problem," Management Science, Vol.6(1959), pp.80-91. https://doi.org/10.1287/mnsc.6.1.80
  10. Drucker, P.F., Management's new paradigm, Forbes, October 1998, pp.152-177.
  11. Goldbarg, M.C., L.B. Bagi, and E.F.G. Goldbarg, "Transgenetic algorithm for the traveling purchaser problem," European Journal of Operations Research, Vol.199(2008), pp.36-45.
  12. Golden, B.L., L. Levy, R. Dahl, "Two generations of the traveling salesman problem," Omega, Vol.9(1981), pp.439-445. https://doi.org/10.1016/0305-0483(81)90087-6
  13. Johnson, G.A. and L. Malucci, Shift to supply chain reflects more strategic approach, APICS-The Performance Advantage, October 1999, pp.28-31.
  14. Lambert, D.M., M.C. Cooper, and J.D. Pagh, "Supply chain management : Implementation issues and research opportunities," The International Journal of Logistics Management, Vol.9(1998), pp.1-19.
  15. Laporte, G., J. Riera-Ledesma, and J.J. Salazar- Gonzalez, "A branch and cut algorithm for the undirected traveling purchaser problem," Operations Research, Vol.51(2003), pp. 142-152.
  16. Mansini, R. and B. Tocchella, "The traveling purchaser problem with budget constraint," Computers and Operations Research, Vol.36 (2009), pp.2263-2274. https://doi.org/10.1016/j.cor.2008.09.001
  17. Miller C.E., A.W. Tucker, and R.A. Zemlin, "Integer programming formulation of traveling salesman problems," Journal of Association for Computing Machinery, Vol.7(1960), pp.326-329. https://doi.org/10.1145/321043.321046
  18. Min, H. and G. Zhou, "Supply chain modeling : past, present and future," Computers and Industrial Engineering, Vol.43(2002), pp. 231-249. https://doi.org/10.1016/S0360-8352(02)00066-9
  19. Ong, H.L., "Approximate algorithm for the traveling purchaser problem," Operations Research Letters, Vol.1(1982), pp.201-205. https://doi.org/10.1016/0167-6377(82)90041-4
  20. Pearn, W.L. and R.C. Chien, "Improved solutions for the traveling purchaser problem," Computers and Operations Research, Vol.25 (1998), pp.879-885. https://doi.org/10.1016/S0305-0548(98)00032-X
  21. Ramesh, T., "Traveling purchaser problem," OPSEARCH, Vol.18(1981), pp.78-91.
  22. Riera-Ledesma, J. and J.J. Salazar-Gonález, "A heuristic approach for the traveling purchaser problem," European Journal of Operations Research, Vol.162(2005a), pp.142-152. https://doi.org/10.1016/j.ejor.2003.10.032
  23. Riera-Ledesma, J. and J.J. Salazar-Gonalez, "The biobjective traveling purchaser problem," European Journal of Operations Research, Vol.160(2005b), pp.599-613. https://doi.org/10.1016/j.ejor.2003.10.003
  24. Simchi-Levi, D., P. Kaminsky, and E. Simchi- Levi, Designing and managing the supply chain : concepts, strategy, and case study, McGraw-Hill Higher Eduction, 2003.
  25. Singh, K.N. and van D.L. Oudheusden, "A branch and bound algorithm for the traveling purchaser problem," European Journal of Operations Research, Vol.97(1997), pp.571-579. https://doi.org/10.1016/S0377-2217(96)00313-X
  26. Teeninga, A. and A. Volgenant, "Improved heuristics for the traveling purchaser problem," Computers and Operations Research, Vol.31(2004), pp.139-150. https://doi.org/10.1016/S0305-0548(02)00193-4
  27. Voss, S., "Dynamic tabu search strategies for the traveling purchaser problem," Annals of Operations Research, Vol.63(1996), pp.253-275. https://doi.org/10.1007/BF02125457