Online Optimization For Routing in Dynamic Contested Environments

Abstract

The People's Republic of China (PRC) seeks control over the Republic of China (ROC) and has increased military exercises in the Indo-Pacific, posing threats to ROC's territory. The PRC's ambition escalates political conflict and emphasizes the strategic importance of the region. To address challenges faced by the ROC in navigating risky areas, the ROC aim to establish transportation lines and optimize routes to minimize costs and avoid dangers. Our approach tackles this issue as an online optimization challenge on an established network. It considers the changing environment, costs, and risks associated with paths within the network. Through an iterative process, we aim to find the most optimal route that reduces costs and bypasses contested areas. We will evaluate our algorithm by comparing its results with fixed and dynamic scenarios under various conditions. We can determine its efficacy by assessing its effectiveness in avoiding contested areas and minimizing costs.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Dec 01, 2023
Accession Number
AD1225423

Entities

People

  • Yan-ru Lin

Organizations

  • Naval Postgraduate School

Tags

Readers

  • Applied Combinatorial Optimization and Logic Circuit Design.
  • Maritime Combat Support and Expeditionary Logistics.
  • Strategic Security Studies