摘要
将多点配送中心选址问题(multi-distribution center location problem,MDLP)映射为扩展K-TSP过程并设计了改进的蚁群算法。为提高算法的求解性能,在蚂蚁的选择规则里加入了代价引导函数,使用2-opt策略优化可行解并优化了信息素的更新方式。仿真算例及算法对比表明,模型和算法可以有效地表达和求解MDLP。
The paper projects the traditional multi-distribution center location problem （MDLP） into an extended KTSP process and develops the improved ant colony algorithm for its solution. To improve the effectiveness of the algorithm, a cost guiding function is added to the rules for ants selection, the feasible solutions are subject to the 2-opt strategy for optimization and the updating mode of the pheromone is also optimized. The result of a simulation study as well as a comparison of the algorithms shows that the model and algorithm formulated here can effectivel represent and solve the MDLP.
出处
《物流技术》
北大核心
2012年第2期116-118,171,共4页
Logistics Technology
