Revised eight-step feasibility checking procedure with linear time complexity for the Dial-a-Ride Problem (DARP)
Author:
Publisher
Elsevier BV
Reference26 articles.
1. An optimal algorithm for shortest paths on weighted interval and circular-arc graphs, with applications;Atallah;Algorithmica,1995
2. A hybrid tabu search and constraint programming algorithm for the dynamic dial-a-ride problem;Berbeglia;INFORMS J. Comput.,2012
3. Exact and meta-heuristic approach for a general heterogeneous dial-a-ride problem with multiple depots;Braekers;Transp. Res. B,2014
4. An ELS-based approach with dynamic probabilities management in local search for the dial-a-ride problem;Chassaing;Eng. Appl. Artif. Intell.,2016
5. A branch-and-cut algorithm for the dial-a-ride problem;Cordeau;Oper. Res.,2006
Cited by 3 articles. 订阅此论文施引文献 订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A math-heuristic and exact algorithm for first-mile ridesharing problem with passenger service quality preferences;Transportation Research Part E: Logistics and Transportation Review;2024-12
2. A ride time-oriented scheduling algorithm for dial-a-ride problems;Computers & Operations Research;2024-05
3. An Adaptive Linear Programming Algorithm with Parameter Learning;Algorithms;2024-02-19
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3