Transactions of Nanjing University of Aeronautics & Astronautics
A New Meta-Heuristic Approach for Aircraft Landing Problem
- Article
- Figures
- Metrics
- Preview PDF
- Reference
- Related
- Cited by
- Materials
Abstract:
A new meta-heuristic approach is proposed in this paper based on a new composite dispatching rule to tackle the aircraft landing problem (ALP). First, the ALP is modeled as a machine scheduling problem with the objective of minimizing the total penalty, i.e., total weighted earliness plus total weighted tardiness. Second, a composite dispatching rule, minimized penalty with due dates and set-ups (MPDS), is presented to determine the landing sequence. Then, an efficient heuristic approach is proposed to solve the problem by integrating the MPDS rule and CPLEX solver. In the first stage, the landing sequence is established based on the proposed MPDS rule. In the second stage, landing time is optimized using CPLEX solver. Next, a new meta-heuristic strategy is introduced into the heuristic approach by conducting the local search from the potential landing sequences, which are generated by the proposed MPDS rule. Finally, the performance of the proposed approach is evaluated using a set of benchmark instances taken from the OR library. The results demonstrate the effectiveness and efficiency of the proposed approaches.
Keywords:
Project Supported:
Clc Number:
V355
Mobile website
