The Model Research Of Three-dimensional Bin Packing Problem With Vehicle Routing Constricts

Nowadays,with the rapid development of economy,logistics industry has become indispensable in our lives,the application of logistics technology and development have also attracted more and more attention.In the process of logistics transportation,the packing of the goods and vehicle transportation path problems are equally important,in order to reduce the items in the process of distribution cost reduction,we need a comprehensive consideration of the two combined optimization problem of vehicle routing problem and the three-dimensional packing problem.Based on the above background,in this paper,considering the distribution vehicle at the time of the three-dimensional packing problem,we use the literature research and the summary induction firstly,from the previous studies of the three-dimensional packing and vehicle routing problems,on the basis of previous research ideas this paper put forward a new train of thought for studying the comprehensive problems.And then we use the mathematical analysis model to construct the comprehensive problem.The total work of this paper is as follows:(1)Model builiding:structure the mathematics model of the three stages of subproblems of three-dimensional packing problem in delivery vehicle,including for the cargo loading on vehicles problem,vehicle routing problem,the three-dimensional packing problem with unloading sequence constraint model building;(2)Algorithm designing:this paper design a new though to solve the three-dimensional packing problem in delivery vehicle,and divide the three-dimensional packing problem in delivery vehicle into three stages subproblem to design algorithms,including designing the electromagnetic-like mechanism algorithm to solve the cargo loading problem,improving the algorithm in particle force calculation to simplify the EM algorithm,designing artificial bee colony algorithm for vehicle routing problem,with improving the employed bees search phase,observed bees search phase,scout bees search phase,and designing guide heuristic algorithm based on backtracking method to solve the three-dimensional packing problem in consideration of the loading sequence.Then to design a general algorithm for solving the problem.(3)Instance analysis:this paper design programming algorithm distribution for the three-dimensional packing problem in delivery vehicle and then design data inspection to verify the feasibility of the algorithm.At the same time,we change the parameters of the artificial bee colony algorithm,comparing the results of problem due to the influence of different parameters.At the end of the paper,the conclusions of this study,the research limitations and further expand work have been summarized.The purpose and significance of the study is,in the process of distribution vehicle three-dimensional packing of goods,making that the truck loading goods quantity is least,and the vehicle distribution paths as short as possible.From the optimization of the two aspects,to reduce the cost in the process of logistics distribution.At the same time,considering the constraints in real life,as far as possible to narrow the gap in theoretical research and practical life,it’s really important to improve the efficiency of the distribution in real life,to reduce the distribution cost.