Airlift Challenge: A Competition for Optimizing Cargo Delivery
This addresses the problem of efficient airlift operations for logistics and planning communities, but it is incremental as it builds on existing competition frameworks and modeling techniques.
The paper describes the Airlift Challenge competition, which tackles the problem of optimizing cargo delivery under disruptions by using a simulator and a temporal PDDL domain for the Pickup and Delivery Problem, with results from its second iteration.
Airlift operations require the timely distribution of various cargo, much of which is time sensitive and valuable. These operations, however, have to contend with sudden disruptions from weather and malfunctions, requiring immediate rescheduling. The Airlift Challenge competition seeks possible solutions via a simulator that provides a simplified abstraction of the airlift problem. The simulator uses an OpenAI gym interface that allows participants to create an algorithm for planning agent actions. The algorithm is scored using a remote evaluator against scenarios of ever-increasing difficulty. The second iteration of the competition was underway from November 2023 to April 2024. This paper describes the competition, simulation environment, and results. As a step towards applying generalized planning techniques to the problem, a temporal PDDL domain is presented for the Pickup and Delivery Problem, a model which lies at the core of the Airlift Challenge.