Aiming at the dynamic multicompartment refrigerated vehicle routing problem with multigraph based on real-time traffic information, this study, based on the idea of preoptimization followed by real-time adjustment, establishes a two-stage mathematical model with minimizing delivery cost. In the preoptimization phase, this study, based on historical traffic information, designed a hybrid chaotic genetic algorithm with variable neighborhood search (HCGAVNS) to obtain the initial delivery scheme. In the real-time adjustment phase, the order in which customers are served remains the same and a path selection strategy is proposed to solve the problem according to the real-time traffic information of different paths. The validity of the model and the algorithm are verified through the analysis of instances. The research results can enrich the related research on cold chain vehicle routing problem and provide a theoretical basis for logistics companies to optimize their delivery scheme.
Dynamic Multicompartment Refrigerated Vehicle Routing Problem with Multigraph Based on Real-Time Traffic Information
2022
Aufsatz (Zeitschrift)
Elektronische Ressource
Unbekannt
Metadata by DOAJ is licensed under CC BY-SA 1.0
Constructive Heuristics for the Multicompartment Vehicle Routing Problem with Stochastic Demands
Online Contents | 2011
|Constructive Heuristics for the Multicompartment Vehicle Routing Problem with Stochastic Demands
British Library Online Contents | 2011
|Contact Multigraph Routing: Overview and Implementation
IEEE | 2023
|A tabu search heuristic for the heterogeneous vehicle routing problem on a multigraph
Online Contents | 2016
|