algorithms-aircraft-landing-problems

Using metaheuristics approach to solve the Aircraft Landing Problem: static case.

Feel free to implement or enhance the current solvers, we will very be happy to add it.

Solvers

Multi runways

• ACO Solver
• ACO Parallel Solver (multithreading approach)

Single runways

• GA Solver

Utilities

• ACO GraphViewer
• ACO Report
• Math Utils
• Data Frame Handler
• ALP Parser

Meta-heuristics approaches

Constructive

• Ant Colony Optimization

Populational

• Genetic Algorithm

About built-in Parser

The parser extracts information from Aircraft Landing Problem dataset from OR-Library repository.

References

• BEASLEY, John E.; KRISHNAMOORTHY, Mohan; SHARAIHA, Yazid; ABRAMSON, David. Scheduling aircraft landings—the static case. Transportation science, v. 34, n. 2, p. 180-197, 2000.
• BEASLEY, John E. OR-Library: distributing test problems by electronic mail. Journal of the operational research society, v. 41, n. 11, p. 1069-1072, 1990.
• BEASLEY, John E.; SONANDER, Julia; HAVELOCK, P. Scheduling aircraft landings at London Heathrow using a population heuristic. Journal of the operational Research Society, v. 52, n. 5, p. 483-493, 2001.
• BENCHEIKH, Ghizlane; BOUKACHOUR, Jaouad; ALAOUI, Ahmed EL Hilali. Improved ant colony algorithm to solve the aircraft landing problem. International Journal of Computer Theory and Engineering, v. 3, n. 2, p. 224, 2011.
• BENCHEIKH, Ghizlane; BOUKACHOUR, Jaouad; ALAOUI, Ahmed El Hilali. A memetic algorithm to solve the dynamic multiple runway aircraft landing problem. Journal of King Saud University-Computer and Information Sciences, v. 28, n. 1, p. 98-109, 2016.

About contributors

This project is maintend by Matheus Phelipe and Nilton Silva. If you have any doubt about our code, please email us:

• [email protected]
• [email protected]