[1]靳文舟,邓钦原,郝小妮,等.改进人工蜂群算法的农村DRT路径优化研究[J].郑州大学学报(工学版),2021,42(4):84-90.
　JIN Wenzhou,DENG Qinyuan,HAO Xiaoni,et al.Research on Route Optimization of Rural DRT Based on Improved ABC Algorithm[J].Journal of Zhengzhou University (Engineering Science),2021,42(4):84-90.
点击复制

改进人工蜂群算法的农村DRT路径优化研究()
分享到：

《郑州大学学报(工学版)》[ISSN:1671-6833/CN:41-1339/T]

卷:
42
期数:
2021年4期
页码:
84-90
栏目:
出版日期:
2021-07-30

文章信息/Info

Title:
Research on Route Optimization of Rural DRT Based on Improved ABC Algorithm
作者:
靳文舟,邓钦原,郝小妮,朱子轩
华南理工大学 土木与交通学院，广东 广州 510641
Author(s):
JIN Wenzhou,DENG Qinyuan,HAO Xiaoni,ZHU Zixuan
School of Civil and Transportation，South China University of Technology，Guangzhou 510641，China
关键词:
需求响应公交; 农村居民出行; 车辆路径问题; 同时接送模式; 自适应大邻域人工蜂群算法
Keywords:
demand responsive transit; travel of rural residents; vehicle routing problem; simultaneous pick-up and drop off mode; adaptive large neighborhood search artificial bee colony algorithm
文献标志码:
A
摘要:
农村地区的需求响应公交模式因其特殊的运输特性区别于常规公交模式。本文根据农村客运出行的特殊规律和实际需求情况,对农村地区DRT模式进行了探讨，提出了考虑农村居民同时接送条件的车辆路径问题模型。在模型中考虑同时接送乘客的特殊时间窗和其他限制条件，构建了以运输网络总成本最优为目标的VRP模型，并提出了一种两阶段的自适应大邻域人工蜂群算法进行求解。最后通过实际算例仿真来验证该模型和算法的可行性。结果显示，农村地区需求响应公交模型在考虑同时接送的条件下更贴合实际情况，优化结果良好；另外，相比于遗传算法和ALNS算法，自适应大邻域人工蜂群算法收敛速度更快，成本均值、标准差和方差结果更优，在精度和鲁棒性上有较好的表现，可以有效地找到高质量解决方案。
Abstract:
The travel demand of residents in rural areas is low and scattered,which makes it difficult for conventional bus mode to sustain.According to the characteristics of rural residents′ travel demand,in order to reduce the operation cost and improve the transportation efficiency,a vehicle routing problem model considering the demand responsive transit (DRT)simultaneous pick-up and drop off mode in rural areas was constructed.And an improved two-stage adaptive large neighborhood search artificial bee colony algorithm was proposed to solve the model.The example results showed that in the rural areas with low demand density,the rural DRT simultaneous pick-up and drop off model was more economical and practical.Compared with the genetic algorithm and adaptive large neighborhood search algorithm,the average cost of the improved artificial bee colony algorithm was 9% and 3% lower than the above two algorithmsrespectively,and the convergence speed was faster,the performance was better in accuracy and stability,so it could effectively find the optimal solution with high quality.

参考文献/References:

[1] DAGANZO C F.Checkpoint dial-a-ride systems[J].Transportation research part B:methodological,1984,18(4/5):315-327.

[2] AMIRGHOLY M,GONZALES E J.Demand responsive transit systems with time-dependent demand:userequilibrium,systemoptimum,and management strategy[J].Transportation research part B:methodological,2016,92:234-252.
[3] DIANA M,QUADRIFOGLIO L,PRONELLO C.A methodology for comparing distances traveled by performance-equivalent fixed-route and demand responsive transit services[J].Transportation planning and technology,2009,32(4):377-399.
[4] DANTZIG G B,RAMSER J H.The truck dispatching problem[J].Management science,1959,6(1):80-91.
[5]SÁNCHEZ-ORO J,LÓPEZ-SÁNCHEZ A D,COLMEN-AR J M.A general variable neighborhood search for solving the multi-objective open vehicle routing problem[J].Journal of heuristics,2020,26(3):423-452.
[6]GU ZQ,ZHU Y,WANG Y X,et al.Applying artificial bee colony algorithm to the multidepot vehicle routing problem [J]. Software: practice and experience,2020:1-16.
[7] KARABOGA D,BASTURK B.A powerful and efficient algorithm for numerical function optimization:artificial bee colony (ABC) algorithm[J].Journal of globalopti-mization,2007,39(3):459-471.
[8]毛声，谢文俊，张建业，等.车辆路径问题的双重进化蜂群算法求解研究［J］.计算机工程与应用，2016,52(7):35-42,78.
[9] ROPKE S, PISINGER D. Anadaptive large neighborhood search heuristic for the pickup and deliv-ery problem with time windows[J].Transportation sci-ence,2006,40(4):455-472.
[10]魏占阳，邬炼，张佳伟，等．基于自适应大规模邻域搜索算法的两级车辆路径问题［J］.物流科技，2015,38(8):4-7.
[11] HUANG D,GU Y,WANG S A,et al.A two-phase opti-mization model for the demand-responsive customized bus network design[J].Transportation research part C:emerging technologies,2020,111:1-21.
[12] DAGANZO C F,OUYANG Y F.A general model of demand-responsive transportation services:from taxi to ridesharing to dial-a-ride [J].Transportation research part B:methodological,2019,126:213-224.
[13] PAPANIKOLAOU A,BASBAS S.Analytical models for comparing demand responsive transport with bus services in low demand interurban areas[J].Transpor-tation letters,2020:1-8.
[14] GOREV A, POPOVA O,SOLODKIJ A. Demand-re-sponsive transit systems in areas with low transport demand of "smart city" [J].Transportation research procedia,2020,50:160-166.
[15]林镇泽．求解双层车辆路径问题的改进人工蜂群算法［D］．广州：华南理工大学，2014．
[16]王志刚，夏慧明．求解车辆路径问题的人工蜂群算法［J］．计算机工程与科学，2014,36（6）：1088-1094．
[17]金叶，孙越泓，王加翠，等．基于单纯形的改进精英人工蜂群算法［J］．郑州大学学报（工学版），2018，39(6):36-42.
[18]朱子轩，靳文舟，巫威眺，等．考虑驾驶员需求的定位运输线路安排问题［J］.广西大学学报（自然科学版），2020,45（1）：229-238．
[19] ALINAGHIAN M,SHOKOUHI N.Multi-depot multi-compartment vehicle routing problem, solved by a hybrid adaptive large neighborhood search[J].Omega,2018,76:85-99.
[20] SARASOLA B,DOERNER K F.Adaptive large neigh-borhood search for the vehicle routing problem with synchronization constraints at the delivery location[J].Networks,2020,75(1):64-85.
[21]苗国强，于岚，胡娟娟，等．基于自适应大规模邻域搜索算法的带时间窗的车辆路径问题［J］.物流技术，2015,34（11）：156-158,173．
[22] GU W J,CATTARUZZA D,OGIER M,et al.Adaptive-large neighborhood search for the commodity constrained split delivery VRP [J]. Computers &operations research,2019,112:104761.

更新日期/Last Update: 2021-08-26