Studies On The Optimization And Visualization Of Multi-factor Vehicle Routing Problem With Time Windows

Based on the features of the urban traffic roads network, this paper researches the key technology of choosing the multi-factor restricted optimum vehicle route with the time window in GIS (Geography Information System), Then the thesis puts forward an optimum path to destination through dynamic routing system scheduling. After deep analysis of characteristics of the problem, it introduces Desktop GIS Development Platform-MapInfo and studies on route scheduling algorithm and improves it based on Wuhan urban district E-map. On this basis, it puts forward a practical and high efficient dynamic routing optimization solution, and implemented multi-factor vehicle routing optimization analysis experiment system.The work has the following 4 points:(1) Focus on data model, organization and management form in GIS, this thesis introduces the data structure figured by road network topological structure, from which extracts the key technique after analyzing the road network topology.(2) To get the multi-factor restricted optimum path on the basis of static and dynamic analysis, the paper divides the calculation of the value of road network into the basic and the dynamic part, which makes the result more realistic.(3) Modeling Multi-factor Vehicle Routing Problem with Time Window. Based on characteristics of the outstanding random search and the adapted distributing calculation of Ant Colony Algorithm, the thesis uses the optimum ant colony algorithm to solve the vehicle route problem .(4) By using the mapxtreme2004 control of mapinfo corp, the thesis designs and implements system simulation under visual studio.net integrated development environment.