Two-Stage Vehicle Routing Optimization for Logistics Distribution Based on HSA-HGBS Algorithm

Aiming at the problems of complex urban road network, low efficiency of logistics distribution, and the difficulty of large-scale logistics distribution area division and routing planning, this paper proposes a two-stage logistics distribution vehicle routing optimization (VRP) method based on the establishment of a multi-factor complex road network constrained logistics distribution mathematical model. Considering the complex traffic elements and road network topological structure in logistics and distribution, in the first stage, a heuristic simulated annealing (HSA) distribution region partitioning algorithm is proposed with the objective of balancing vehicle task load to divide the urban logistics distribution network under complex road networks, so as to reduce the region scale and path search cost. In the second stage of route decision making, aiming at minimizing the total cost of logistics distribution, combining the VRP problem with complex road network conditions, a heuristic path search method combined with complex road network model constraints is proposed. In this stage, a hybrid genetic beam search(HGBS) algorithm is used to plan the path nodes, reduce the randomness of the model in the initial search for paths by heuristic genetic algorithms, then combine with Beam Search methods to reduce the space and time used for the search, and use optimization algorithms to improve the accuracy of independent sub-region routing optimization and the rationality of overall physical distribution route selection. Finally, the proposed method is validated in this paper with two practical cases. The experimental results show that the two-stage decision-making algorithm proposed in this paper has certain advantages in partitioning schemes, minimizing total cost and iteration times. Through comparison, the optimization ability of this method for logistics distribution networks is proved.

Abstract licence: CC BY-NC-ND

40 more references, whose wording the paper’s licence keeps private.

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.