| 多点配送中心选址及求解蚁群算法 |
| |
| 引用本文： | 郭毅,朱伟,徐克林.多点配送中心选址及求解蚁群算法[J].物流技术,2012(3):116-118,171. |
| |
| 作者姓名： | 郭毅 朱伟 徐克林 |
| |
| 作者单位： | 同济大学机械学院 |
| |
| 摘 要： | 将多点配送中心选址问题(multi-distribution center location problem,MDLP)映射为扩展K-TSP过程并设计了改进的蚁群算法。为提高算法的求解性能,在蚂蚁的选择规则里加入了代价引导函数,使用2-opt策略优化可行解并优化了信息素的更新方式。仿真算例及算法对比表明,模型和算法可以有效地表达和求解MDLP。
|
| 关 键 词： | 多配送中心选址问题 扩展K-TSP 共享禁忌表 2-opt 信息素更新 |
Location Problem of Multiple Distribution Centers and Its Ant Colony Algorithm Based Solution |
| |
| GUO Yi,ZHU Wei,XU Ke-lin.Location Problem of Multiple Distribution Centers and Its Ant Colony Algorithm Based Solution[J].Logistics Technology,2012(3):116-118,171. |
| |
| Authors: | GUO Yi ZHU Wei XU Ke-lin |
| |
| Institution: | (School of Mechanics,Tongji University,Shanghai 200092,China) |
| |
| Abstract: | The paper projects the traditional multi-distribution center location problem(MDLP) into an extended K-TSP 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. |
| |
| Keywords: | multiple distribution center location problem extended K-TSP sharing tabu 2-opt pheromone update |
| 本文献已被 CNKI 等数据库收录！ |
|
