Aiming at the time-dependent green vehicle routing problem with fuzzy demand, this paper comprehensively considers the dispatch costs, time window penalty costs, fuel costs, and the effects of vehicle travel speed, road gradient, and vehicle load on fuel consumption, a mixed integer programming model is formulated based on pre-optimization and re-optimization strategies. The traditional vehicle routing problems are modeled based on a symmetric graph. In this paper, considering the influence of time-dependent networks on route optimization, modeling is based on an asymmetric graph, which increases the complexity of the problem. In the pre-optimization stage, a pre-optimization scheme is generated based on the credibility measure theory; in the re-optimization stage, a new re-optimization strategy was used to deal with the service failure node In order to solve this problem, we developed a chaotic genetic algorithm with variable neighborhood search, pseudo-randomness of chaos was introduced to ensure the diversity of initial solutions, and adaptive neighborhood search times strategy and inferior solution acceptance mechanism were proposed to improve the performance of the algorithm. The numerical results show that the model and algorithm we proposed are effective. © 2022 by the authors.
https://doi.org/10.3390/sym14102115Cite as:
@article{Fan_2022,
doi = {10.3390/sym14102115},
url = {https://doi.org/10.3390%2Fsym14102115},
year = 2022,
month = {oct},
publisher = {{MDPI} {AG}},
volume = {14},
number = {10},
pages = {2115},
author = {Hao Fan and Xiaoxue Ren and Yueguang Zhang and Zimo Zhen and Houming Fan},
title = {A Chaotic Genetic Algorithm with Variable Neighborhood Search for Solving Time-Dependent Green {VRPTW} with Fuzzy Demand},
journal = {Symmetry}
}