Research On Route Planning Algorithm Under The Constraints Of 3D Loading

With the continuous development of electronic commerce,people's shopping mode is gradually transferring from the traditional in-store purchase to online purchase.This trend will inevitably lead to the rapid development of logistics industry.There are a huge number of online consumers in China given our relatively large population base.Therefore,there are always numerous goods needing to be distributed,creating not only great opportunities for the development of China's logistics industry,but also plenty of challenges.The combination of the two issues of vehicle's path planning and goods' loading has attracted a growing number of domestic and foreign scholars,because it is similar to the real-life case of logistics transportation.How to minimize the transportation cost under the constraints of goods loading will continue to be a long-term focus for future studies.This thesis will center on vehicle's path planning and goods' loading problems.The whole algorithm will be divided into two steps: the first one is the path planning of vehicles.In this step,a combined optimized algorithm of ant colony and tabu search will be adopted together with the saving algorithm.On this basis,the mother and daughter ants' strategy is introduced.The mother ant represents the number of iterations and the daughter ant represents the number of distribution vehicles.When the mother ant is searching for the path,we choose whether to start a delivery vehicle based the load capacity of the vehicle.The tabu search idea is used to access the node in the path,and then neighborhood search and saving algorithm are used to optimize the path.The second step is goods' loading according to the path we have generated in the first step.In this step,the conception of key points and the maximum space are introduced and improved.Besides,many heuristic algorithms are used,such as the maximum alignment value loading algorithm,the maximum contact area loading algorithm,the bearing surface constraints,etc.To verify of the validity of the algorithm,a set of data are obtained from a website on this issue.With these data,many iterations experiments are conducted,the results of which are compared with the tabu search algorithm.