[1]马欢张建伟赵进超.求解VRPSDP的变邻域混合遗传算法[J].郑州大学学报(工学版),2015,36(03):120-124.[doi:10.3969/ j. issn.1671 -6833.2015.03.026]
　MA Huan,ZHANG Jian-wei,ZHAO Jin-chao,et al.A Hybrid Genetic and Variable Neighborhood Descent Algorithm for VehicleRouting Problem with Simultaneous Delivery and Pickup[J].Journal of Zhengzhou University (Engineering Science),2015,36(03):120-124.[doi:10.3969/ j. issn.1671 -6833.2015.03.026]
点击复制

求解VRPSDP的变邻域混合遗传算法()
分享到：

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

卷:
36卷
期数:
2015年03期
页码:
120-124
栏目:
出版日期:
2015-06-30

文章信息/Info

Title:
A Hybrid Genetic and Variable Neighborhood Descent Algorithm for VehicleRouting Problem with Simultaneous Delivery and Pickup
作者:
马欢1张建伟2赵进超3
1.郑州轻工业学院软件学院,郑州河南450002;2.郑州轻工业学院计算机与通信工程学院,郑州河南450002
Author(s):
MA Huan1; ZHANG Jian-wei; ZHAO Jin-chao2; CHEN Ming1
1.Software Engineering College , Zhengzhou University of Light lndustry ,Zhengzhou 450002 ,China; 2.School of Computer andCommunication Engineering,Zhengzhou University of Light Industry ,Zhengzhou 450002,China
关键词:
卸装一体化; 车辆路径问题; 变邻域下降搜索; 遗传算法; 组合优化
Keywords:
vehicle routing problem;  simultaneous delivery and pickup;  variable neighborhood descent;  ge-netic algorithm; NP-hard
分类号:
TP301
DOI:
10.3969/ j. issn.1671 -6833.2015.03.026
文献标志码:
A
摘要:
针对卸装一体化车辆路径问题,提出一种结合变邻域下降搜索和遗传算法的混合启发式算法( GA_VND).利用随机生成的初始种群,通过遗传算法的交叉变异操作生成弱可行解种群,选择其中的最优值作为变邻域深度搜索的初始解.在变邻域深度搜索的过程中通过两种不同的局部搜索算子对解进行局部搜索和迭代优化.通过对54个算例的求解,仿真结果表明GA_VND更新了54个已知最好解中的8个,表明了该算法是解决卸装一体化车辆路径问题的一种有效方法.
Abstract:
This paper proposes a hybrid heuristic algorithm combing variable neighborhood descent search withgenetic algorithm ( GA_VND) to solve vehicle routing problem with simultaneous delivery and pickup. By theuse of the initial populations generated randomly,the weak feasible solutions are produced by the crossoverand mutation operators of genetic algorithm. And then,the best of them was selected as initial solution of vari-able neighborhood descent algorithm. Finally,in the process of the variable neighborhood descent search, twodifferent neighborhood structures are used to search the locally optimal solution. The simulation results showthat GA_VND can update 8 better solutions in the 54 best known solutions,which illustrates that GA_VND isan effective method for vehicle routing problem with simultaneous delivery and pickup.

相似文献/References:

[1]崔岩,张子祥,时新,等.考虑顾客时间紧迫度的生鲜电商配送路径优化问题[J].郑州大学学报(工学版),2017,38(06):59.[doi:10.13705/j.issn.1671-6833.2017.06.008]
　Cui Yan,Zhang Zixiang,Shi Xin Wang Xiaoliang,et al.Fresh Agricultural E-commerce Product Routing Problem Considering Equally Desirable of Customer[J].Journal of Zhengzhou University (Engineering Science),2017,38(03):59.[doi:10.13705/j.issn.1671-6833.2017.06.008]
[2]汪慎文,杨锋,徐亮,等.离散差分进化算法求解共享单车调度问题[J].郑州大学学报(工学版),2019,40(04):9.[doi:10.13705/j.issn.1671-6833.2019.04.022]
　Wang Shenwen,Yang Feng,Xu Liang,et al.Discrete differential evolution algorithm for solving shared bicycle scheduling problem[J].Journal of Zhengzhou University (Engineering Science),2019,40(03):9.[doi:10.13705/j.issn.1671-6833.2019.04.022]
[3]朱晓东,王鼎.求解双目标VRPTW的改进混合蚁群算法[J].郑州大学学报(工学版),2020,41(04):52.[doi:10.13705/j.issn.1671-6833.2020.04.004]
　ZHU Xiaodong,WANG Ding.An Improved Hybrid Ant Colony Algorithm for Bi-objective VRPTW[J].Journal of Zhengzhou University (Engineering Science),2020,41(03):52.[doi:10.13705/j.issn.1671-6833.2020.04.004]
[4]靳文舟,邓钦原,郝小妮,等.改进人工蜂群算法的农村DRT路径优化研究[J].郑州大学学报(工学版),2021,42(04):84.
　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(03):84.

更新日期/Last Update: