선행제약을 고려한 권역단위 공병장애물 설치경로 최적화 모형
Optimization Routing Model for Installation of Clustered Engineering Obstacles with Precedence Constraint
0
조회
0
다운로드
0
인용
0
참고문헌
키워드
초록
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.
Abstract
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.
참고문헌 (8)
- Cho, Y. H., "Optimization Model for Determining an Observation Order of Scientific Surveillance Equipment", Journal of The Korean Operations Research and Management Science Society, 48(3), pp.15~28 (2023)
- Jang, Y. C., "Optimum Allocation Model of Military Engineer Equipments for Artillery Position Development", Journal of The Korean Operations Research and Management Science Society, 48(3), pp.15~28 (2023)
- Kim, S. C., "Study on Countermaneuver Support Mission Scheduling Considering Cooperation", Journal of the Korean Institute of Industrial Engineers, 44(2), pp.114~123 (2018)
- Lu, L.Y., "Solving the Clustered Traveling Salesman Problem via TSP methods", Peer J Computer Science, pp.1~26 (2022)
- Miller, C. E., "Integer programming formulations and traveling salesman problems", Journal of Association for Computing Machinery, 7, pp.326~329 (1960)
- Ministrty of National Defense, "Defebse White Paper", pp.26~33 (2022)
- Moon, C. U., "Traveling Salesman Problem with Precedence Relations based on Genetic Algorithm", Korean Institute of Industrial Engineers, pring Academic Conference, pp.48~51 (2000), Gyeongman University
- Yang, S. H, "A Vehicle Routing Planning for Efficient Engineering Obstacles Transporting by using HVRP", Master, pp.2012