{"title":"运输调度的转型方法","authors":"Douglas R. Smith, E. Parra","doi":"10.1109/KBSE.1993.341197","DOIUrl":null,"url":null,"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.<<ETX>>","PeriodicalId":371606,"journal":{"name":"Proceedings of 8th Knowledge-Based Software Engineering Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1993-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"60","resultStr":"{\"title\":\"Transformational approach to transportation scheduling\",\"authors\":\"Douglas R. Smith, E. Parra\",\"doi\":\"10.1109/KBSE.1993.341197\",\"DOIUrl\":null,\"url\":null,\"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.<<ETX>>\",\"PeriodicalId\":371606,\"journal\":{\"name\":\"Proceedings of 8th Knowledge-Based Software Engineering Conference\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1993-09-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"60\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of 8th Knowledge-Based Software Engineering Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/KBSE.1993.341197\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of 8th Knowledge-Based Software Engineering Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/KBSE.1993.341197","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 60
摘要
作者使用KIDS (Kestrel Interactive Development System)从正式的规范中推导出极其快速和准确的运输调度程序。作为测试数据，我们使用了美国政府规划者制定的战略交通计划。在一个这样的问题中，派生的调度器能够在71 cpu秒内调度15,460个单独的移动需求。计算的调度使用相对较少的资源并满足所有指定的约束。该调度器的速度来自于强问题特定约束检查和约束传播代码的综合。
Transformational approach to transportation scheduling
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.<>
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
