Optimization of the quadratic assignment problem using an ant colony algorithm

Applied Mathematics and Computation

Volumn 183, Issue 1, 2006, Pages 427-435

  Demirel, Nihan Çetin ^a   Toksari, M Duran ^b  

^a YILDIZ TECHNICAL UNIVERSITY   (Turkey)

^b ERCIYES UNIVERSITY   (Turkey)

Author keywords

Ant colony optimization; Combinatorial optimization; Metaheuristics; Quadratic assignment problem; Simulated annealing

Indexed keywords

ALGORITHMS; BEHAVIORAL RESEARCH; HEURISTIC METHODS; METADATA; PROBLEM SOLVING; SIMULATED ANNEALING;

ANT COLONY OPTIMIZATION; COMBINATORIAL OPTIMIZATION; METAHEURISTICS; QUADRATIC ASSIGNMENT PROBLEM;

MULTI AGENT SYSTEMS;

EID: 33845405527     PISSN: 00963003     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.amc.2006.05.073     Document Type: Article

References (18)

1. M. Dorigo, Optimization, Learning and Natural Algorithms, Ph.D. Thesis, Politecnico di Milano, Italy, 1992.
2. Dorigo M., Maniezzo V., and Colorni A. The ant system: optimization by a colony of cooperating agents. IEEE Transactions on Systems, Mans, and Cybernetics 1 26 (1996)
3. L. Gambardella, E. Taillard, M. Dorigo, Ant colonies for the QAP, Technical Report 97-4, IDSIA, Lugano, Switzerland, 1997.
4. Colorni A., Dorigo M., Maniezzo V., and Trubian M. Ant system for job-shop scheduling. JORBEL-Belgian Journal of Operations Research Statistics and Computer Science 34 1 (1994) 39-53
5. B. Bullnheimer, R.F. Hartl, C. Strauss, Applying the ant system to the vehicle routing problem, in: Second Metaheuristics International Conference, MIC'97, Sophia-Antipolis, France, 1997.
6. Schoonderwoerd R., Holland O., Bruten J., and Rothkrantz L. Ant-based load balancing in telecommunications networks. Adaptive Behavior 5 2 (1997) 169-207
7. Koopmans T.C., and Beckmann M.J. Assignment problems and the location of economics activities. Econometrica 25 (1957) 53-76
8. Shani S., and Gonzalez T. P-complete approximation problems. Journal of the ACM 23 3 (1976) 555-565
9. Queyranne M. Performance ratio of polynomial heuristics for triangle inequality quadratic assignment problems. Operations Research Letters 4 (1986) 231-234
10. Stutzle T., and Dorigo M. AGO algorithms for the quadratic assignment problem. New Ideas in Optimization (1999), McGraw-Hill
11. Press W.H., Teukolsky S.A., Vetterling W.T., and Flannery B.P. Numerical Recipes in C. second ed. (1992), Cambridge University Press. 0-521-43108-5
12. Lundy M., and Mees A. Convergence of an annealing algorithm. Mathematical Programming 34 (1986) 111-124
13. Battiti R., and Tecchiolli G. The reactive tabu search. ORSA Journal on Computing 6 (1994) 126-140
14. Taillard E. Robust tabu search for the quadratic assignment problem. Parallel Computing 17 (1991) 443-455
15. Fleurent C., and Ferland J.A. Genetic hybrids for the quadratic assignment problem. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 16 (1994) 173-188
16. Connolly D.T. An improved annealing scheme for the QAP. European Journal of Operational Research 46 (1990) 93-100
17. Burkard R.E., Karisch S., and Rendl F. Qaplib: a quadratic assignment problem library. European Journal of Operational Research 55 (1991) 115-119
18. Liggett R.S. The quadratic assignment problem: an experimental evaluation of solution strategies. Management Science 27 (1981) 442-458