An Efficient Approximation Algorithm for Aircraft Arrival Sequencing and Scheduling ProblemReportar como inadecuado




An Efficient Approximation Algorithm for Aircraft Arrival Sequencing and Scheduling Problem - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

Mathematical Problems in Engineering - Volume 2014 2014, Article ID 236756, 8 pages -

Research Article

School of Economics and Management, Tongji University, Shanghai 200092, China

Foshan Shuyuan Science and Technology Company Limited, Foshan, Guangdong 528200, China

Received 23 June 2014; Accepted 20 August 2014; Published 31 December 2014

Academic Editor: Chunlin Chen

Copyright © 2014 Weimin Ma et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Abstract

The aircraft arrival sequencing and scheduling ASS problem is a salient problem in airports- runway scheduling system, which proves to be nondeterministic polynomial NP hard. This paper formulates the ASS in the form of a constrained permutation problem and designs a new approximation algorithm to solve it. Then the numerical study is conducted, which validates that this new algorithm has much better performance than ant colony AC algorithm and CPLEX, especially when the aircraft types are not too many. In the end, some conclusions are summarized.





Autor: Weimin Ma, Bo Xu, Ming Liu, and Hui Huang

Fuente: https://www.hindawi.com/



DESCARGAR PDF




Documentos relacionados