Air cargo transportation, loading, and phase-based maintenance service scheduling in demand channel routes

Abstract

The article proposes an approach for modeling and solving the air cargo transportation, loading, and phase-based maintenance scheduling problems within demand channels. Demand channel transportation presents unique challenges to meeting the earliest pickup and delivery requirements during emergencies. The complexities in transportation involve issues with airport-aircraft compatibility, fleet selection, task assignments, route construction, and effective loading–unloading procedures. The challenges include coping with flight connections due to airport-aircraft compatibility, dealing with limited refueling and maintenance facilities, and swiftly adapting to unforeseen maintenance events by identifying and utilizing available fleets. In this context, the article delineates a demand channel route planning strategy that considers airport-aircraft compatibility, task integrity, priority, partial refueling strategy, and maintenance schedules spanning short to long-haul phases. Formulated as a Mixed Integer Linear Programming (MILP) problem, the solution employs a novel acyclic route construction procedure within a fuel-conscious network. We propose an insertion heuristic with multi-faceted algorithmic interconnections for producing a near-optimal solution suitable for real-world applications. Our insertion procedure has been shown to have very high computational performance, with an average 1.32 percent optimality gap. It can be scaled up to the most critical cargo mission, with up to 190 ports, 95 aircraft, and 380 tasks.