路径规划算法的分析与应用.pdfVIP

ABSTRACT ABSTRACT Route planning is a hot issue in recent years. It is widely used in a variety of fields and has formed a complete theoretical system. With the progress of science and technology, the scope of application of path planning technology is expanded. Now, it becomes the key technology in many areas. The main application areas are robot route planning, intelligent transportation, logistics, and so on. Path planning method has been extended to the entire multi-objective problems that can consist with dots and lines. Therefore, the path-planning algorithms receive the attention of researchers because of the widely use of it. This paper will do some research on the path planning algorithm and use it to solve practical application problems. First of all, this article will build an improved TS (Tabu Search) algorithm to solve the VRPTW (Vehicle Routing Problem with Time Window) problem. The improvements will be processed from the way to generate the initial solution, the structure of the tab object and the length of the tab list and so on. We will describe the improved TS algorithm in more detail form the partitions of the algorithm and the steps of it. Then, we will do some experiments to test the results of our improved methods. The results of the experiments show that our algorithm can achieve g d results under the data that with a clustered distribution characteristic, but there is a deficiency that the results under the data with randomly distributed are inferior. By solving the VRPTW problems, according to the new delivery requirement may appear in the actual transportation or the changes in the demand may occur, we add some dynamic needs