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

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

A Study on the Composition of Optimal Supply Route for Follow-on Logistics Support which Considers the Degree of Combat Intensity

전투치열도를 고려한 후속 군수지원의 최적 보급로 구성에 관한 연구

  • Received : 2010.06.25
  • Accepted : 2010.09.17
  • Published : 2010.12.05
Download PDF
⟨ Previous Next ⟩

Abstract

Victory and defeat of the war depends on follow-on logistics support. The spending time of follow-on logistics support at combat area is greatly influenced by the degree of combat intensity. The main purpose of this study is to compose a optimal supply route for operational sustainability of combat unit at combat area using transport vehicles. This study suggests a composition of optimal supply route for follow-on logistics support which considers the degree of combat intensity. A mathematical programming model and a genetic algorithm suggest to minimize the total spending time of follow-on logistics support. The suggested mathematical programming model is verified by using CPLEX 11.1. This study computes supply route, total spending time, total travel distance, and the number of transport vehicle.

Keywords

References

  1. 국방부, 국방 군수 용어사전, 2008.
  2. Brandao, J. and Mercer, A., "A Tabu Search Algorithm for the Multi-trip Vehicle Routing and Scheduling Problem", European Journal of Operational Research, Vol. 100, No. 1, pp. 180-191, 1996.
  3. Bullnheimer, B., Hartl, R. F. and Strauss, C., "Applying the Ant System to the Vehicle Routing Problem", 2nd International Conference on Metaheuristics, 1997.
  4. Chiang, W. C. and Russell, R. A., "Simulated Annealing Metaheuristics for the Vehicle Routing Problem with Time Windows", Annals of Operations Research, Vol. 63, No. 1, pp. 3-27, 1996. https://doi.org/10.1007/BF02601637
  5. Christofides, N. and Elion, S., "An Algorithm for the Vehicle Dispatching Problem", Operational Research Quarterly, Vol. 20, No. 3, pp. 309-318, 1969. https://doi.org/10.1057/jors.1969.75
  6. Clark, G. and Wright, J. W., "Scheduling of Vehicles from a Central Depot to a Number of Delivery Points", Operations Research, Vol. 12, No. 4, pp. 568-581, 1964. https://doi.org/10.1287/opre.12.4.568
  7. Cook, W. and Rich, J. L., "A Parallel Cutting-Plane Algorithm for the Vehicle Routing Problem with Time Windows", Technical Report, Computational and Applied Mathematics, Rice University, 1999.
  8. Dantzig, G. B. and Ramser, J. H., "The Truck Dispatching Problem", Management Science, Vol. 6, No. 1, pp. 80-91, 1959. https://doi.org/10.1287/mnsc.6.1.80
  9. Garey, M. and Johnson, D., Computers and Intractability; A Guide to the Theory of NPCompleteness, W. H. Freeman and Company, San Francisco, 1976.
  10. Gendreau, M., Hertz, A. and Laporte, G., "New Insertion and Postoptimization Procedures for the Traveling Salesman Problem", Operations Research, Vol. 40, No. 6, pp. 1086-1094, 1992. https://doi.org/10.1287/opre.40.6.1086
  11. Goldberg, D. and Lingle, R., "Alleles, Loci, and The Traveling Salesman Problem", Proceedings of the First International Conference on Genetic Algorithms and Their Applications, pp. 154-159, 1985.
  12. Holland, J. H., "Adaption in Natural and Artificial Systems", University of Michigan Press, 1975.
  13. Lenstra, J. K. and Rinnooy Kan, A. H. G., "Complexity of Vehicle Routing and Scheduling Problems", Networks, Vol. 11, No. 2, pp. 221-227, 1981. https://doi.org/10.1002/net.3230110211
  14. Magnanti, T. L., "Combinatorial Optimization and Vehicle Fleet Planning: Perspectives and Prospects", Networks, Vol. 11, No. 2, pp. 179-213, 1981. https://doi.org/10.1002/net.3230110209
  15. Potvin, J. Y. and Bengio, S., "A Genetic Approach to the Vehicle Routing Problem with Time Windows", Technical Report CRT-953, Centre de Recherche sur les Transports, University of Montreal, 1994.
  16. Reimann, M., Doerner, K. and Hartl, R. F., "D-ants : Savings Based Ants Divide and Conquer the Vehicle Routing Problem", Computer and Operations Research, Vol. 31, No. 4, pp. 563-591, 2004. https://doi.org/10.1016/S0305-0548(03)00014-5
  17. Solomon M. M., "Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints", Operations Research, Vol. 35, No. 2, pp. 254-265, 1987. https://doi.org/10.1287/opre.35.2.254