Research On Vehicle Loading Path Optimization Based On Hard Time Window Constraint

With the comprehensive promotion of "Internet+" action,a new shopping mode-online and offline shopping mode has emerged and developed rapidly.Online shopping promotes the rapid development of e-commerce industry,and the corresponding logistics industry also welcomes new development opportunities.The modern logistics owner mainly includes transportation,warehousing and logistics distribution,which is a key link affecting the development of e-commerce industry.The logistics distribution link of modern logistics industry is the main link restricting the development of logistics industry and the end link of logistics activities.Reasonable planning of vehicle routing scheme and proper packing mode of customer goods are important ways for logistics enterprises to guarantee their benefits and reputation.This paper analyses many factors that influence logistics enterprises to make reasonable vehicle distribution route and packing plan of goods,and determines the research questions of this paper.This paper carries out a joint study on vehicle routing optimization and packing optimization of goods,taking distribution of large household electrical appliances in Suning as the research object.Carry out research on Optimization of vehicle packing path for large-scale household electrical appliances distribution.Through consulting a large number of literature,sort out relevant theories on Optimization of vehicle packing path,and study the 2L-CVRPTW problem from the aspects of mathematical model and solution algorithm.In this paper,firstly,according to the actual logistics distribution requirements of largescale household electrical appliances,the constraints are analyzed,and a mathematical model with the objective of optimizing the shortest vehicle routing,the least penalty cost caused by waiting time and the maximum utilization rate of packaging is established.Secondly,the basic principles and characteristics of different algorithms are studied and compared.A hybrid algorithm including improved ant colony algorithm and heuristic packing algorithm based on minimum waste priority strategy is used to solve the 2L-CVRPTW problem.Then,through the test of Solomon standard example and comparing the results of Solomon standard example with different algorithms in different literatures,it can prove the validity of the algorithm proposed in this paper in solving VRP problems.Finally,the case of Suning large household electrical appliances distribution is solved.The improved ant colony algorithm can solve a reasonable planning route.The heuristic packing algorithm is used to verify the feasibility of packing goods and to optimize the packing of goods.The case results further prove the rationality of the mathematical model proposed in this paper and the effectiveness of the algorithm.