A branch and bound algorithm for the multiple depot vehicle scheduling problem
Author:
Publisher
Wiley
Subject
Computer Networks and Communications,Hardware and Architecture,Information Systems,Software
Reference11 articles.
1. On some matching problems arising in vehicle scheduling models
2. Classification in vehicle routing and scheduling
3. Routing and scheduling of vehicles and crews
4. Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman Problem
Cited by 98 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Electric bus fleet scheduling under travel time and energy consumption uncertainty;Transportation Research Part C: Emerging Technologies;2023-11
2. Public transport for smart cities: Recent innovations and future challenges;European Journal of Operational Research;2023-05
3. An exact approach for the multi-depot electric bus scheduling problem with time windows;European Journal of Operational Research;2023-04
4. Determining lower bound on number of vehicle blocks in multi-depot vehicle scheduling problem with mixed fleet covering electric buses;Archives of Transport;2023-03-31
5. A Three-Stage Framework for Optimizing Customized Bus Operations Considering COVID-19 Social Distancing Measures;2022 IEEE 25th International Conference on Intelligent Transportation Systems (ITSC);2022-10-08
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3