摘要
蚁群算法能很好地解决车辆路径问题,但算法搜索时间长,易出现停滞现象。通过对蚁群算法的改进和调整,构造出最大—最小蚁群算法,实例验证该算法能更快地收敛到全局最优解。
On the basis of analyzing the disadvantages of ant colony algorithm (AS), max-min ant colony algorithm (MMAS) is proposed to solve VRP. Then an instance of vehicle routing problem (VRP) is put forward and solved to confirm their validity.
出处
《山东交通学院学报》
CAS
2007年第2期19-22,共4页
Journal of Shandong Jiaotong University
关键词
车辆路径
蚁群算法
最大-最小蚁群算法
vehicle routine problem
ant colony algorithm
max-min ant colony algorithm