Research And Application Of Vehicle Routing Optimization Problem With Loading Constraints

With the improvement of people’s purchasing power in recent years, the demand of the logistics industry is also growing. Logistics enterprises attach great importance to how best to reduce the cost, and how to provide customers with more efficient and quality service. In the process of the whole logistics distribution, the vehicle routing problem and the three-dimensional packing problem are the most important parts. Because the two problems are related to each other, so in this paper, the two problems are considered together, through the optimization of vehicle routing problem, combined with the three-dimensional packing problem, thereby reducing the distribution process of artificial and vehicle costs, improve the competitiveness of logistics enterprises in the industry.Based on an advanced SFLA combine heuristic packing algorithm for vehicle routing problem and three-dimensional packing problems are solved jointly developed distribution support system. The main work of this paper is the following three aspects.(1)By considering the distribution of the operation process, problems of distribution process will be described, the establishment of including cargo weight, volume, fragility, loading sequence and other constraints, and vehicles under maximum load conditions, with the shortest possible path for the purpose of distribution model.(2)Using improved SFLA and heuristic packing algorithm to solve the distribution model. Implement the two algorithms using java language. It is proved that the superiority of the improved shuffled frog leaping algorithm, and combined with the heuristic packing algorithm for the realization of the distribution process.(3)Through the demand analysis, complete the design of the database, the use of J2 EE related technologies to achieve the complete distribution support system, and by visually realize the cargo loading results show.