ABSTRACT
This paper describes the solution to the problem of predictive and reactive aircraft routing developed in OMAR (Operative Management of Aircraft Routing), a system implemented by Bull HN in collaboration with Alitalia. The basic philosophy is to look at aircraft routing as a Constraint Satisfaction Problem (CSP) and to employ the most effective CSP techniques to solve it under the severe time constraints required by the customer.
- [Da] Davis E., "Constraint Propagation with Interval Labels", Artificial Intelligence, 32, 1987, 281-331. Google ScholarDigital Library
- [De&Pe] Dectcher R. & Pearl J., "Network-Based Heuristics for Constraint Satisfaction Problems", Artificial Intelligence, 34, 1988, 1-38. Google ScholarDigital Library
- [Ei] Eilenberg S., "Automata, Languages and Machines", Academic Press, New York, 1977. Google ScholarDigital Library
- [Et&Ma] Etschmeier M.M. & Mathaisel D.F.X., "Aircraft Scheduling: the State of the Art", XXIV AGIFORS Symposium, Strassbourg, 1984.Google Scholar
- [Ha&El] Haralick R.M. & Elliot G.L., "Increasing Tree Search Efficiency for Constraint Satisfaction Problems", Artificial Intelligence, 14, 1980.Google Scholar
- [Mi] Michie D., "Game Playing Programs and the Conceptual Interface", Sigart Newsletter, April 1982.Google Scholar
- [Na] Nadel B.A., "Tree Search and Arc Consistency in Constraint Satisfaction Problems", in Kanal & Kumar (eds), Search in Artificial Intelligence, Springer-Verlag, 1988. Google ScholarDigital Library
Index Terms
A constraint satisfaction approach to operative management of aircraft routing
Recommendations
Periodic Constraint Satisfaction Problems: Tractable Subclasses
We study a generalization of the constraint satisfaction problem (CSP), the periodic constraint satisfaction problem . An input instance of the periodic CSP is a finite set of "generating" constraints over a structured variable set that implicitly ...
Comments