A Hybrid Genetic and Variable Neighborhood Descent Algorithm for VehicleRouting Problem with Simultaneous Delivery and Pickup
[1]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]
Copy
Journal of Zhengzhou University (Engineering Science)[ISSN
1671-6833/CN
41-1339/T] Volume:
36卷
Number of periods:
2015 03
Page number:
120-124
Column:
Public date:
2015-06-30
- Title:
- A Hybrid Genetic and Variable Neighborhood Descent Algorithm for VehicleRouting Problem with Simultaneous Delivery and Pickup
- Keywords:
- vehicle routing problem; simultaneous delivery and pickup; variable neighborhood descent; ge-netic algorithm; NP-hard
- CLC:
- TP301
- DOI:
- 10.3969/ j. issn.1671 -6833.2015.03.026
- 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:
- -
- Similar References:
Memo
-
Last Update: