한국군사과학기술학회지 (Journal of the Korea Institute of Military Science and Technology)

  • 제14권3호
  • /
  • Pages.458-466
  • /
  • 2011
  • /
  • 1598-9127(pISSN)
  • /
  • 2636-0640(eISSN)
한국군사과학기술학회 (The Korea Institute of Military Science and Technology)
권호 표지
DOI QR코드

DOI QR Code

전시 최장 획득완료시간 최소화를 위한 복수 순회구매자 문제

The Multiple Traveling Purchaser Problem for Minimizing the Maximal Acquisition Completion Time in Wartime

  • 투고 : 2011.01.27
  • 심사 : 2011.04.15
  • 발행 : 2011.06.05
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

In war time, minimizing the logistics response time for supporting military operations is strongly needed. In this paper, i propose the mathematical formulation for minimizing the maximal acquisition completion time in wartime or during a state of emergency. The main structure of this formulation is based on the traveling purchaser problem (TPP), which is a generalized form of the well-known traveling salesman problem (TSP). In the case of the general TPP, an objective function is to minimize the sum of the traveling cost and the purchase cost. However, in this study, the objective function is to minimize the traveling cost only. That's why it's more important to minimize the traveling cost (time or distance) than the purchase cost in wartime or in a state of emergency. I generate a specific instance and find out the optimal solution of this instance by using ILOG OPL STUDIO (CPLEX version 11.1).

키워드

참고문헌

  1. Angelelli, E., Mansini, R., Vindigni, M., Exploring Greedy Criteria for the Dynamic Traveling Purchaser Problem, Central European Journal of Operations Research(Online Published), 2008.
  2. Boctor, F. F., Laporte, G., Renaud, J., Heuristics for the Traveling Purchaser Problem, Computers and Operations Research 30, pp. 491-504, 2003. https://doi.org/10.1016/S0305-0548(02)00020-5
  3. Bontoux, B., Feillet, D., Ant Colony Optimization for the Traveling Purchaser Problem, Computers and Operations Research 35, pp. 628-637, 2008. https://doi.org/10.1016/j.cor.2006.03.023
  4. Goldbarg, M. C., Bagi, L. B., Goldbarg, E. F. G., Transgenetic Algorithm for the Traveling Purchaser Problem, European Journal of Operational Research 199, pp. 36-45, 2008.
  5. Golden, B. L., Levy, L., Dahl, R., Two Generations of the Traveling Salesman Problem, Omega 9, pp. 439-445, 1981. https://doi.org/10.1016/0305-0483(81)90087-6
  6. Jain, R., Rivera, M. C., Moore, J. E., Lake, J. A., Horizontal Gene Transfer Accelerates Genome Innovation and Evolution, Molecular Biology and Evolution 20, pp. 1598-1602, 2003. https://doi.org/10.1093/molbev/msg154
  7. Laporte, G., Riera-Ledesma, J., Salazar-Gonalez, J. J., A Branch and Cut Algorithm for the Undirected Traveling Purchaser Problem, Operations Research 51(6), pp. 142-152, 2003.
  8. Mansini, R., Tocchella, B., The Traveling Purchaser Problem with Budget Constraint, Computers and Operations Research 36, pp. 2263-2274, 2009. https://doi.org/10.1016/j.cor.2008.09.001
  9. Margulis, L., Symbiosis in Cell Evolution, Microbial Communities in the Archean and Proterozoic Eon., W. H. Freeman, 1992.
  10. Miller C. E., Tucker, A. W., Zemlin R. A., Integer Programming Formulation of Traveling Salesman Problems, Journal of Association for Computing Machinery 7, pp. 32-329, 1960.
  11. Ong, H. L., Approximate Algorithm for the Traveling Purchaser Problem, Operations Research Letters 1, pp. 201-205, 1982. https://doi.org/10.1016/0167-6377(82)90041-4
  12. Pearn, W. L., Chien, R. C., Improved Solutions for the Traveling Purchaser Problem, Computers and Operations Research 25, pp. 879-885, 1998. https://doi.org/10.1016/S0305-0548(98)00032-X
  13. Ramesh, T., Traveling Purchaser Problem, OPSEARCH 18, pp. 78-91, 1981.
  14. Riera-Ledesma, J., Salazar-Gonalez, J. J., A Heuristic Approach for the Traveling Purchaser Problem, European Journal of Operational Research 162, pp.142-152, 2005a. https://doi.org/10.1016/j.ejor.2003.10.032
  15. Riera-Ledesma, J., Salazar-Gonalez, J. J., The Biobjective Traveling Purchaser Problem, European Journal of Operational Research 160, pp. 599-613, 2005b. https://doi.org/10.1016/j.ejor.2003.10.003
  16. Riera-Ledesma, J., Salazar-Gonalez, J. J., Solving the Asymmetric Traveling Purchaser Problem, Annals of Operations Research 144, 83-97, 2006. https://doi.org/10.1007/s10479-006-0014-y
  17. Singh, K. N., van Oudheusden, D. L., A Branch and Bound Algorithm for the Traveling Purchaser Problem, European Journal of Operational Research 97, pp. 571-579, 1997. https://doi.org/10.1016/S0377-2217(96)00313-X
  18. Teeninga, A., Volgenant, A., Improved Heuristics for the Traveling Purchaser Problem, Computers and Operations Research 31, pp. 139-150, 2004. https://doi.org/10.1016/S0305-0548(02)00193-4
  19. Voss, S., Dynamic Tabu Search Strategies for the Traveling Purchaser Problem, Annals of Operations Research 63, pp. 253-275, 1996. https://doi.org/10.1007/BF02125457