摘要
针对货物配送问题,建立问题的数学模型,提出一种基于禁忌搜索的蚁群算法.并结合超市配送问题,对算法进行测试,测试结果表明,该算法具有收敛速度快、不易陷入局部最优、求解精度高的特点,能够有效地解决超市配送问题.
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.
出处
《湖南师范大学自然科学学报》
CAS
北大核心
2011年第5期12-16,共5页
Journal of Natural Science of Hunan Normal University
基金
甘肃省教育厅科研基金资助项目(1012-06)