首页 | 本学科首页   官方微博 | 高级检索  
     检索      

考虑行驶时间不确定性的合乘路径鲁棒优化方法
引用本文:袁振洲,陈思媛,吴玥琳,李浩然,肖清榆.考虑行驶时间不确定性的合乘路径鲁棒优化方法[J].交通运输系统工程与信息,2022,22(5):233-242.
作者姓名:袁振洲  陈思媛  吴玥琳  李浩然  肖清榆
作者单位:1. 北京交通大学,综合交通运输大数据应用技术交通运输行业重点实验室,北京 100044; 2. 湖南省交通科学研究院有限公司,长沙 410004
摘    要:为应对实际合乘过程中时间不确定性带来的负面影响,本文研究不确定行驶时间下的合乘问题。采用预算不确定集合描述时间变量,引入不确定性水平可调节的预算系数,构建以车辆总里程最短和车辆数最少为目标的合乘路径鲁棒优化模型。并设计两阶段算法求解,第1阶段以两乘客间的可行合乘路径为基础,从车辆总里程节省率和乘客时间窗匹配灵活性两方面设计公式量化合乘匹配机会,以匹配机会为权重构建乘客图网络并聚类乘客需求;第2阶段设计以顺序插入启发式方法构造初始解的禁忌搜索算法求解。案例数据实验结果表明:本文聚类方法能保证优化质量并提高85%以上的计算效率,同时能缩减乘客等车时间和绕行距离;增大预算系数时解的鲁棒性逐渐提高,但会增加10%~40%的车辆数并降低1%~10%的里程节省率;大规模乘客案例和窄时间窗案例的合乘路径对不确定时间的敏感性更高,宽时间窗案例无需增加过多额外车辆和总里程就能达到较高水平的路径鲁棒性。

关 键 词:交通工程  合乘  鲁棒优化  时间不确定性  匹配机会  禁忌搜索  
收稿时间:2022-06-12

Robust Optimization of Carpooling Routing Problem Under Travel Time Uncertainty
YUAN Zhen-zhou,CHEN Si-yuan,WU Yue-lin,LI Hao-ran,XIAO Qing-yu.Robust Optimization of Carpooling Routing Problem Under Travel Time Uncertainty[J].Transportation Systems Engineering and Information,2022,22(5):233-242.
Authors:YUAN Zhen-zhou  CHEN Si-yuan  WU Yue-lin  LI Hao-ran  XIAO Qing-yu
Institution:1. Key Laboratory of Transport Industry of Big Data Application Technologies for Comprehensive Transport, Beijing Jiaotong University, Beijing 100044, China; 2. Hunan Communications Research Institute Co. Ltd., Changsha 410004, China
Abstract:In order to relieve the negative impact of time uncertainty in carpooling process, the study focuses on the carpooling problem with travel time uncertainty. A budget uncertainty set is used to describe the travel time variable, and a budget coefficient with an adjustable uncertainty level is introduced to build a robust optimization model with the shortest total vehicle mileage and the least number of vehicles as the objective function. A two- stage algorithm is designed. In the first stage, based on the feasible carpooling routes between two passengers, we design a formulation to quantify the matching chance in terms of total vehicle mileage saving rate and the passenger time window matching flexibility, and then the matching chance is used as the weight to construct a passenger graph network and cluster the passengers. In the second stage, we design a Tabu search algorithm to solve the problem by constructing an initial solution with the sequential insertion heuristic method. The experimental results show that the clustering method can ensure the solution quality and improve the computational efficiency by more than 85% while reducing the passenger waiting time and detour distance. The robustness of the solution gradually improves when increasing the budget coefficient, but it increases the number of vehicles by 10%~40% and reduces the mileage saving rate by 1%~10%. The carpooling routes of the large-scale cases and the narrow time window cases are more sensitive to the uncertain time, and the wide time window cases can achieve a high level of robustness without adding too many additional vehicles and total mileage.
Keywords:traffic engineering  carpooling  robust optimization  travel time uncertainty  matching chance  Tabu search  
点击此处可从《交通运输系统工程与信息》浏览原始摘要信息
点击此处可从《交通运输系统工程与信息》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号