Student Work

 

Evaluating the Robustness and Feasibility of Integer Programming and Dynamic Programming in Aircraft Sequencing Optimization Public

Downloadable Content

open 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.

Creator
Publisher
Identifier
  • E-project-101411-145537
Advisor
Year
  • 2011
Center
Date created
  • 2011-10-14
Resource type
Major
Rights statement
License

Relationships

In Collection:

Items

Permanent link to this page: https://digital.wpi.edu/show/qb98mh17t