# [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的变邻域混合遗传算法() 分享到： var jiathis_config = { data_track_clickback: true };

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.郑州轻工业学院软件学院,郑州河南450002;2.郑州轻工业学院计算机与通信工程学院,郑州河南450002
Author(s):
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:

TP301
DOI:
10.3969/ j. issn.1671 -6833.2015.03.026

A

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.