Abstract
To solve the problem of efficient distribution of convenience store chains, this paper creates a multi-compartment vehicle routing problem model with time- windows (MCVRP-TW) to meet the goal of minimizing the total distribution cost. The solution is based on a hybrid genetic algorithm, which using the “destruction” and “repair” operators of the large-scale neighborhood search algorithm and the Metropolis criterion of simulated annealing for local search operations. The results show that the proposed multi-compartment vehicle routing model with time windows and the hybrid algorithm can meet the requirement of practical route design and reduce the total distribution cost.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
