Evaluating the Robustness and Feasibility of Integer Programming and Dynamic Programming in Aircraft Sequencing OptimizationPublic
Downloadable Contentopen in viewer
This project uses Mixed Integer Linear Programming and Dynamic Programming to optimize the takeoff sequence of aircraft at Dallas/Fort Worth (DFW) by minimizing departure delay while also obeying separation requirements and position shifting constraints. We modeled taxi time uncertainties based on real data from DFW and analyzed the robustness of the optimization solution and the feasibility of using these methods in real-life. The runtimes of these methods proved to be feasible in real-time, however the solutions failed to be robust, creating a future need for a stochastic optimization.
- This report represents the work of one or more WPI undergraduate students submitted to the faculty as evidence of completion of a degree requirement. WPI routinely publishes these reports on its website without editorial or peer review.
- Date created
- Resource type
- Rights statement
- In Collection:
Permanent link to this page: https://digital.wpi.edu/show/f4752j33b