Algorithm of site selection path integration problem under the background of simultaneous distribution and collection
In order to do a good job in the site selection-path planning and design of logistics network under the background of integration of simultaneous distribution and collection,the crossover and mutation processes in the traditional hybrid adaptive genetic algorithm are replaced by the destruction and recombination strategies of the large-scale neighborhood search algorithm,and the optimization design of the algorithm is realized.After analyzing the simulation example,it can be seen that the optimized algorithm can effectively overcome the problems of early maturity and poor stability of the traditional algorithm in the calculation process,improve the probability of obtaining a better solution to a certain extent,and improve customer satisfaction.The effectiveness of the algorithm is tested by using the known benchmark data,and the calculation results show that the indicators of the optimized algorithm perform well,and the calculation results of some data are better than the other three existing algorithms,which is basically consistent with the known optimal solution,and this further verifies the scientificity and effectiveness of the optimization algorithm in this paper.
set distribution integrationneighborhood searchlocation routing problem
NETL
NSTL
万方数据
