The Review of Recent Trend for School Bus Routing Problem

Nur Intan Liyana Mohd Azmi, Afwan Hakim Md Mahdzir, Yu Xuan Heng, Xian Yu Ng, Mei Tiean Tan, Yu Kun Tian
{"title":"The Review of Recent Trend for School Bus Routing Problem","authors":"Nur Intan Liyana Mohd Azmi, Afwan Hakim Md Mahdzir, Yu Xuan Heng, Xian Yu Ng, Mei Tiean Tan, Yu Kun Tian","doi":"10.33093/jetap.2024.6.1.9","DOIUrl":null,"url":null,"abstract":"The School Bus Routing Problem (SBRP) is a complex transportation challenge involving finding optimal bus routes. This review paper provides an overview of the recent developments in SBRP research and focuses on three sub-problems: Bus Route Generation, Bus Route Scheduling, and Bus Stop Selection. The paper examines recent publications from 57 relevant articles. It highlights the increasing focus on real-world and complex scenarios, as well as the growing popularity of metaheuristic approaches in addressing SBRP challenges. The analysis reveals the significance of bus route generation, bus route scheduling, and bus stop selection, showcasing the effectiveness of machine learning and heuristic or metaheuristic algorithms in improving route quality. This study also classifies SBRP problems based on the number of schools, service surroundings (urban or rural), mixed-load scenarios, and fleet mix (homogeneous or heterogeneous). Finally, the paper explores the objectives of SBRP research, including minimising the total cost, distance, time, and number of buses. Meanwhile, the constraints of this study are the capacity of a bus, the maximum riding time, time windows, the maximum walking time between two stops and so on. This comprehensive review paper aims to offer a framework for new researchers and provides valuable insights for future research directions in this transportation area.","PeriodicalId":441201,"journal":{"name":"Journal of Engineering Technology and Applied Physics","volume":"1 6","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Engineering Technology and Applied Physics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.33093/jetap.2024.6.1.9","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

The School Bus Routing Problem (SBRP) is a complex transportation challenge involving finding optimal bus routes. This review paper provides an overview of the recent developments in SBRP research and focuses on three sub-problems: Bus Route Generation, Bus Route Scheduling, and Bus Stop Selection. The paper examines recent publications from 57 relevant articles. It highlights the increasing focus on real-world and complex scenarios, as well as the growing popularity of metaheuristic approaches in addressing SBRP challenges. The analysis reveals the significance of bus route generation, bus route scheduling, and bus stop selection, showcasing the effectiveness of machine learning and heuristic or metaheuristic algorithms in improving route quality. This study also classifies SBRP problems based on the number of schools, service surroundings (urban or rural), mixed-load scenarios, and fleet mix (homogeneous or heterogeneous). Finally, the paper explores the objectives of SBRP research, including minimising the total cost, distance, time, and number of buses. Meanwhile, the constraints of this study are the capacity of a bus, the maximum riding time, time windows, the maximum walking time between two stops and so on. This comprehensive review paper aims to offer a framework for new researchers and provides valuable insights for future research directions in this transportation area.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
校车路线问题的最新趋势回顾
校车路线问题(SBRP)是一个复杂的交通难题,涉及寻找最佳校车路线。本综述概述了校车路线问题研究的最新进展,重点关注三个子问题:公交线路生成、公交线路调度和公交站点选择。本文研究了最近发表的 57 篇相关文章。它强调了对现实世界和复杂场景的日益关注,以及元启发式方法在解决 SBRP 挑战中的日益普及。分析揭示了公交线路生成、公交线路调度和公交站点选择的重要性,展示了机器学习和启发式或元启发式算法在提高线路质量方面的有效性。本研究还根据学校数量、服务环境(城市或农村)、混合负载情景和车队组合(同质或异质)对 SBRP 问题进行了分类。最后,本文探讨了 SBRP 的研究目标,包括总成本最小化、距离最小化、时间最小化和巴士数量最小化。同时,本研究的约束条件包括公交车的容量、最长乘车时间、时间窗口、两站之间的最长步行时间等。这篇综合综述论文旨在为新研究人员提供一个框架,并为该交通领域未来的研究方向提供有价值的见解。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
The Design of Low Power Op-amp for Biomedical Application Design and Improvement of Mobility Aid Walker By Using QFD and TRIZ Method Predicting Diabetes Mellitus with Machine Learning Techniques Design and Development of A Hemisphere Flat Base Solar Thermal Water Distillation System Investigation of Flexible Job Shop with Machine Availability Constraints
×
引用
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