集配一体化需求背景下选址路径集成问题算法

Algorithm of site selection path integration problemunder the background of simultaneous distribution and collection

为做好集配一体化背景下物流网络选址-路径规划设计,用大规模邻域搜索算法的破坏、重组策略代替传统混合自适应遗传算法中的交叉、变异过程,实现算法的优化设计.通过模拟算例分析可知,优化后的算法能够有效克服传统算法在运算过程中出现的早熟及稳定性差等问题,在一定程度上提升获取更优解的概率,提高客户满意度.利用已知标杆数据对算法进行有效性检验.计算结果表明:优化后的算法各项指标表现良好,对于部分数据的计算结果优于其他3个已有算法,与已知最优解基本保持一致,进一步验证了优化算法的科学性和有效性.

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.