| 基于混合蚁群算法的物流配送路径问题 |
| |
| 引用本文： | 钟娟,赵彦强,孙富康,刘光年.基于混合蚁群算法的物流配送路径问题[J].合肥工业大学学报(自然科学版),2009,32(5). |
| |
| 作者姓名： | 钟娟 赵彦强 孙富康 刘光年 |
| |
| 作者单位： | 1. 安徽建筑工业学院,电子与信息工程学院,安徽,合肥,230601
2. 合肥水泥研究设计院,安徽,合肥,230051 |
| |
| 基金项目： | 安徽省教育厅自然科学基金，安徽省教研资助项目 |
| |
| 摘 要： | 蚁群算法在解决旅行商等著名问题时得到了卓有成效的应用,但解决大规模问题时,其收敛速度较慢且耗时较长;同样,郭涛算法在解决复杂优化问题时取得了良好效果,但会产生大量无为的冗余迭代,求解效率低;文章汲取蚁群算法和郭涛算法的优点,提出混合蚁群算法,建立混合蚁群算法数学模型,得到时间效率和求解效率都比较好的一种新的启发式算法.
|
| 关 键 词： | 蚁群算法 旅行商问题 郭涛算法 混合蚁群算法 物流配送 |
Research on the routing problem in logistics distribution based on mixed ant colony algorithm |
| |
| ZHONG Juan,ZHAO Yan-qiang,SUN Fu-qiang,LIU Guang-nian.Research on the routing problem in logistics distribution based on mixed ant colony algorithm[J].Journal of Hefei University of Technology(Natural Science),2009,32(5). |
| |
| Authors: | ZHONG Juan ZHAO Yan-qiang SUN Fu-qiang LIU Guang-nian |
| |
| Institution: | 1.School of Electronics and Information Engineering;Anhui Institute of Architecture & Industry;Hefei 230601;China;2.Hefei Cement Research and Design Institute;Hefei 230051;China |
| |
| Abstract: | The ant colony arithmetic has been successfully applied to solving the famous traveling salesman problem,but when it confronts large-scale problems,its convergence velocity becomes relatively slow and its computation is time-consuming.Similarly,Guo's algorithm has produced good results when the complex optimization problems are solved,but a great number of useless redundancy iterations come out and the solution efficiency is low.This paper makes use of merits of both the ant colony arithmetic and Guo's algo... |
| |
| Keywords: | ant colony algorithm traveling salesman problem Guo's algorithm mixed ant colony algorithm logistics distribution |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
