Methods used for scheduling aircraft itineraries to desired maintenance bases and similar methods for specifying delivery routings from any number of sources to any number of required locations have been developed. The algorithms used to generate these routings have been incorporated in a prototype graphics-based scheduling environment. This environment, implemented on the Texas Instruments Explorer Lisp Machine, allows creation of schedule maps on a graphics terminal and display of routings. A fleet reduction algorithm has also been incorporated in the scheduling environment, which attempts to optimize the schedule by shifting flight arcs in the schedule to improve aircraft utilization. The software can be expanded to include other algorithms.
Routings in a schedule space map : an interactive graphics-based implementation
1987
162 p
Cover title
Also issued as an M.S. thesis, Massachusetts Institute of Technology, Dept. of Aeronautics and Astronautics, 1987
August 1987
Includes bibliographical references (p. 93)
Report
Elektronische Ressource
Unbekannt
One-way routings in smaller cities
Engineering Index Backfile | 1950
|Conflict-Free Direct Routings in European Airspace
NTIS | 1997
|