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

The Korea Institute of Military Science and Technology (한국군사과학기술학회)
권호 표지

The Multiple Traveling Purchaser Problem for Minimizing Logistics Response Time in Wartime

전시 군수반응시간 최소화를 위한 복수 순회구매자 문제

  • Received : 2010.03.26
  • Accepted : 2010.05.13
  • Published : 2010.05.05
Download PDF
⟨ Previous Next ⟩

Abstract

It's strongly needed to minimize the logistics response time for supporting military operations in wartime. In this paper, we suggest the ILP formulation for minimizing logistics response time in wartime. 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 general TPP, objective function is to minimize the sum of traveling cost and purchase cost. But, in this study, objective function is to minimize traveling cost only. That's why it's more important to minimize traveling cost(time or distance) than purchase cost in wartime. We find out optimal solution of this problem by using ILOG OPL STUDIO(CPLEX v.11.1) and do the sensitive analysis about computing time according to number of operated vehicles.

Keywords

References

  1. 징발법, 법률 제8319호, 2007
  2. Angelelli, E., Mansini, R., Vindigni, M., "Exploring Greedy Criteria for the Dynamic Traveling Purchaser Problem", Central European Journal of Operations Research(Online Published in 2008).
  3. 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
  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. 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
  6. Laporte, G., Riera-Ledesma, J., Salazar-Gonalez, J. J., "A Branch and Cut Algorithm for the Undirected Traveling Purchaser Problem", Operations Research Vol. 51 No. 6, pp. 142-152, 2003.
  7. 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
  8. Margulis, L., Symbiosis in Cell Evolution, Microbial Communities in the Archean and Proterozoic Eon., W.H. Freeman, 1992.
  9. Miller C. E., Tucker, A. W., Zemlin R. A., "Integer Programming Formulation of Traveling Salesman Problems", Journal of Association for Computing Machinery 7, pp. 326-329, 1960. https://doi.org/10.1145/321043.321046
  10. Ramesh, T., "Traveling Purchaser Problem", Journal of the Operational Research Society of India 18, pp. 78-91, 1981.
  11. Riera-Ledesma, J., Salazar-Gonález, J. J., "A Heuristic Approach for the Traveling Purchaser Problem", European Journal of Operational Research 162, pp. 142-152, 2005. https://doi.org/10.1016/j.ejor.2003.10.032