| 一种求解货物配送问题的改进算法 |
| |
| 引用本文： | 包得海,管会生. 一种求解货物配送问题的改进算法[J]. 湖南师范大学自然科学学报, 2011, 34(5): 12-16 |
| |
| 作者姓名： | 包得海 管会生 |
| |
| 作者单位： | 1. 甘肃民族师范学院计算机与科学系,中国合作,747000
2. 兰州大学信息科学与工程学院,中国兰州,730000 |
| |
| 基金项目： | 甘肃省教育厅科研基金资助项目(1012-06) |
| |
| 摘 要： | 针对货物配送问题,建立问题的数学模型,提出一种基于禁忌搜索的蚁群算法.并结合超市配送问题,对算法进行测试,测试结果表明,该算法具有收敛速度快、不易陷入局部最优、求解精度高的特点,能够有效地解决超市配送问题.
|
| 关 键 词： | 超市配送问题 蚁群算法 车辆路径问题 禁忌搜索 局部搜索 |
An Improved Algorithm of Solving Goods Distribution Problem |
| |
| BAO De-hai,GUAN Hui-sheng. An Improved Algorithm of Solving Goods Distribution Problem[J]. Journal of Natural Science of Hunan Normal University, 2011, 34(5): 12-16 |
| |
| Authors: | BAO De-hai GUAN Hui-sheng |
| |
| Affiliation: | BAO De-hai1,GUAN Hui-sheng2*(1.Department of Computer Science,Gansu Normal University for Nationalities,Hezuo 747000,China,2.School of Information Science and Engineering,Lanzhou University,Lanzhou 730000,China) |
| |
| Abstract: | A mathematical model for Goods Distribution Problem is constructed and an ant colony algorithm with tabu search is put forward.The algorithm is tested in combination with Supermarket Distribution Problem.The experimental results indicate that the algorithm solves Supermarket Distribution Problem effectively with quick convergence,avoid local optimum,high precision solution characteristics. |
| |
| Keywords: | supermarket distribution problem ant colony algorithm VRP tabu search local search |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
