The K King Problem, an Abstract Model for Computing Aircraft Landing Trajectories: On Modeling a Dynamic Hybrid System with Constraints

The K King Problem, an Abstract Model for Computing Aircraft Landing Trajectories: On Modeling a Dynamic Hybrid System with Constraints

0.00 Avg rating0 Votes
Article ID: iaor200952610
Country: United States
Volume: 20
Issue: 2
Start Page Number: 222
End Page Number: 233
Publication Date: Mar 2008
Journal: INFORMS Journal On Computing
Authors: , ,
Keywords: puzzles
Abstract:

Motivated by the problem of computing trajectories of a set of aircraft in their final descent, we introduce the K king problem, a dramatic simplification of the initial problem in which time and space are discretized. A constraint–based model relying on several specific global constraints is introduced. Computational experiments are reported and show that small instances of this problem can be solved in reasonable time.

Reviews

Required fields are marked *. Your email address will not be published.