A General Meta-Heuristic Based Solver for Combinatorial Optimisation Problems
Computational Optimization and Applications
Combining Relational Algebra, SQL, and Constraint Programming
FroCoS '02 Proceedings of the 4th International Workshop on Frontiers of Combining Systems
As Cheap as Possible: Efficient Cost-Optimal Reachability for Priced Timed Automata
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
The Aircraft Sequencing Problem
Computer Science in Perspective
Routing Of Airplanes To Two Runways: Monotonicity Of Optimal Controls
Probability in the Engineering and Informational Sciences
Optimal scheduling using priced timed automata
ACM SIGMETRICS Performance Evaluation Review
Scheduling models for air traffic control in terminal areas
Journal of Scheduling
On using priced timed automata to achieve optimal scheduling
Formal Methods in System Design
Combining relational algebra, SQL, constraint modelling, and local search
Theory and Practice of Logic Programming
Hybrid Metaheuristics to Aid Runway Scheduling at London Heathrow Airport
Transportation Science
Scatter search and bionomic algorithms for the aircraft landing problem
AMCOS'05 Proceedings of the 4th WSEAS International Conference on Applied Mathematics and Computer Science
A real-time schedule method for aircraft landing scheduling problem based on cellular automaton
Proceedings of the first ACM/SIGEVO Summit on Genetic and Evolutionary Computation
Modelling mixed discrete-continuous domains for planning
Journal of Artificial Intelligence Research
Complexity in simplicity: flexible agent-based state space exploration
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
IEEE Transactions on Intelligent Transportation Systems
A novel SAT-based approach to the task graph cost-optimal scheduling problem
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Algorithms for Scheduling Runway Operations Under Constrained Position Shifting
Operations Research
Scheduling aircraft landings to balance workload of ground staff
Computers and Industrial Engineering
Limiting pollution in ground control optimization
ICT-GLOW'11 Proceedings of the First international conference on Information and communication on technology for the fight against global warming
A comparison of two methods for reducing take-off delay at London Heathrow airport
Journal of Scheduling
A decision support system based on metaheuristic model for aircrafts landing problems
OTM'11 Proceedings of the 2011th Confederated international conference on On the move to meaningful internet systems
Priced timed automata: algorithms and applications
FMCO'04 Proceedings of the Third international conference on Formal Methods for Components and Objects
Solving the aircraft sequencing problem using concurrent constraint programming
MOZ'04 Proceedings of the Second international conference on Multiparadigm Programming in Mozart/Oz
Aircraft sequencing problems via a rolling horizon algorithm
ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
An efficient hybrid meta-heuristic for aircraft landing problem
Computers and Operations Research
Aircraft landing problems with aircraft classes
Journal of Scheduling
Hi-index | 0.00 |
In this paper, we consider the problem of scheduling aircraft (plane) landings at an airport. This problem is one of deciding a landing time for each plane such that each plane lands within a predetermined time window and that separation criteria between the landing of a plane and the landing of all successive planes are respected. We present a mixed-integer zero--one formulation of the problem for the single runway case and extend it to the multiple runway case. We strengthen the linear programming relaxations of these formulations by introducing additional constraints. Throughout, we discuss how our formulations can be used to model a number of issues (choice of objective function, precedence restrictions, restricting the number of landings in a given time period, runway workload balancing) commonly encountered in practice. The problem is solved optimally using linear programming-based tree search. We also present an effective heuristic algorithm for the problem. Computational results for both the heuristic and the optimal algorithm are presented for a number of test problems involving up to 50 planes and four runways.