A Hybrid Discrete Differential Evolution Algorithm to Solve the Split Delivery Vehicle Routing Problem

8Citations
Citations of this article
15Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

For the split delivery vehicle routing problem in the distribution link of logistics where the optimization objective is to minimize the total distance of the transportation path, a hybrid discrete differential evolution (HDDE) algorithm is adopted in this study. The algorithm applies the encoding and decoding method based on the remaining vehicle capacity to split the demand of customer point and adjust the splitting node to the optimal position of its path. In order to avoid the prematurity of the algorithm, the perturbation mechanism is added, i.e., the three-point insertion method is used in the crossover stage. To ensure the higher quality of the solution, the idea of tabu search is introduced in three cases: initial population generation, selection operation and local optimal situation. Finally, through the numerical experiments based on benchmark data, the HDDE algorithm is compared with other competitive algorithms to demonstrate its domination.

Cite

CITATION STYLE

APA

Xing, L. N., Liu, Y., Li, H., Wu, C. C., Lin, W. C., & Song, W. (2020). A Hybrid Discrete Differential Evolution Algorithm to Solve the Split Delivery Vehicle Routing Problem. IEEE Access, 8, 207962–207972. https://doi.org/10.1109/ACCESS.2020.3020728

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free