Vehicle Routing Problem With Three-Dimensional Loading Constraints

In the modern social economy, logistics becomes more and more important. How toeffectively lower logistics cost, improve the efficiency of logistics distribution, is becoming akey and important problem that the companies must face. Efficient operation is not onlybeneficial to the improvement of the enterprise efficiency and customer satisfaction, but alsoplay an important role for the formation of the whole ecological environment and low carbonsociety. Logistics distribution vehicle routing problem as one of the core problems in logisticsmanagement, is crucial for improving the efficiency of logistics, and has received thewidespread attention. After decades of research, the problem has been abundant researchresults. But past research seldom consider the goods loading constraints. In fact, during theprocess of actual delivery, due to the three dimensional shape constraints, length, width andheight, and the principle of “First In Late Out”, minimumal bottom support area, and thestability of distribution need to be considered. The optimal resuts can be infeasible withoutconsidering the loading constraints.The paper research the vehicle routing problem with three dimensional loadingconstraints. By descripting and modeling problems, comprehensive utilization of theheuristics and modern heuristic algorithms, the basic vehicle routing problem withthree-dimension loading costrint and several important extend problems are researched. Themain research results are list as follows:1. We present the description and mathematical model of vehicle routing problem withthree dimensional loading constraints. And then, we devised loading algorithms of goods,three-dimension space process algorithms, and customer selection algorithms. Next, wepropose the hybrid tabu search algorithms. At last, we build problem test data sets, andsystematically analyze and dicuss the performance of the algorithm. The results show thathybrid tabu search algorithm can get better solutions comparing to current algorithms onseveral test data.2. We research vehicle routing problem with three dimensions loading constraints and time windows. On the basis of basic vehicle routing problem with three dimension loadingconstraints, the time windows constraint is introduced. Firstly, we present the description andmathematical model. And then, using different time windows selection algorithms, differentheuristic algorithms and tabu seach algorithm, the problem is solved. Fially, we build problemtest data sets, and systematically analyze and dicuss the performance of the algorithm.3. We research time dependent vehicle routing problem with three dimensional loadingconstraints. On the basis of vehicle routing problem with three dimensional loadingconstraints and time windows, we introduce new constraint, dynamic travel time length, anddesign the segemented time function to describle the speed. Firstly, we give the descriptionand mathematical models of the problem. And then, we present heuristic algorithms andintelligent algorithms based on tabu search. Finally, we build problem test data sets, andsystematically analyze and dicuss the performance of the algorithm.4. We research heterogeneous fleet vehicle routing problem with three dimensionalloading constraints. Considering the actual logistics distribution process, the enterprises’distribution teams are usually composed of several vhelcie types, different sizes, differentloads and different deposit costs. Through designing vehicle model selection algorithms, weeffectively solve the heterogeneous fleet vehicle routing problem with three dimensionalloading constraints. Finally, we build problem test data sets, and systematically analyze anddicuss the performance of the algorithm.This paper systematically research several vehicle routing problems with threedimensional loading constraints, integrated using the theories and methods of operationresearch and intelligent optimization. This paper extends the research fields of vehicle routingproblem, enrichs the theoretical system of vehicle routing problem, and provides reference forthe enterprise logistics distribution and vehicle scheduling at the same time.