Optimal Routing of Infiltration Operations
MetadataShow full item record
In most military operations, maneuvers have to be accompanied by forces and choosing the least-risk route for a mission is one of the most important factors for a successful mission. For example, naval fleets have to choose the safest route for sailing and air forces also need to plan an optimal route that avoid the enemy's radar or ground-to-air missiles' effective range. This research suggests the method for routing military ground operations, focused on conducting infiltration based on the Shortest-Path method. This thesis models the problem in four parts. First, estimate enemy locations by using public facility location model and military data. After that we define possible scenarios by enemy locations. Second, with these scenarios, model this operation as a shortest-path problem. The problem is constructed by each node's costs that consist of two factors: distance and detection probability. Every link between the nodes is given a cost to pass it according to the enemy's location in each scenario and many other factors. Third, compute optimal routes for each scenario then, among those routes, the final solution is selected by a robust optimization process. At last, using dissimilar paths, the effect of deception operation can be defined and analyzed. Eventually, we can find out the optimal route and effect of deception operation. The efficiency of the methodology is tested and demonstrated by a case study, provided in this thesis.