Abstract
This paper suggests a method for routing military ground operations, focused on conducting infiltration based on the shortest-path method. We model the problem in four parts. First, we estimate enemy locations by using public facility location model and military data, and use these to define possible enemy scenarios. Second, for each scenario, a shortest-path problem is solved, where each link’s cost is given by both “Speed” (Travel time) and “Surprise” (Detection probability). And the detection probability is jointly determined by the distance from the enemy’s closest location, detection device’s location and concealment probability from vegetation information. Third, the preferred solution is selected by a robust optimization process. The fourth step involves the use of dissimilar paths to incorporate the impact of a deception operation. The methodology is demonstrated by a case study that uses realistic data from South Korea.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
