Research Of Vehicles Routing Problem For Logistics And Distribution

In recent years, China’s GDP has been rapid growth of logistics and economic development is increasingly dependent on logistics and distribution industry. However, modern logistics and distribution industry in China is still in the early stages of development, compared to the technical level of developed countries there is a wide gap. The development of China’s modern logistics bottleneck is the imperfections of modern logistics systems and logistics operation process unreasonable. Logistics operations, transportation and warehousing management experience in the process is still dominated largely by optimization theory and methods. Anomaly can be seen everywhere, it is difficult to have a "third profit". Optimizing vehicle routes will not only help decision makers to make scientifically sound decisions quickly and improve distribution efficiency and customer satisfaction, but also good to improve urban traffic conditions. Therefore, the study of choice for Vehicle Scheduling is important.First, this thesis describes the problem of VRP in detail, including background, purpose and meaning, and summed up the modern logistics and distribution, vehicle routing problems and Ant Colony Algorithm research status. In the theory part introduces the Ant Colony Algorithm. Second, logistics and distribution system for routing analysis and design, and design of vehicle routing model and its solution algorithm, which is the main part of the thesis. Finally, an example used to design and implement distance-based shortest path selection module.In this thesis, Ant Colony Algorithm is used to calculate the shortest path, and use Matlab 2010b to achieve it. Module programming and interface design is to use C# language to achieve. Html and Javascript scripting languages are used to load and manipulate maps. This thesis uses the Access database. These are the technical line of this thesis.