Shared Refueling Airspace Location and Mobile Tanker Scheduling for Integrated Multi-Mission Air Operations

Abstract

In multi-mission air operations, area-patrol missions and long-range missions typically share a limited tanker fleet while imposing different constraint structures: patrol refueling is bounded by hard time windows, whereas long-range missions are governed by restricted-zone avoidance, detour tolerances, and multi-segment fuel verification. Conventional scenario-wise independent planning splits resources and wastes cross-region ferry mileage. This paper adapts the established paradigms of the location–routing problem (LRP) and the vehicle routing problem with time windows (VRPTW) to this joint refueling scenario: a joint planning model prioritizes the number of tanker sorties over total system flight distance, and a decoder-coupled adaptive large neighborhood search (ALNS) integrates airspace selection, task assignment, tanker routing, and dual-timeline rendezvous decoding, with all mission hard constraints embedded in a deterministic, reproducible evaluator that adjudicates feasibility at every search iteration. Experiments at three scales (17, 42, and 100 tasks) show 100% mission coverage and 100% patrol time-window satisfaction: relative to scenario-wise independent planning, tanker sorties decrease by 16.2–19.7% and tanker flight distance by 14.6–15.5% (significant after Bonferroni correction on 90 paired replicates per scale); against genetic algorithm (GA) and ant colony optimization (ACO) baselines—and against a route-encoding GA under an equal solution-space representation—the method is superior in solution quality and runtime (p<0.001), and the separation persists when the baselines receive a 25-fold evaluation budget. Monte Carlo simulations characterize how plan feasibility degrades under execution-time disturbances. Within the studied instance families, the framework yields executable joint refueling plans within operational runtimes.