Thesis Show

Taxiway Aircraft Traffic Scheduling Using the George Bush  

          International Airport Data

Objective: The objective is to assign the routes of taxiing with minimum total taxi time for the safety operations.

Model: The airport ground network is denoted as G(V,E). V is a set of vertex, which represents the gates, runway thresholds, runway exits, taxiway intersections. E is a set of edge, which represents the taxiways and edges connecting the vertexes. Given the origin node and destination node of the departure and arrival aircraft, the problem is to assign optimal routes for taxiing with minimum total taxi time. A Mixed Integer Linear Programming (MILP) model is used.

              

                                                  Figure 1: Taxi Planning Network

Constraints: (1) Minimum Separation Constraints.(2) Time Window Constraints.(3) Speed Limit   

                      Constraints. (4)Constraints to avoid overtaking and head-on-head collision.(5) Runway   

                      Separations constraints.

                  

                                Figure 2: Head-on-head Movement

              

                                      Figure 3: Overtaking Movement