A vehicle scheduler for on-demand bus systems based on a heuristic cost estimation

S. Fujita, A. Nakatani
{"title":"A vehicle scheduler for on-demand bus systems based on a heuristic cost estimation","authors":"S. Fujita, A. Nakatani","doi":"10.1109/ITSC.2003.1252674","DOIUrl":null,"url":null,"abstract":"This paper proposes a scheduling scheme for solving the minimum cost single vehicle routing problem with designated deadlines, based on the dynamic programming and heuristic cost estimation. We conducted several experiments to evaluate the efficiency of the proposed scheme, and found that in more than 76% of randomly generated instances, it outputs an optimal solution within few seconds provided that the number of passengers assigned to the vehicle is at most 10. In addition, even for larger instances, it can output a better quasi-optimal solution much more quickly compared with conventional schemes.","PeriodicalId":123155,"journal":{"name":"Proceedings of the 2003 IEEE International Conference on Intelligent Transportation Systems","volume":"47 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2003 IEEE International Conference on Intelligent Transportation Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITSC.2003.1252674","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

This paper proposes a scheduling scheme for solving the minimum cost single vehicle routing problem with designated deadlines, based on the dynamic programming and heuristic cost estimation. We conducted several experiments to evaluate the efficiency of the proposed scheme, and found that in more than 76% of randomly generated instances, it outputs an optimal solution within few seconds provided that the number of passengers assigned to the vehicle is at most 10. In addition, even for larger instances, it can output a better quasi-optimal solution much more quickly compared with conventional schemes.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于启发式成本估计的按需公交系统车辆调度
本文提出了一种基于动态规划和启发式成本估计的最小化单车路径调度方案。我们进行了几个实验来评估所提出方案的效率,并发现在超过76%的随机生成实例中,只要分配给车辆的乘客人数不超过10人,它就会在几秒钟内输出最优解决方案。此外,即使对于较大的实例,与传统方案相比,它也可以更快地输出更好的准最优解。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Study on ship manoeuvering control based on adaptive inverse control technology Formal design and analysis of FMS controller The application of spatial data mining in railway geographic information systems Dynamic vehicle routing problem using hybrid ant system Dynamic link travel time model in dynamic traffic assignment
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1