An application of Imperialist competitive algorithm to solve the quadratic assignment problem

2011 International Conference for Internet Technology and Secured Transactions, ICITST 2011

Volumn , Issue , 2011, Pages 562-565

  Mamaghani, Ali Safari ^a   Meybodi, Mohammad Reza ^b  

^a ISLAMIC AZAD UNIVERSITY   (Iran)

^b AMIRKABIR UNIVERSITY OF TECHNOLOGY   (Iran)

Author keywords

Imperialistic Competitive Algorithm; meta heuristic algorithms; NP Complete problem; Quadratic Assignment Problem

Indexed keywords

COMBINATORIAL OPTIMIZATION PROBLEMS; COMPETITIVE ALGORITHMS; GLOBAL SEARCH; META HEURISTIC ALGORITHM; METAHEURISTIC; NP COMPLETE PROBLEMS; OPTIMIZATION PROBLEMS; QUADRATIC ASSIGNMENT PROBLEMS;

COMBINATORIAL OPTIMIZATION; HEURISTIC ALGORITHMS; INTERNET; SIMULATED ANNEALING;

COMPUTATIONAL COMPLEXITY;

EID: 84857493576     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (24)

1. R.K. Ahuja, J.B. Orlin, and A. Tiwari," A greedy genetic algorithm for the quadratic assignment problem ", Computers and Operations Research 27, 917-934. 2000. (Pubitemid 30334510)
2. Christo"des N, Benavent E. An exact algorithm for the quadratic assignment problem. Oper. Res. 1989;37:760-8.
3. Bazara MS, Sherali MD. Benders' partitioning scheme applied to a new formulation of the quadratic assignment problem. Naval Res. Logist. Quart. 1980;27:29-41.
4. Lawler EL. The quadratic assignment problem. Manag. Sci. 1963;9:586-99.
5. Pardalos PM, Crouse J. A parallel algorithm for the quadratic assignment problem. Proceedings of the Supercomputing 1989 Conference, ACM Press. New York, 1989, pp. 351-60.
6. Armour GC, Bu!a ES. Heuristic algorithm and simulation approach to relative location of facilities. Manag. Sci.1963;9:294 -309.
7. Bula ES, Armour GC, Vollmann TE. Allocating facilities with CRAFT. Harvard Business Rev. 1962;42:136-58.
8. West DH. Algorithm 608: approximate solution of the quadratic assignment problem.ACMTrans. Math. Software1983;9:461-6.
9. Burkard RE, Bonniger T. A heuristic for quadratic boolean programs with applications to quadratic assignment problems. European J. Oper. Res. 1983;13:374-86.
10. Li T, Pardalos PM, Resende MGC. A greedy randomized adaptive search procedure for the quadratic assignment problem. In: Pardalos PM, Wolkowicz H (Eds.), Quadratic Assignment and Related Problems. DIMACS Series in Discrete Mathematics and Theoretical Computer Science. Providence. RI: Americal Mathematical Society, 1994, pp. 237-261.
11. Wilhelm MR, Ward TL. Solving quadratic assignment problems by simulated annealing. IEEE Trans.1987;19:107-19.
12. Skorin-Kapov J. Tabu search applied to the quadratic assignment problem. ORSA J. Comput. 1990;2:33-45.
13. R.K. Ahuja et al. Computers & Operations Research 27 (2000) 917-934.
14. Taillard E. Robust tabu search for the quadratic assignment problem. Parallel Comput. 1991;17:443-55. (Pubitemid 21695811)
15. Fleurent C, Ferland JA. Genetic hybrids for the quadratic assignment problem. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 16, Providence. RI: American Mathematical Society, 1994, pp. 173-87.
16. Resende MGC, Pardalos PM, Li Y. Fortran subroutines for approximate solution of dense quadratic assignment problems using GRASP. ACM Trans. Math. Software 1994;22:104-18. (Pubitemid 126417378)
17. Stutzle, T., Dorigo, M., 1999. ACO algorithms for the quadratic assignment problem. In: Corne, D., Dorigo, M., Glover, F. (Eds.), New Ideas for Optimization. McGraw-Hill, pp. 33-50.
18. Gambardella, L., Taillard, E., Dorigo, M., 1997. Ant Colonies for the QAP, Tech. Report IDSIA-4-97, IDSIA, Lugano, Switzerland.
19. James, T., Rego, C., Glover, F., 2005. Sequential and parallel pathrelinking algorithms for the quadratic assignment problem. IEEE Intelligent Systems 20 (4), 58-65. (Pubitemid 41259887)
20. Oliveira, C.A., Pardalos, P.M., Resende, M.G.C., 2004. GRASP with pathrelinking for the quadratic assignment problem, Efficient and Experimental Algorithms. In: Ribeiro, C.C., Martins, S.L. (Eds.), . In: Lecture Notes in Computer Science, vol. 3059. Springer-Verlag, pp. 356-368.
21. Tseng, L., Rego, C., Glover, F.,2009. A cooperative parallel tabu search algorithm for the quadratic assignment problem. European Journal of Operational Research 195, 810-826.
22. James, T., Liang, S., 2005. A hybrid metaheuristic for the quadratic assignment problem. Computational Optimization and Applications 34, 85-113.
23. Atashpaz-Gargari, E., Lucas, C., 2007. "Imperialist Competitive Algorithm: An algorithm for optimization inspired by imperialistic competition". IEEE Congress on Evolutionary Computation, pp.4661-4667.
24. Burkard RE, Karisch SE, Rendl F. QAPLIB - A quadratic assignment program library. J. Global Optim.1997;10:391-403. (Pubitemid 127502198)