Table of Contents Author Guidelines Submit a Manuscript
Computational Intelligence and Neuroscience
Volume 2016 (2016), Article ID 5803893, 12 pages
http://dx.doi.org/10.1155/2016/5803893
Research Article

A Biogeography-Based Optimization Algorithm Hybridized with Tabu Search for the Quadratic Assignment Problem

1Faculty of Computing, Universiti Teknologi Malaysia (UTM), 81310 Johor Bahru, Johor, Malaysia
2School of Quantitative Sciences, UUM College of Arts and Sciences, Universiti Utara Malaysia, 06010 Sintok, Kedah, Malaysia
3Faculty of Information and Communication Technology, Universiti Teknikal Malaysia Melaka, Hang Tuah Jaya, 76100 Durian Tunggal, Melaka, Malaysia

Received 13 August 2015; Accepted 25 October 2015

Academic Editor: Ezequiel López-Rubio

Copyright © 2016 Wee Loon Lim et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. S. Sahni and T. Gonzalez, “P-complete approximation problems,” Journal of the Association for Computing Machinery, vol. 23, no. 3, pp. 555–565, 1976. View at Publisher · View at Google Scholar · View at Scopus
  2. E. M. Loiola, N. M. M. de Abreu, P. O. Boaventura-Netto, P. Hahn, and T. Querido, “A survey for the quadratic assignment problem,” European Journal of Operational Research, vol. 176, no. 2, pp. 657–690, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  3. J.-C. Wang, “A multistart simulated annealing algorithm for the quadratic assignment problem,” in Proceedings of the 3rd IEEE International Conference on Innovations in Bio-Inspired Computing and Applications (IBICA '12), pp. 19–23, Kaohsiung, Taiwan, September 2012. View at Publisher · View at Google Scholar · View at Scopus
  4. U. Tosun, “On the performance of parallel hybrid algorithms for the solution of the quadratic assignment problem,” Engineering Applications of Artificial Intelligence, vol. 39, pp. 267–278, 2015. View at Publisher · View at Google Scholar · View at Scopus
  5. M. Czapiński, “An effective parallel multistart tabu search for quadratic assignment problem on CUDA platform,” Journal of Parallel and Distributed Computing, vol. 73, no. 11, pp. 1461–1468, 2013. View at Publisher · View at Google Scholar · View at Scopus
  6. A. Misevicius, “An implementation of the iterated tabu search algorithm for the quadratic assignment problem,” OR Spectrum, vol. 34, no. 3, pp. 665–690, 2012. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  7. U. Tosun, T. Dokeroglu, and A. Cosar, “A robust island parallel genetic algorithm for the quadratic assignment problem,” International Journal of Production Research, vol. 51, no. 14, pp. 4117–4133, 2013. View at Publisher · View at Google Scholar · View at Scopus
  8. U. Tosun, “A new recombination operator for the genetic algorithm solution of the quadratic assignment problem,” Procedia Computer Science, vol. 32, pp. 29–36, 2014. View at Publisher · View at Google Scholar
  9. M. Lstibůrek, J. Stejskal, A. Misevicius, J. Korecký, and Y. A. El-Kassaby, “Expansion of the minimum-inbreeding seed orchard design to operational scale,” Tree Genetics and Genomes, vol. 11, no. 1, pp. 1–8, 2015. View at Publisher · View at Google Scholar · View at Scopus
  10. A. S. Ramkumar, S. G. Ponnambalam, and N. Jawahar, “A population-based hybrid ant system for quadratic assignment formulations in facility layout design,” International Journal of Advanced Manufacturing Technology, vol. 44, no. 5-6, pp. 548–558, 2009. View at Publisher · View at Google Scholar · View at Scopus
  11. R. E. Burkard, E. Cela, P. M. Pardalos, and L. Pitsoulis, “The quadratic assignment problem,” in Handbook of Combinatorial Optimization, P. M. Pardalos and D. Z. Du, Eds., pp. 241–338, Kluwer Academic Publishers, 1998. View at Google Scholar
  12. P. C. Gilmore, “Optimal and suboptimal algorithms for the quadratic assignment problem,” Journal of the Society for Industrial and Applied Mathematics, vol. 10, no. 2, pp. 305–313, 1962. View at Google Scholar · View at MathSciNet
  13. T. Mautor and C. Roucairol, “A new exact algorithm for the solution of quadratic assignment problems,” Discrete Applied Mathematics, vol. 55, no. 3, pp. 281–293, 1994. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  14. N. W. Brixius and K. M. Anstreicher, “Solving quadratic assignment problems using convex quadratic programming relaxations,” Optimization Methods and Software, vol. 16, no. 1–4, pp. 49–68, 2001. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  15. P. M. Hahn and J. Krarup, “A hospital facility layout problem finally solved,” Journal of Intelligent Manufacturing, vol. 12, no. 5, pp. 487–496, 2001. View at Publisher · View at Google Scholar · View at Scopus
  16. M. Nystrom, Solving Certain Large Instances of the Quadratic Assignment Problem: Steinberg's Examples, California Institute of Technology, Pasadena, Calif, USA, 1999.
  17. K. Anstreicher, N. Brixius, J.-P. Goux, and J. Linderoth, “Solving large quadratic assignment problems on computational grids,” Mathematical Programming, vol. 91, no. 3, pp. 563–588, 2002. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  18. Z. Drezner, P. M. Hahn, and É. D. Taillard, “Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods,” Annals of Operations Research, vol. 139, pp. 65–94, 2005. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  19. A. Wallace, The Geographical Distribution of Animals (Two Volumes), Adamant Media Corporation, Boston, Mass, USA, 2005.
  20. C. Darwin, On the Origin of Species, Gramercy, New York, NY, USA, 1995.
  21. R. MacArthur and E. Wilson, The Theory of Biogeography, Princeton University Press, Princeton, NJ, USA, 1967.
  22. D. Simon, “Biogeography-based optimization,” IEEE Transactions on Evolutionary Computation, vol. 12, no. 6, pp. 702–713, 2008. View at Publisher · View at Google Scholar · View at Scopus
  23. D. Simon, “A probabilistic analysis of a simplified biogeography-based optimization algorithm,” Evolutionary Computation, vol. 19, no. 2, pp. 167–188, 2011. View at Publisher · View at Google Scholar · View at Scopus
  24. V. Panchal, P. Singh, N. Kaur, and H. Kundra, “Biogeography based satellite image classification,” International Journal of Information Security, vol. 6, no. 2, pp. 269–274, 2009. View at Google Scholar
  25. V. Panchal, H. Kundra, and A. Kaur, “An integrated approach to biogeography based optimization with case based reasoning for retrieving groundwater possibility,” International Journal of Computer Applications, vol. 1, no. 8, pp. 975–8887, 2010. View at Google Scholar
  26. A. Bhattacharya and P. K. Chattopadhyay, “Solving complex economic load dispatch problems using biogeography-based optimization,” Expert Systems with Applications, vol. 37, no. 5, pp. 3605–3615, 2010. View at Publisher · View at Google Scholar · View at Scopus
  27. E. Taillard, “Robust taboo search for the quadratic assignment problem,” Parallel Computing. Theory and Applications, vol. 17, no. 4-5, pp. 443–455, 1991. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  28. R. E. Burkard, E. Cela, S. E. Karisch, and F. Rendl, QAPLIB Home Page, 2004, http://anjos.mgi.polymtl.ca/qaplib/.
  29. T. C. Koopmans and M. Beckmann, “Assignment problems and the location of economic activities,” Econometrica, vol. 25, no. 1, pp. 53–76, 1957. View at Publisher · View at Google Scholar
  30. M. Mussetta and P. Pirinoli, “MmCn-BBO schemes for electromagnetic problem optimization,” in Proceedings of the 7th European Conference on Antennas and Propagation (EuCAP '13), pp. 1058–1059, Gothenburg, Sweden, April 2013. View at Scopus
  31. F. Glover, “Future paths for integer programming and links to artificial intelligence,” Computers & Operations Research, vol. 13, no. 5, pp. 533–549, 1986. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  32. A. Gunawan, K. M. Ng, K. L. Poh, and H. C. Lau, “Hybrid metaheuristics for solving the quadratic assignment problem and the generalized quadratic assignment problem,” in Proceedings of the IEEE International Conference on Automation Science and Engineering (CASE '14), pp. 119–124, Taipei, Taiwan, August 2014. View at Publisher · View at Google Scholar
  33. J. Sun, Q. Zhang, and X. Yao, “Meta-heuristic combining prior online and offline information for the quadratic assignment problem,” IEEE Transactions on Cybernetics, vol. 44, no. 3, pp. 429–444, 2014. View at Publisher · View at Google Scholar · View at Scopus