基于不同补给方式的多车场车辆路径问题分析-analysis of multi-depot vehicle routing problem based on different replenishment ways.docxVIP

AbstractMultiple-depot vehicle routing problem (MDVRP) is widely used in real world. With the development of modern business, the vehicle routing problem (VRP) is more and more complex and the MDVRP, a generalization of the VRP has received a great deal of attention. The MDVRP is to determine a set of vehicle routes that each vehicle route starts and ends at the same depot. Every customer in the system should get its demand and the total cost is minimized. There may be some other restraints such as vehicle capacity, limited route time, time windows and so on.Delivery, as a part of logistics, is not independent. Each portion of the logistics is related and just minimize the delivery cost cannot achieve the maximal benefit. This thesis adds a supplement cost which result from replenishment of advanced position based on MDVRP. So the objective is minimizing the total cost of delivery and supply. This thesis concentrates on three aspects: MDVRP with different replenishment methods; relaxation problem of MDVRP with different replenishment; tabu search algorithm and label algorithm for shortest path. The first part introduces the research case, motivation and literature review. The part two tells some variants and algorithms of VRP or MDVRP, as well as innovation of this thesis. The third part focuses on MDVRP based on different replenishment methods research, including mathematical formulation and metaheuristic algorithm. And then part four develops a relaxation model loosening one of constraints, while an adjusted label algorithm is used to solve it. The last part compares upper bound resulted from metaheuristic algorithm and lower bound of relaxation problem. Finally, effectiveness of metaheuristic algorithm is analyzed.Key words: replenishment cost, Multiple-depot vehicle routing problem, tabu search, lagrangian relaxation目录摘要............................................................................................................... IAbstract.......................