Abstract
The optimized landing sequence of fight is one of the good methods to decrease delay and improve service. Especially, the objectives are usually conflicting and contradictive when the air traffic controller (ATC) makes the decision. The landing sequence at the busy airports can be regarded as one machine scheduling problem with multi-objectives in the paper, and the pareto optimization is discussed emphatically. The mathematic model is formulated which makes the tradeoff between the number of weighted delayed flights and the maximum time of the delayed flight, and then flexibly choose solutions. The multi-objective ant colony algorithm which shares the pheromone between multi-objectives is utilized to solve the problem. Results show that the proposed algorithm performs well when compared with the traditional heuristic methods and can help ATC choosing different landing sequences according to the real conditions.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Journal of Transportation Systems Engineering and Information Technology
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.
