SCENARIO-ROBUST ROUTE PLANNING WITH NETWORK RECONSTITUTION
Authors
Yee, Zong Yew
Subjects
scenario-robust optimization
route planning
recourse
mixed integer program
reconstitution
scenario-robust route planning and network reconstitution model
SRRPNRM
route planning
recourse
mixed integer program
reconstitution
scenario-robust route planning and network reconstitution model
SRRPNRM
Advisors
Craparo, Emily M.
Date of Issue
2024-09
Date
Publisher
Monterey, CA; Naval Postgraduate School
Language
Abstract
Military route planning through a road network that is defended with obstacles is a complex and time intensive process which requires planners to consider a multitude of factors, including time and asset allocation. As operations continue to increase in both tempo and dynamicity, it is becoming increasingly difficult for planners to keep up with intuition and manual calculations. With the fog of war resulting in imperfect information, planners often have to postulate the various scenarios that the enemy can adopt to deploy tactical obstacles. This poses an additional dilemma, as the optimal solution to one scenario may be suboptimal for another. We formulate a scenario-robust route planning and network reconstitution model (SRRPNRM) that allows for node improvements. These node improvements represent the actions of engineering assets that are used to clear tactical obstacles in the road network. We then apply SRRPNRM to a network with two hypothetical scenarios to identify the value of the model by comparing the result of SRRPNRM with the expected value solution. The results show that the SRRPNRM can help planners make informed decisions on the optimal routes and initial asset allocation plan across multiple potential scenarios.
Type
Thesis
Description
Series/Report No
Department
Organization
Identifiers
NPS Report Number
Sponsors
Funder
Format
Citation
Distribution Statement
Distribution Statement A. Approved for public release: Distribution is unlimited.
Rights
�Copyright�is reserved by the copyright owner.