산업경영시스템학회지 (Journal of Korean Society of Industrial and Systems Engineering)

  • 제47권2호
  • /
  • Pages.65-73
  • /
  • 2024
  • /
  • 2005-0461(pISSN)
  • /
  • 2287-7975(eISSN)
한국산업경영시스템학회 (Society of Korea Industrial and System Engineering)
권호 표지
DOI QR코드

DOI QR Code

선행제약을 고려한 권역단위 공병장애물 설치경로 최적화 모형

Optimization Routing Model for Installation of Clustered Engineering Obstacles with Precedence Constraint

  • 유동근 (육군3사관학교 경제경영학과) ;
  • 김수환 (국방대학교 국방과학학부)
  • Dongkeun Yoo (Department of Business and Economics, Korea Army Academy at Yeongcheon) ;
  • Suhwan Kim (Department of National Defense Science, Korea National Defense University )
  • 투고 : 2024.05.03
  • 심사 : 2024.06.04
  • 발행 : 2024.06.30
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

This paper presents a path planning optimization model for the engineering units to install obstacles in the shortest time during wartime. In a rapidly changing battlefield environment, engineering units operate various engineering obstacles to fix, bypass, and delay enemy maneuvers, and the success of the operation lies in efficiently planning the obstacle installation path in the shortest time. Existing studies have not reflected the existence of obstacle material storage that should be visited precedence before installing obstacles, and there is a problem that does not fit the reality of the operation in which the installation is continuously carried out on a regional basis. By presenting a Mixed Integrer Programming optimization model reflecting various constraints suitable for the battlefield environment, this study attempted to promote the efficient mission performance of the engineering unit during wartime.

키워드

참고문헌

  1. Cho, Y.H. and Cho, N., Optimization Model for Determining an Observation Order of Scientific Surveillance Equipment, Journal of The Korean Operations Research and Management Science Society, 2023, Vol. 48, No. 3, pp. 15-28.
  2. Jang, Y.C. and Lee, M.G., Optimum Allocation Model of Military Engineer Equipments for Artillery Position Development, Journal of The Korean Operations Research and Management Science Society, 2023, Vol. 48, No. 3, pp. 15-28.
  3. Kim, S. C. and Lee, T.S., Study on Countermaneuver Support Mission Scheduling Considering Cooperation, Journal of the Korean Institute of Industrial Engineers, 2018, Vol. 44, No. 2, pp. 114-123.
  4. Lu, L.Y., Hao, J.K., and Wu, Q., Solving the Clustered Traveling Salesman Problem via TSP methods, Peer J Computer Science, 2022, pp. 1-26, https://arxiv.org/abs/2007.05254.
  5. Miller, C.E., Tucker, A.W., and Zemlin, R.A., Integer programming formulations and traveling salesman problems, Journal of Association for Computing Machinery, 1960, Vol. 7, pp. 326-329.
  6. Ministrty of National Defense, Defebse White Paper, Republic of Korea, pp. 26-33, 2022.
  7. Moon, C.U., Kim, G.U., Kim, J.S., and Heo, S., Traveling Salesman Problem with Precedence Relations based on Genetic Algorithm, Korean Institute of Industrial Engineers, pring Academic Conference, Gyeongman University, Republic of Korea, Apr., 2000, pp. 48-51.
  8. Yang, S.H., A Vehicle Routing Planning for Efficient Engineering Obstacles Transporting by using HVRP, Master's degree, Korea National Defense University, pp.1-71 1-Dec. 2012.