Research On Dynamic Vehicle Routing Problem And Its Application

With the rapid development of transportation business, its relationship with social life is becoming close; hence transportation cost is concerned by more and more people. Real time dynamic vehicle scheduling is a good scientific approach to lower transportation cost and it can reduce rate of empty driving, lower cost of distribution and take great effect on the efficiency; therefore the research of dynamic vehicle routing problem makes significant sense.First of all, this thesis introduces some basic conceptions of vehicle routing problem. Then, it classifies and summarizes some useful algorithms which are used to solve vehicle routing problem, analyzing natures of these algorithms. Further more, it accounts for several import conceptions of dynamic vehicle routing problem and compares the dynamic vehicle routing problem with the static vehicle routing problem. Following, this thesis describes the basic principle and operation process of ant colony algorithm in detail, analyzing the natures of ant colony algorithm. Finally, this thesis develops a dynamic vehicle scheduling system based on ant colony algorithm and compares this system with other dynamic vehicle scheduling systems.