摘要
介绍了一种基于模拟退火策略的最大-最小蚂蚁系统。根据模拟退火策略来决定使用迭代最优信息素更新规则或是至今最优信息素更新规则。设计出一种随机扰动策略,有效地避免了算法陷入停滞状态。将此算法应用在旅行商问题上,实验结果证明了该算法的有效性。
A max-min ant system based on simulated annealing is presented.According to simulated annealing strategy to decide either the iteration-best ant or the hitherto-best ant to update pheromones.A random perturbation strategy is designed to prevent search from being in stagnation behavior.The optimization computing of some examples on traveling salesman problem is made to show that it is useful and simple.
出处
《湖北汽车工业学院学报》
2007年第3期29-31,57,共4页
Journal of Hubei University Of Automotive Technology
基金
湖北省教育厅科学技术研究项目(B200623002)
关键词
最大-最小蚂蚁系统
模拟退火
随机扰动
旅行商问题
max-min ant system
simulated annealing
random perturbation
traveling salesman problem
