Abstract

In this work we introduce the Air Cargo Schedule Recovery Problem (ACSRP). In this problem, a carrier airline has to reschedule flights and requests to adapt to last-minute demand changes. We consider three different possible crew management policies that translate into three different way to evaluate the costs of deviating from the original schedule. We formulated the ACSRP as a mixed integer linear programming problem, and tested our implementation on 24 original schedules with up to 30 orders and 8 airports, and 4 different disruption scenarios for each one. Our results show that, against a benchmark recovery policy where only cargo is re-routed, recovery can yield savings of roughly 10%.