Transformational approach to transportation scheduling

Abstract

The authors have used KIDS (Kestrel Interactive Development System) to derive extremely fast and accurate transportation schedulers from formal specifications. As test data, strategic transportation plans which are generated by US government planners are used. In one such problem, the derived scheduler was able to schedule 15,460 individual movement requirements in 71 cpu seconds. The computed schedules use relatively few resources and satisfy all specified constraints. The speed of this scheduler derives from the synthesis of strong problem-specific constraint checking and constraint propagation code.<>