Author/Authors :
Zhang، Ying نويسنده Department of Industrial Engineering, Tsinghua University, Beijing 100084, China , , Qi، Mingyao نويسنده Research Center on Modern Logistics, Graduate School at Shenzhen, Tsinghua University, Shenzhen 518055, China , , Miao، Lixin نويسنده Research Center on Modern Logistics, Graduate School at Shenzhen, Tsinghua University, Shenzhen 518055, China , , Wu، Guotao نويسنده Research Center on Modern Logistics, Graduate School at Shenzhen, Tsinghua University, Shenzhen 518055, China ,
Abstract :
In this paper, we consider the multi depot heterogeneous vehicle routing problem with time windows in which vehicles may be replenished along their trips. Using the modeling technique in a new-generation solver, we construct a novel formulation considering a rich series of constraint conditions and objective functions. Computation results are tested on an example comes from the real-world application and some cases obtained from the benchmark problems. The results show the good performance of local search method in the efficiency of replenishment system and generalization ability. The variants can be used to almost all kinds of vehicle routing problems, without much modification, demonstrating its possibility of practical use.
