산업공학 (IE interfaces)

  • 제24권1호
  • /
  • Pages.51-57
  • /
  • 2011
  • /
  • 1225-0996(pISSN)
  • /
  • 2234-6465(eISSN)
대한산업공학회 (Korean Institute of Industrial Engineers)
권호 표지
DOI QR코드

DOI QR Code

용량제약이 있는 복수 순회구매자 문제의 휴리스틱 해법

Heuristic Approach for the Capacitated Multiple Traveling Purchaser Problem

  • 최명진 (국방대학교 운영분석학과) ;
  • 이상헌 (국방대학교 운영분석학과)
  • Choi, Myung-Jin (Department of Operations Research, Korea National Defense University) ;
  • Lee, Sang-Heon (Department of Operations Research, Korea National Defense University)
  • 투고 : 2010.05.24
  • 심사 : 2010.09.17
  • 발행 : 2011.03.01
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

The traveling purchaser problem (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 the last decade, TPP has received some attention of the researchers in the operational research area. However, all of the past researches for TPP are restricted on a single purchaser (vehicle). It could be the limitation to solve the real world problem. The purpose of this paper is to suggest the capacitated multiple TPP (CMTPP). It could be used in inbound logistics optimization in supply chain management area and many others. Since TPP is known as NP-hard, we also developed the heuristic algorithm to solve the CMTPP.

키워드

참고문헌

  1. Angelelli, E., Mansini, R., and Vindigni, M. (2008), Exploring greedy criteria for the dynamic traveling purchaser problem, Central European Journal of Operations Research, 17(2), 141-158.
  2. Boctor, F. F., Laporte, G., and Renaud, J. (2003), Heuristics for the traveling purchaser problem, Computers and Operations Research, 30, 491-504. https://doi.org/10.1016/S0305-0548(02)00020-5
  3. Bontoux, B. and Feillet, D. (2008), Ant colony optimization for the traveling purchaser problem, Computers and Operations Research, 35, 628-637. https://doi.org/10.1016/j.cor.2006.03.023
  4. Burstall, R. M. (1966), A heuristic method for a job sequencing problem, Operational Research Quarterly, 17, 291-304. https://doi.org/10.1057/jors.1966.56
  5. Buzacott, J. A. and Dutta, S. K. (1971), Sequencing many jobs on a multipurpose facility, Naval Research Logistics Quarterly, 18, 75-82. https://doi.org/10.1002/nav.3800180106
  6. Choi, M. J. (2010), The Multiple Traveling Purchaser Problem for Minimizing Logistics Response Time in Wartime, Journal of the Korean Institute of Military Science and Technology, 13(3), 431-437.
  7. Choi, M. J. and Lee, S. H. (2009), Periodic Heterogeneous Multiple Traveling Purchaser Problem for Refuse Logistics Optimization, Journal of the Korean Society of Supply Chain Management, 9(2), 147-154.
  8. Choi, M. J. and Lee, S. H. (2010a), A Literature Review of the Traveling Purchaser Problem for Inbound Logistics Optimization, Journal of the Korean Society of Supply Chain Management, 10(2), 1-12.
  9. Choi, M. J. and Lee, S. H. (2010b), Heterogenious Multiple Traveling Purchaser Problem with Budget Constraint, Journal of the Korean Operations Research and Management Science Society, 35(1), 111-124.
  10. Choi, M. J. and Lee, S. H. (2010c), Uncapacitated Multiple Traveling Purchaser Problem, Journal of the Korean Institute of Industrial Engineers, 36(2), 78-86.
  11. Current, J., Revelle, C., and Cohon, J. (1984), The shortest covering path problem : an application of locational constraints to network design, Journal of Regional Science, 24, 161-183. https://doi.org/10.1111/j.1467-9787.1984.tb01030.x
  12. Goldbarg, M. C., Bagi, L. B., Goldbarg, E. F. G. (2008), Transgenetic algorithm for the traveling purchaser problem, European Journal of Operational Research, 199, 36-45.
  13. Golden, B. L., Levy, L., and Dahl, R. (1981), Two generations of the traveling salesman problem, Omega, 9, 439-445. https://doi.org/10.1016/0305-0483(81)90087-6
  14. Jain, R., Rivera, M. C., Moore, J.E., and Lake, J. A. (2003), Horizontal gene transfer accelerates genome innovation and evolution, Molecular Biology and Evolution, 20, 1598-1602. https://doi.org/10.1093/molbev/msg154
  15. Laporte, G., Riera-Ledesma, J., and Salazar-Gonalez, J. J. (2003), A branch and cut algorithm for the undirected traveling purchaser problem, Operations Research, 51(6), 142-152.
  16. Lin, S. (1965), Computer solutions of the traveling salesman problem, Bell System Tech. J., 44, 2245-2269. https://doi.org/10.1002/j.1538-7305.1965.tb04146.x
  17. Lomnicki, Z. A. (1996), Job scheduling, Operational Research Quaterly, 17, 314-316.
  18. Mansini, R. and Tocchella, B. (2009), The traveling purchaser problem with budget constraint, Computers and Operations Research, 36, 2263-2274. https://doi.org/10.1016/j.cor.2008.09.001
  19. Margulis, L. (1992), Symbiosis in cell evolution, Microbial communities in the archean and proterozoic eon., W. H. Freeman.
  20. Ong, H. L. (1982), Approximate algorithm for the traveling purchaser problem, Operations Research Letters, 1, 201-205. https://doi.org/10.1016/0167-6377(82)90041-4
  21. Pearn, W. L. and Chien, R. C. (1998), Improved solutions for the traveling purchaser problem, Computers and Operations Research, 25, 879-885. https://doi.org/10.1016/S0305-0548(98)00032-X
  22. Ramesh, T. (1981), traveling purchaser problem. Journal of the Operational Research Society of India, 18, 78-91.
  23. Ravi, R. and Salman, S. (1999), Approximation algorithms for the traveling purchaser problem and its variants in network design, Lecture notes in computer science, 1643, 29-40.
  24. Riera-Ledesma, J. and Salazar-Gonalez, J. J. (2005a), A heuristic approach for the traveling purchaser problem, European Journal of Operational Research, 162, 142-152. https://doi.org/10.1016/j.ejor.2003.10.032
  25. Riera-Ledesma, J. and Salazar-Gonalez, J. J. (2005b), The biobjective traveling purchaser problem, European Journal of Operational Research, 160, 599-613. https://doi.org/10.1016/j.ejor.2003.10.003
  26. Riera-Ledesma, J. and Salazar-Gonalez, J. J. (2006), Solving the asymmetric traveling purchaser problem, Annals of Operations Research, 144, 83-97. https://doi.org/10.1007/s10479-006-0014-y
  27. Singh, K. N. and van Oudheusden, D. L. (1997), A branch and bound algorithm for the traveling purchaser problem, European Journal of Operational Research, 97, 571-579. https://doi.org/10.1016/S0377-2217(96)00313-X
  28. Teeninga, A. and Volgenant, A. (2004), Improved heuristics for the traveling purchaser problem, Computers and Operations Research, 31, 139-150. https://doi.org/10.1016/S0305-0548(02)00193-4
  29. VoB, S. (1996), Dynamic tabu search strategies for the traveling purchaser problem, Annals of Operations Research, 63, 253-275. https://doi.org/10.1007/BF02125457