Research on a Heuristic Algorithm for Path Search of Logistics Distribution Robot
Aiming at the vehicle routing problem with time window and distribution robot,an adaptive large neighborhood search heuristic algorithm(ALNs)is proposed.Firstly,the vehicle routing problem with time window is studied.The synchroniza-tion problem caused by time window constraint and the relationship between two different distribution resources in time problem in scheduling waiting retrieval system are analyzed.On this basis,an improved adaptive large neighborhood search(ALNs)heuris-tic algorithm is proposed.The algorithm destroys and repairs some existing solutions,changes most of the decomposition in each iteration,creates the initial solution,and obtains the optimal solution based on the adaptive mechanism.Experiments show the performance and effectiveness of the algorithm in solving the vehicle routing problem with time window and distribution robot.Fi-nally,the sensitivity analysis of the application of distribution robot is carried out.
NETL
NSTL
万方数据
