Logistics Vehicle Scheduling Algorithm And Its Vehicle Scheduling At The Pier

Due to the globalization of the international trade around the world, the service functions of ports become various. Meanwhile, with the explosive development of logistics industry, especially appearance of the third part logistics companies, lowering logistics cost is becoming "third profit source of enterprises", how to drop logistics cost is concerned by more and more people. Lowering transportation cost has played a major role to reduce logistics cost. Vehicle Routing Problem, or VRP, is a very important sub problem inborn in many distribution systems. Researches on conventional VRP is normally based upon static model, in which all relevant information regarding routes construction is known before the routing process and will not change during the operation course. Nevertheless, there are a lot of uncertain factors in the real application. This fact calls for more attention to pay on Dynamic Vehicle Routing Problem.Static VRP method which fix on the route before the vehicle running is not suitable to solving the Port Storage Vehicle Routing Problem, because it is disaccorded with the realities. The paper adopts Dynamitic VRP to solve the problem. The system of managing vehicles is divided into two parts: the system policy of dispatching the routes of vehicles and the vehicle policy of selecting routes. The system policy is to search the nearest vehicles for the requirement to accomplish the transport task. The vehicle policy is to choose the shortest route to reach the destination point. To choose the shortest route, we will consider tow elements of selecting route, it are path length and the path jam. The algorithms about the tow policies are given.Firstly, we introduce the concept of VRP briefly. We represent the mathematical methods which used to solve the VRP in classification, and describe principles and characteristic of algorithms. Next, we give the comparison among these algorithms. We introduce Dijkstra algorithm, tabu search algorithm, Genetic algorithm, and Artificial Neutral Networks algorithm and represent processes and characteristics of these algorithms, respectively. Then, the shortest routing problem is put forward. We compare the difference between the static VRP and dynamic VRP. We introducepolices of dynamic routing to solving the port storage traffic problem, and present the algorithms which is used to solve the port storage vehicle routing problem. In the end, the summarization of the paper and the prospect of the future are given.