Improved variable neighborhood search algorithm for multi-compartment green vehicle routing problem
Focusing on the problem of"multiple depots,punctuality,multiple products and energy intensity"arising in the distribution scenario of community group purchase,this paper studies the multi-depot multi-compartment green vehicle routing problem with time windows(MDMCGVRPTW).A mixed integer linear programming(MILP)model and an improved variable neighborhood search(IVNS)algorithm are proposed.High quality initial solutions are obtained by a two-stage hybrid(2SH)algorithm.A new balanced shaking heuristic is designed to fully explore the solution space,and a granularity mechanism is introduced to improve the efficiency of local search.The 2SH algorithm and the IVNS algorithm have already demonstrated their effectiveness in solving the benchmarks.The experiment results based on the simulation examples show that the proposed model and algorithm can effectively solve the MDMCGVRPTW,and the improved strategies enhance the exploitation capability of the IVNS algorithm.Finally,some management insights for relevant distribution enterprises are given based on the sensitivity analysis of distribution strategy and timeliness to achieve cost reduction and efficiency increase.
万方数据
维普
