Abstract
Efficient and feasible flight deck operation scheduling plan is of great significance for improving the sortie rate of carrier aircraft. Oxygen filling, fueling, and other operations of each carrier aircraft are executed in the pre-flight preparation stage. Different personnel, support equipments, and supply resources, are required while different operations are being executed. To date, most approaches proposed in the literature are based on the unrealistic assumption that the transfer process of carrier aircraft can be ignored. To close this gap, the resource-constrained multi-aircraft scheduling problem on the flight deck is examined in this study. The main contributions of the study are as follows. First, by considering the transfer process of aircraft on the flight deck operations, the model formulation of resource-constrained multi-aircraft scheduling problem is established. Second, the parallel and serial scheduling framework are proposed, where parking spot priority rules and resource allocation rules are presented to select the most suitable resources. Third, a modified genetic programming algorithm is presented for obtaining efficient activity priority rules. Fourth, the well-performed scheduling framework, priority rules, and allocation rules are selected by conducting computational experiments. Furthermore, experiment results show that the parallel scheduling framework outperforms the serial framework in most experiments (average outperformance is 10.19%), and the parking spot priority rules slightly affect the serial scheduling framework.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.