期刊名称:International Journal of Industrial Engineering Computations
印刷版ISSN:1923-2926
电子版ISSN:1923-2934
出版年度:2015
卷号:6
期号:1
页码:81-98
DOI:10.5267/j.ijiec.2014.8.005
语种:English
出版社:Growing Science Publishing Company
摘要: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.
关键词:Generalized model; Local search; Multi-depot; Replenishment; Vehicle routing