The Quadratic Assignment Problem (QAP) is one of combinatorial optimization problems which devote some facilities to some locations. The aim of this problem is assignment of each facility to a location which minimizes total cost. Because the QAP is NP-hard, so it couldn’t be solved by exact methods. In recent years, meta-heuristic algorithms are used in solving NP-hard optimization problems increasingly. In this article Water Cycle Optimization Algorithms (WCO) is used to solve QAP. The implementation of proposed algorithms on standard test functions and also its result comparison with other meta-heuristics algorithms express algorithm`s desirable quality and its prominence to other meta-heuristics algorithms.
| Published in |
International Journal of Intelligent Information Systems (Volume 3, Issue 6-1)
This article belongs to the Special Issue Research and Practices in Information Systems and Technologies in Developing Countries |
| DOI | 10.11648/j.ijiis.s.2014030601.24 |
| Page(s) | 75-79 |
| Creative Commons |
This is an Open Access article, distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution and reproduction in any medium or format, provided the original work is properly cited. |
| Copyright |
Copyright © The Author(s), 2014. Published by Science Publishing Group |
Quadratic Assignment Problem, Combinatorial Optimization Problems, Water Cycle Optimization Algorithms, Meta-Heuristics Algorithms
| [1] | E.Loiola, N.de Abreo, P.boaventura-nett, P.Hahn, T.Querido, “Asurvay for the Quadratic assignment problem, ” Eur J Oper Res 176:657-690, 2007. |
| [2] | RE.Burkard, T.Bonniger, “A hurestic for quadratic boolean programs with applications to quadratic assignment problems, ” European J, Oper.res, 13:374-86, 1983. |
| [3] | Li.Yong, M.Panos Pardalos, and G.C.Mauricio Resende, “A Greedy Randomized Adaptive Search Procedure for the Quadratic Assignment Problem, ” DIMACS Series in Discrete Mathematics and Theoretical Computer Science, May 20-21, 1993. |
| [4] | Ghandeshtani, Mollai, Seyedkashi, and Neshati, “New Simulated Annealing Algorithm for Quadratic Assignment Problem, ” The Fourth Internatinal Conference on Advanced Engineering Computing and Applications in Sciences, 2010. |
| [5] | J.Skorin-Kapov, “Tabu search applied to the quadratic assignment problem, ” ORSA J. Comput. 1990;2:33-45. R.K. Ahuja et al. Computers & Operations Research 27,917-934, 2000. |
| [6] | E.Taillard, Robust, “tabu search for the quadratic assignment problem, ” Parallel Comput,17,443-55, 1991. |
| [7] | C.Fleurent, JA.Ferland, “Genetic hybrids for the quadratic assignment problem, ” DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 16, Providence, RI: American Mathematical Society, pp, 173-87, 1994. |
| [8] | T.Stutzle, M.Dorigo, “ACO algorithms for the quadratic assignment problem, ” In: Corne, D., Dorigo, M., Glover, F. (Eds.), New Ideas for Optimization. McGraw-Hill, pp, 33–50, 1999. |
| [9] | L.Gambardella, E.Taillard, M.Dorigo, “Ant Colonies for the QAP, ” Tech. Report IDSIA,4-97, IDSIA, Lugano, Switzerland, 1997. |
| [10] | Z.W. Geem, J.-H. Kim, G.V. Loganathan, “A new heuristic optimization algorithm: harmony search,” Simulation,76 (2) 60–68, 2001. |
| [11] | A.Safari Mamaghani,and M.Reza Meybodi, “An Application of Imperialist Competitive Algorithm to Solve the Quadratic Assignment Problem,” 6th international conference on internet technology and secured translation, 11-14, 2011. |
| [12] | M.Mirzazadeh, Gh.Hasan Shirdel AND B.Masoumi,“A Honey Bee Algorithm to Solve Quadratic Assignment Problem,” Journal of Optimization in Industrial Engineering (2011) 27-36. |
| [13] | R. Rajabioun, “Cuckoo Optimization Algorithm, ” In: Applied Soft Computing journal, vol. 11, pp, 5508-5518, 2011. |
| [14] | E.M.Loiola, N.M.Maia de Abreu, P.O.Boaventura-Netto, P.Hahn and T.Querido, “A survey for the quadratic assignment problem,” European Journal of Operational Research, 176, 657–690, 2007. |
| [15] | T. C. Koopmans and M. J. Beckmann, “Assignment problems and the location of economic activities,” Econometrica, 25, 53-76, 1957. |
| [16] | M.Hosseini, M.Sadri, “ A new evolutionary algorithm based on the water cycle in nature,” 4th Conference on Electrical and Electronics Engineering, University GONABAD,7-9 August 2001. |
| [17] | RE.Burkard, SE.Karisch, F.Rendl. “QAPLIB - A quadratic assignment program library,” J.Global Optim.;10:391-403,1997. |
APA Style
Maryam Parhizgar, Farhad Mortezapour Shiri. (2014). Solving Quadratic Assignment Problem Using Water Cycle Optimization Algorithm. International Journal of Intelligent Information Systems, 3(6-1), 75-79. https://doi.org/10.11648/j.ijiis.s.2014030601.24
ACS Style
Maryam Parhizgar; Farhad Mortezapour Shiri. Solving Quadratic Assignment Problem Using Water Cycle Optimization Algorithm. Int. J. Intell. Inf. Syst. 2014, 3(6-1), 75-79. doi: 10.11648/j.ijiis.s.2014030601.24
AMA Style
Maryam Parhizgar, Farhad Mortezapour Shiri. Solving Quadratic Assignment Problem Using Water Cycle Optimization Algorithm. Int J Intell Inf Syst. 2014;3(6-1):75-79. doi: 10.11648/j.ijiis.s.2014030601.24
Share This Article
Twitter
Linked In
Facebook
Copy
Download@article{10.11648/j.ijiis.s.2014030601.24,
author = {Maryam Parhizgar and Farhad Mortezapour Shiri},
title = {Solving Quadratic Assignment Problem Using Water Cycle Optimization Algorithm},
journal = {International Journal of Intelligent Information Systems},
volume = {3},
number = {6-1},
pages = {75-79},
doi = {10.11648/j.ijiis.s.2014030601.24},
url = {https://doi.org/10.11648/j.ijiis.s.2014030601.24},
eprint = {https://article.sciencepublishinggroup.com/pdf/10.11648.j.ijiis.s.2014030601.24},
abstract = {The Quadratic Assignment Problem (QAP) is one of combinatorial optimization problems which devote some facilities to some locations. The aim of this problem is assignment of each facility to a location which minimizes total cost. Because the QAP is NP-hard, so it couldn’t be solved by exact methods. In recent years, meta-heuristic algorithms are used in solving NP-hard optimization problems increasingly. In this article Water Cycle Optimization Algorithms (WCO) is used to solve QAP. The implementation of proposed algorithms on standard test functions and also its result comparison with other meta-heuristics algorithms express algorithm`s desirable quality and its prominence to other meta-heuristics algorithms.},
year = {2014}
}
TY - JOUR T1 - Solving Quadratic Assignment Problem Using Water Cycle Optimization Algorithm AU - Maryam Parhizgar AU - Farhad Mortezapour Shiri Y1 - 2014/11/03 PY - 2014 N1 - https://doi.org/10.11648/j.ijiis.s.2014030601.24 DO - 10.11648/j.ijiis.s.2014030601.24 T2 - International Journal of Intelligent Information Systems JF - International Journal of Intelligent Information Systems JO - International Journal of Intelligent Information Systems SP - 75 EP - 79 PB - Science Publishing Group SN - 2328-7683 UR - https://doi.org/10.11648/j.ijiis.s.2014030601.24 AB - The Quadratic Assignment Problem (QAP) is one of combinatorial optimization problems which devote some facilities to some locations. The aim of this problem is assignment of each facility to a location which minimizes total cost. Because the QAP is NP-hard, so it couldn’t be solved by exact methods. In recent years, meta-heuristic algorithms are used in solving NP-hard optimization problems increasingly. In this article Water Cycle Optimization Algorithms (WCO) is used to solve QAP. The implementation of proposed algorithms on standard test functions and also its result comparison with other meta-heuristics algorithms express algorithm`s desirable quality and its prominence to other meta-heuristics algorithms. VL - 3 IS - 6-1 ER -
Email: