DocumentCode :
2556402
Title :
Simulated annealing ant colony algorithm for QAP
Author :
Zhu Jingwei ; Rui Ting ; Fang Husheng ; Zhang Jinlin ; Liao Ming
Author_Institution :
Eng. Inst. of Eng. Corps, PLA Univ. of Sci. & Technol., Nanjing, China
fYear :
2012
fDate :
29-31 May 2012
Firstpage :
789
Lastpage :
793
Abstract :
A simulated annealing ant colony algorithm(ASAC) is presented to tackle the quadratic assignment problem (QAP). The simulated annealing method is introduced to the ant colony algorithm. The temperature which declines with the iterations is set in the algorithm. After each round of searching, the solution set got by the colony is treated as the candidate set. Base on the simulated annealing method, the solution in the candidate set is chosen to join the update set with possibility which determined by the temperature. The update set is used to update the trail information matrix. And also the current best solution is used to enhance the tail information. The pheromone trails matrix is reset when the algorithm is in the stagnant state. The computer experiments demonstrate this algorithm has high calculation stability and converging speed.
Keywords :
ant colony optimisation; matrix algebra; quadratic programming; simulated annealing; ASAC; QAP; information matrix; pheromone trails matrix; quadratic assignment problem; simulated annealing ant colony algorithm; temperature; Algorithm design and analysis; Computers; Genetic algorithms; Heuristic algorithms; Simulated annealing; Software algorithms; ant colony algorithm; candidate set; quadratic assignment problem; simulated annealing; update set;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Natural Computation (ICNC), 2012 Eighth International Conference on
Conference_Location :
Chongqing
ISSN :
2157-9555
Print_ISBN :
978-1-4577-2130-4
Type :
conf
DOI :
10.1109/ICNC.2012.6234519
Filename :
6234519
Link To Document :
بازگشت