Presenter: Jay Laramore
Commercial service airports implement systems designed to achieve two main objectives: ensure passenger safety and promote on-time flight services for all flights. One of the bottlenecks often impeding on-time flight service is the number of available runways, which if not managed efficiently, can result in unnecessary delays. The aircraft landing problem (alp) is an analytical solution that optimally assigns each inbound airplane to one of the airport's designated runways, while simultaneously sequencing the landing order at each runway, so that all airplanes arrive as close to their designated landing time as possible, if not earlier! This presentation describes the mixed-integer linear programming formulation for the deterministic aircraft landing problem and solves it using the OPTMODEL procedure in SAS Viya. A thorough description of the modeling approach is included, along with the data requirements and results from an example using SAS IML and SAS Optimization, so that anybody with an interest or background in this area can utilize this approach. This presentation concludes by showing how this model can be repurposed to accommodate routing and scheduling problems in other industries.
