Ant Colony Algorithm Based on Simulated Annealing Method

摘要：

To overcome the default of the ant colony algorithm, the simulated annealing method is introduced to the algorithm. By setting the temperature which changes with the iterations, after each turn of tours, the solutions set got by the ants is taken as the candidate set. The update set is got by adding the solutions in the candidate set to the update set with the probability determined by the temperature. The solutions in the candidate set are used to update the trail information. In each turn of updating, the current best solution is also used to enhance the tail information on the current best route. The tail information is reset when the algorithm is in stagnation state. The experiments on computer demonstrate this algorithm has higher stability and convergence speed.

关键词： Ant colony algorithm Simulated annealing method Candidate set Update set

作者: Jingwei Zhu Ting Rui Xinsheng Jiang Juelong Li

作者单位: Engineering Institute of Engineering Corps PLA University of Science & Technology Nanjing 210007, Ch Managing office of Coast Defence Engineering Technolony Beijing 100841,China

会议类型: 国际会议

会议名称: 2010 International Conference on Circuit and Signal Processing(2010年电路与信号处理国际会议 ICCSP 2010)

会议地点: 上海

会议语种:英文

页码: 290-293

在线出版日期: 2010-12-25（万方平台首次上网日期，不代表论文的发表时间）