Grouping Planning of Cross Transfer Paths in Intra City Logistics Based on Improved Cross Entropy Algorithm
In order to achieve the optimal intra city logistics distribution path and combination method,and to address the prob-lem of redundant objective functions and constraint conditions,as well as the tendency of the shortest delivery distance to fall into local optima solution,an intra city logistics cross transfer path grouping planning method based on an improved cross en-tropy algorithm is designed.This paper constructs a road congestion state function,monitors and updates the state function in real time,describes the congestion degree of each path in the road network,with the shortest delivery distance as the goal,in-troduces the cross entropy algorithm,considers the problem of transfer path transformation,adjusts the probability density function parameters based on the optimal solution in the current elite solution set,applies particle swarm optimization algorithm to improve the cross entropy algorithm,obtains and updates the optimal delivery path in real time.The experimental results show that the proposed method has fewer transfer times,lower departure times,turning times,and total path length values for cross transportation path planning in the same city logistics.The overall application effect is better.
intra city logistics cross transferimproved cross entropy algorithmobjective functionshortest delivery distancepath planning
万方数据
维普
