Simulated annealing ant colony algorithm based on backfire method for QAP

Authors:
Zhu Jingwei;Rui Ting;Liao Ming;Zhang Jinlin
Affiliations:
PLA University of Science & Technology, Nanjing;PLA University of Science & Technology, Nanjing;PLA University of Science & Technology, Nanjing;PLA University of Science & Technology, Nanjing
Venue:
Proceedings of the 4th International Conference on Internet Multimedia Computing and Service
Year:
2012

Citing 5
Cited 0

MAX-MIN Ant system

Future Generation Computer Systems
The Ant System Applied to the Quadratic Assignment Problem

IEEE Transactions on Knowledge and Data Engineering
Exact and Approximate Nondeterministic Tree-Search Procedures for the Quadratic Assignment Problem

INFORMS Journal on Computing
Ant Colony Optimization

Ant Colony Optimization
Ant system: optimization by a colony of cooperating agents

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

Quantified Score

Hi-index	0.00

Visualization

Abstract

A simulated annealing ant colony algorithm based on backfire method(BASAC) is presented to tackle the quadratic assignment problem (QAP). The simulated annealing algorithm is combined with the ant colony algorithm. The backfire method which has a small temperature attenuation coefficient is used in the temperature control process. 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.