Sequencing approach of arrival aircrafts based on composite dispatching rules

To alleviate the flight delay problem, a sequencing approach of arrival aircrafts was proposed based on composite dispatching rules. Based on the machine scheduling theory, the sequencing problem of arrival aircrafts with the target of minimizing weighted total delay was transformed into the machine scheduling problem with the target of minimizing weighted total tardiness. The order-depended time constraint, submitted time constraint and deadline constraint were considered, and the sequencing model of arrival aircrafts was constructed. Through introducing the weighted shortest processing time factor, slack term factor, setup time factor, release time factor and deadline factor, the composite dispatching rule for the sequencing was presented, and a heuristic algorithm for the sequencing was developed. Based on real case, the weighted total delays, total delays and maximum delays of arrival aircrafts computed by using the proposed sequencing approach, first-come-first-service rule and Lingo software were compared. Computation result shows that in the numerical simulation with 30 arrival aircrafts, when the proposed method was compared with the first-come-first-service rule, the weighted total delay reduces by 31 min, and the number of delayed aircrafts decreases by 6. In the northbound operations of Shanghai Pudong Airport, when the proposed method was compared with Lingosoftware, the optimized landing times are same, but 2.4 min per aircraft is saved compared with the actual landing time.