Truck And Trailer Routing Problem:Collection And Distribution Of Goods

In recent years,"One belt,one road","free trade zone" and other major economic development strategy is in full swing in the promotion of the logistics industry as a bridge for the flow of goods,its modern,efficient,green development trend,to a certain extent With the smooth implementation of these economic development strategies.China has become the world's second largest economy,with the world's first annual road transport of goods,as well as the world's second largest economy,Quantity and growth,to promote the rejection of transport on the one hand in line with national economic development requirements,on the other hand is to achieve the logistics industry to meet the needs of the market means.The problem of planning the transport path is one of the key points in the research on the problem of transportation.It is the key to highlight its advantages.It is very important for the implementation of the transportation industry in the logistics industry.In this paper,the collection and distribution of goods as the background,the study of a single trailer,multi-truck mode,with satellite hanging point of the rejection of the transport path planning problem.Firstly,the theory and method of hoisting and transportation are briefly introduced,including the definition and principle of the problem of transport path planning,and the concrete relationship,path type and volume constraint are analyzed.There are several methods commonly used in the planning of transport routes.Secondly,this paper makes a brief description of the background of the collection and distribution of goods,and builds on the background,the establishment of Multi-Truck and Single-Trailer Routing Problem with Satellite Spot(MTSTRPSD)The problem model is used to design the initial solution and neighborhood solution for the particularity of the problem by using the tabu search algorithm.Thirdly,the comparison experiment between tabu search and simulated annealing algorithm is carried out,and the effectiveness and efficiency of tabu search algorithm are verified.Finally,this paper studies the MTSTRPSD problem with time window.After the establishment of the problem model,the design of the initial solution and the neighborhood solution is redesigned.The experiment is carried out by using the tabu search algorithm to verify the effectiveness of the algorithm.In this paper,the research results can enrich the research results of rejection,and verify the effectiveness and efficiency of the tabu search algorithm in solving the problem.In addition,the research results of this paper have some practical significance to the implementation of the dumping transportation in reality.The efficiency of the transfer of transport to enhance the implementation of the program can provide a certain reference.