| With the intensification of market competition, logistics as "third profit source" hasalready become important part of market competitiveness. And transportation is usuallythe biggest single cost among logistics costs. Through the planning of vehicle path,vehicles can be made to meet customers’ service and at the same time, the costs oftransportation can be reduced so that the overall logistics costs can be reduced, which hasa significant meaning. Therefore, since Vehicle Routing Problem (VRP) was put forwardby Dantzig and Ramser in1959, widely lasting attention was caused among numerousscholars, who closely combined the operational research theory and practice, and hasalready made a lot of research achievements in recent decades. Up until now the researchconcerning vehicle routing problem is still thriving.In the vehicle routing problem, we can divide VRP into single depot and multi-depotvehicle routing problem according to the number of depots. Currently, the research onsingle depot VRP is relatively more. However, because of the late start and the morecomplex solution compared with the single depot condition, multi-depot VRP is still a hotissue under present researches. This paper begins with the hypothesis that the carrier is therational economic man, and on the basis of this the author points out a view that thecarrier will make his option about goods that can bring different transport income in theprocess of carrying goods, thus, transport routing can be affected. In a word, this papermakes a research into multi-vehicle and multi-depots vehicle routing problem, and putsforward multi-goods and multi-depots vehicle routing problem based on value transport;moreover, the rule of value transport is also put forward, and solutions can be foundaccording to the rules.This paper first introduces the research background, research situation at home andabroad and the main study of the present research in the introduction part. And then,related theory of the vehicle routing problem together with multi-depots vehicle routingproblem and the common algorithms are introduced. After that, according to thetransportation process under real situations, goods are classified by its transportationvalue, which makes the single homogeneous goods in VRP change into multi-goodstransportation problem. And according to the hypothesis that the carrier is the rationaleconomic man, who will judge the transportation income in the process of carrying goods,which thus lead to the different choices of goods and routings; this paper proposes and illustrates the multi-goods and multi-depots vehicle routing problem, and correspondingsolution is introduced, which is proved to be effective through the relevant example. Inthe following part of this paper, time factor is involved into the problem, and the authortries to solve the problem by using the method presented in this paper throughtransforming time into factor which affects the transportation value of the goods. The lastpart is the conclusion of this paper. |
