A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf
.
A modified Variable Neighborhood Search for aircraft Landing Problem
2016
2016 IEEE International Conference on Management of Innovation and Technology (ICMIT)
Aircraft landing problem is a crucial operation in air traffic flow management. Appropriate and efficient landing sequencing, runway assignment and scheduled landing time are of great importance to maintain flight safety and minimize the overall tardiness of all flights. The heuristic approaches mainly focus on providing a fast and feasible solution in a reasonable amount of time. The proposed modified variable neighbor search heuristic shows its robustness in searching the optimal result. The
doi:10.1109/icmit.2016.7605020
fatcat:t5dx36o6rfg3rnzbighdbqv55q