Font Size: a A A

Based On The Research And Software Development Of Large-scale Logistics Vehicle Scheduling Algorithm In COMAC's Manufacturing Workshop

Posted on:2019-01-14Degree:MasterType:Thesis
Country:ChinaCandidate:M T ChenFull Text:PDF
GTID:2438330590992229Subject:Control Engineering
Abstract/Summary:PDF Full Text Request
With the rapid development of the large civil aircraft in China,the Commercial Aircraft Corporation of China has formally entered the multi model and multi state development stage.The ARJ21 new branch aircraft has been put into commercial operation and delivered to Chengdu airlines.The C919 large passenger plane has completed the important stage of the first flight into the test flight,and it is far from China and Russia.The large-scale wide body airliner has also entered the research and development.The continuous advancement and development of the three major models bring important opportunities to the development of the logistics transportation level in the company.At the same time,the increase of the model project and the scale of the company will also accompany the increase of cost control demand,which will bring great pressure to the improvement of efficiency.In the six major centers of the company,the logistics and transportation pressure of each manufacturing workshop has been promoted rapidly,and the level of logistics has also become an important ability to improve the economic efficiency of the company.Distribution is the largest and most important part of the whole logistics.It is of great practical significance to improve the efficiency of distribution and to save the cost of transportation for the promotion of logistics transportation capacity.In this paper,we put forward a model to simulate the transportation mode of all kinds of logistics vehicles in the real work,that is,the vehicle routing problem-VRP,which is also the main problem in this paper.According to the research results of today's society,the research shows that the VRP problem has been proved to be a strong NP-Hard problem,and it is difficult for people to get the exact solution of the problem in a limited time.Therefore,the research content of this paper has a relatively excellent solution in the acceptable time.In actual work,even if there are only a few dozen shop distribution points,there will be a large scale of possibility solution,so heuristic algorithm is needed to solve the problem.We have built a code base that can provide a local search heuristic for the parts transportation problem of China commercial flying company,which can provide a relatively excellent solution for the VRP problem in the acceptable time.At the same time,through the calculation and verification of the VRP example of the parts transportation of China commercial flying company,the results and the optimal solution within the short time are must less than 1%.In addition,according to the VRP problem which may contain 1000 distribution points and above in the future,the clustering analysis method is used to decompose dozens of subsets to speed up the problem solving.In order to facilitate the practice of production,we use the Java language to build the software for the code base,which includes a very intuitive and easy to understand interface and the path planning diagram of the final solution.
Keywords/Search Tags:VRPH, Vehicle routing problem, Local search algorithm, Large-VRP
PDF Full Text Request
Related items