Research On Non-full Load Pickup And Delivery Vehicle Routing Problems

This paper mainly studies three non-full loads pickup and delivery vehiclerouting problems.Chapter1firstly introduces the background, significance and research status ofnon-full loads pickup and delivery vehicle routing problems, then summarizes themain research contents of this paper. Chapter2introduces four heuristic algorithmsfrequently-used to solve the non-full loads pickup and delivery vehicle routingproblems. Chapter3discusses a single depot single vehicle types non-full loadspickup and delivery vehicle routing problem, in which the maximal travel distancelimit, start-up costs, travel costs of vehicles and the soft time windows constraint ofthe tasks are considerd, a tabu search algorithm is given to solve this problem.Chapter4studies a multi-depot single vehicle types non-full loads pickup anddelivery vehicle routing problem gotten by changing the single depot in the problemof chapter3into multi-depot and remaining other conditions and requirements ofchapter3unchanged, this paper gives a genetic algorithm to solve it. Chapter5researches a multi-depot and heterogeneous-vehicle non-full loads pickup anddelivery vehicle routing problem which is an extension to the problem in chapter4(i.e.change the single vehicle types in the problem in chapter4into heterogeneous-vehicle,delete the soft time windows constraint and remaining other conditions andrequirements of chapter4unchanged), this paper presents a predatory searchalgorithm to solve it. At last, this paper summarises the non-full loads pickup anddelivery vehicle routing problem, and look into the future research to this kind ofproblem.