Table of Contents Author Guidelines Submit a Manuscript
Complexity
Volume 2017, Article ID 8404231, 19 pages
https://doi.org/10.1155/2017/8404231
Review Article

Putting Continuous Metaheuristics to Work in Binary Search Spaces

1Pontificia Universidad Católica de Valparaíso, 2362807 Valparaíso, Chile
2Universidad de Valparaíso, 2361864 Valparaíso, Chile
3Centro de Investigación y Desarrollo Telefónica, 7500961 Santiago, Chile
4Universidad Técnica Federico Santa María, 2390123 Valparaíso, Chile
5Escuela de Ingeniería Industrial, Universidad Diego Portales, 8370109 Santiago, Chile

Correspondence should be addressed to José García; moc.acinofelet@aicrag.oinotnaesoj

Received 24 January 2017; Revised 30 March 2017; Accepted 9 April 2017; Published 11 May 2017

Academic Editor: Jia Hao

Copyright © 2017 Broderick Crawford 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. A. Abshouri, M. Meybodi, and A. Bakhtiary, “New firefly algorithm based on multi swarm learning automata in dynamic environments,” in Proceedings of IEEE, vol. 13, pp. 989–993, 2011.
  2. S. Kazemzadeh Azad, “Optimum design of structures using an improved firefly algorithm,” Iran University of Science & Technology, vol. 1, no. 2, pp. 327–340, 2011. View at Google Scholar
  3. T. Apostolopoulos and A. Vlachos, “Application of the firefly algorithm for solving the economic emissions load dispatch problem,” International Journal of Combinatorics, vol. 2011:999, 2010. View at Google Scholar
  4. J. C. Bansal and K. Deep, “Optimization of directional overcurrent relay times by particle swarm optimization,” in Proceedings of the 2008 IEEE Swarm Intelligence Symposium (SIS '08), pp. 1–7, St. Louis, Mo, USA, September 2008.
  5. O. Bénichou, C. Loverdo, M. Moreau, and R. Voituriez, “Two-dimensional intermittent search processes: an alternative to lévy flight strategies,” Physical Review E, vol. 74, no. 2, Article ID 020102, 2006. View at Google Scholar
  6. S. Nesmachnow, “An overview of metaheuristics: accurate and efficient methods for optimisation,” International Journal of Metaheuristics, vol. 3, no. 4, pp. 320–347, 2014. View at Publisher · View at Google Scholar
  7. E. L. Lawler, Combinatorial Optimization: Networks and Matroids, Courier Corporation, 2001.
  8. M. Grotschel and L. Lovasz, “Combinatorial optimization,” Handbook of Combinatorics, vol. 2, no. 168, pp. 1541–1597, 1995. View at Google Scholar
  9. E. Talbi, Metaheuristics - From Design to Implementation, Wiley, 2009.
  10. R. L. Graham, Handbook of Combinatorics, vol. 1, Elsevier, 1995.
  11. G. L. Nemhauser and L. A. Wolsey, Integer Programming and Combinatorial Optimization, Wiley, 1992.
  12. G. L. Nemhauser, M. W. P. Savelsbergh, and G. S. Sigismondi, “Constraint classification for mixed integer programming formulations,” Coal Bulletin, vol. 20, pp. 8–12, 1988. View at Google Scholar
  13. F. Neumann and C. Witt, “Bioinspired computation in combinatorial optimization: algorithms and their computational complexity,” in Proceedings of the 15th Annual Conference on Genetic and Evolutionary Computation (GECCO '13), pp. 567–590, The Netherlands, Companion Material Proceedings, July 6-10, 2013. View at Publisher · View at Google Scholar · View at Scopus
  14. C. Blum and A. Roli, “Metaheuristics in combinatorial optimi zation: overview and conceptual comparison,” ACM Computing Surveys, vol. 35, no. 3, pp. 268–308, 2003. View at Publisher · View at Google Scholar · View at Scopus
  15. F. Glover and G. Kochenberger, “The ant colony optimization metaheuristic: algorithms, applications, and advances,” Handbook of Metaheuristics, pp. 250–285, 2003. View at Google Scholar
  16. J. Kennedy, “Particle swarm optimization,” in Encyclopedia of machine learning, pp. 760–766, Springer, 2011. View at Google Scholar
  17. S. Mirjalili and A. S. Sadiq, “Magnetic Optimization Algorithm for training Multi Layer Perceptron,” in Proceedings of the IEEE 3rd International Conference on Communication Software and Networks (ICCSN '11), pp. 42–46, May 2011. View at Publisher · View at Google Scholar · View at Scopus
  18. X.-S. Yang and S. Deb, “Cuckoo search via lévy flights,” in Proceedings of the Nature & Biologically Inspired Computing (NaBIC '09) World Congress, pp. 210–214, IEEE, 2009.
  19. X. Yang, “Firefly algorithm, stochastic test functions and design optimization,” International Journal of Bio-Inspired Computation, vol. 2, no. 2, pp. 78–84, 2010. View at Publisher · View at Google Scholar · View at Scopus
  20. H. Shah-Hosseini, “Principal components analysis by the galaxy-based search algorithm: a novel metaheuristic for continuous optimisation,” International Journal of Computational Science and Engineering, vol. 6, no. 1-2, pp. 132–140, 2011. View at Publisher · View at Google Scholar · View at Scopus
  21. Y. Shi, “Brain storm optimization algorithm,” in Proceedings of the International Conference in Swarm Intelligence, pp. 303–309, Springer, 2011.
  22. H. Shareef, A. A. Ibrahim, and A. H. Mutlag, “Lightning search algorithm,” Applied Soft Computing Journal, vol. 36, pp. 315–333, 2015. View at Publisher · View at Google Scholar · View at Scopus
  23. S. Mirjalili, “Moth-flame optimization algorithm: a novel nature-inspired heuristic paradigm,” Knowledge-Based Systems, vol. 89, pp. 228–249, 2015. View at Publisher · View at Google Scholar · View at Scopus
  24. S. Mirjalili, “SCA: A Sine Cosine Algorithm for solving optimization problems,” Knowledge-Based Systems, 2015. View at Publisher · View at Google Scholar · View at Scopus
  25. A. Hatamlou, “Black hole: a new heuristic optimization approach for data clustering,” Information Sciences, vol. 222, pp. 175–184, 2013. View at Publisher · View at Google Scholar · View at MathSciNet
  26. Z. W. Geem, J. H. Kim, and G. V. Loganathan, “A new heuristic optimization algorithm: harmony search,” Simulation, vol. 76, no. 2, pp. 60–68, 2001. View at Publisher · View at Google Scholar · View at Scopus
  27. R. Storn and K. Price, “Differential evolution—a simple and efficient heuristic for global optimization over continuous spaces,” Journal of Global Optimization, vol. 11, no. 4, pp. 341–359, 1997. View at Publisher · View at Google Scholar · View at MathSciNet
  28. T. Gong and A. L. Tuson, “Differential evolution for binary encoding,” in Soft Computing in Industrial Applications, pp. 251–262, Springer, 2007. View at Google Scholar
  29. W. Zhifeng, H. Houkuan, and Z. Xiang, “A binary-encoding differential evolution algorithm for agent coalition,” Journal of Computer Research and Development, vol. 5, no. 019, 2008. View at Google Scholar
  30. H.-Y. Cai, Z.-F. Hao, Z.-G. Wang, and G. Guo, “Binary differential evolution algorithm for 0-1 knapsack problem,” Computer Engineering and Design, vol. 7:047, 2009. View at Google Scholar
  31. J. Kennedy and R. C. Eberhart, “A discrete binary version of the particle swarm algorithm,” in Proceedings of the Systems, Man, and Cybernetics, 1997. Computational Cybernetics and Simulation., 1997 IEEE International Conference, vol. 5, pp. 4104–4108, IEEE, 1997.
  32. M. H. Tayarani and N. M. R. Akbarzadeh. T., “Magnetic optimization algorithms a new synthesis,” in Proceedings of the IEEE Congress on Evolutionary Computation (CEC '08), pp. 2659–2664, Hong Kong, China, June 1-6, 2008. View at Publisher · View at Google Scholar · View at Scopus
  33. E. Rashedi, H. Nezamabadi-pour, and S. Saryazdi, “GSA: a gravitational search algorithm,” Information Sciences, vol. 213, pp. 267–289, 2010. View at Publisher · View at Google Scholar · View at Scopus
  34. B. Crawford, R. Soto, M. Olivares-Suárez, and F. Paredes, “A binary firefly algorithm for the set covering problem,” Advances in Intelligent Systems and Computing, vol. 285, pp. 65–73, 2014. View at Publisher · View at Google Scholar · View at Scopus
  35. B. Crawford, R. Soto, C. Peña et al., “Binarization methods for shuffled frog leaping algorithms that solve set covering problems,” Advances in Intelligent Systems and Computing, vol. 349, pp. 317–326, 2015. View at Publisher · View at Google Scholar · View at Scopus
  36. B. Crawford, R. Soto, C. Torres-Rojas et al., “A binary fruit fly optimization algorithm to solve the set covering problem,” in Proceedings of the International Conference on Computational Science and Its Applications, pp. 411–420, Springer, 2015.
  37. R. Soto, B. Crawford, R. Olivares, J. Barraza, F. Johnson, and F. Paredes, “A binary cuckoo search algorithm for solving the set covering problem,” in Proceedings of the International Work-Conference on the Interplay Between Natural and Artificial Computation, pp. 88–97, Springer, 2015.
  38. B. Crawford, R. Soto, N. Berrios, and E. Olguin, “Solving the set covering problem using the binary cat swarm optimization metaheuristic,” World Academy of Science, Engineering and Technology, International Journal of Mathematical, Computational, Physical, Electrical and Computer Engineering, vol. 10, no. 3, pp. 104–108, 2016. View at Google Scholar
  39. B. Crawford, R. Soto, C. Olea, F. Johnson, and F. Paredes, “Binary bat algorithms for the set covering problem,” in Proceedings of the 10th Iberian Conference on Information Systems and Technologies (CISTI '15), prt, June 2015. View at Publisher · View at Google Scholar · View at Scopus
  40. J. García, B. Crawford, R. Soto, and P. García, “A multi dynamic binary black hole algorithm applied to set covering problem,” in Proccedings of the International Conference on Harmony Search Algorithm, pp. 42–51, Springer, 2017.
  41. X. Zhang, C. Wu, J. Li et al., “Binary artificial algae algorithm for multidimensional knapsack problems,” Applied Soft Computing, vol. 43, pp. 583–595, 2016. View at Publisher · View at Google Scholar
  42. K. S. Reddy, L. K. Panwar, R. Kumar, and B. K. Panigrahi, “Binary fireworks algorithm for profit based unit commitment (PBUC) problem,” International Journal of Electrical Power & Energy Systems, vol. 83, pp. 270–282, 2016. View at Publisher · View at Google Scholar · View at Scopus
  43. K. Socha and M. Dorigo, “Ant colony optimization for continuous domains,” European Journal of Operational Research, vol. 185, no. 3, pp. 1155–1173, 2008. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  44. P. Guo and L. Zhu, “Ant colony optimization for continuous domains,” in Proceedings of the 8th International Conference on Natural Computation (ICNC '12), pp. 758–762, Chongqing, China, May 2012. View at Publisher · View at Google Scholar · View at Scopus
  45. P. A. Bosman and D. Thierens, “Continuous iterated density estimation evolutionary algorithms within the idea framework,” 2001. View at Google Scholar
  46. G. E. Box, M. E. Muller et al., “A note on the generation of random normal deviates,” The Annals of Mathematical Statistics, vol. 29, no. 2, pp. 610–611, 1958. View at Publisher · View at Google Scholar
  47. A. Eiben and J. Smith, Introduction to Evolutionary Computing, Natural Computing Series, Springer-Verlag, Berlin, Germany, 2nd edition, 2015.
  48. S. L. Tilahun and J. T. Ngnotchouye, “Firefly algorithm for optimization problems with non-continuous variables: a review and analysis,” Computing Research Repository, 2016, https://arxiv.org/abs/1602.07884. View at Google Scholar
  49. M. Grötschel, “Discrete mathematics in manufacturing,” ICIAM, vol. 91, pp. 119–145, 1992. View at Google Scholar
  50. H. Dyckhoff, “A typology of cutting and packing problems,” European Journal of Operational Research, vol. 44, no. 2, pp. 145–159, 1990. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  51. L. A. Wolsey, Integer Programming, vol. 42, John Wiley & Sons, New York, NY, USA, 1998. View at MathSciNet
  52. P. Pardalos, H. Wolkowicz et al., “Quadratic Assignment and Related Problems: DIMACS Workshop,” May 20-21, 1993, volume 16. American Mathematical Soc., 1994.
  53. J. Lv, X. Wang, M. Huang, H. Cheng, and F. Li, “Solving 0-1 knapsack problem by greedy degree and expectation efficiency,” Applied Soft Computing Journal, vol. 41, pp. 94–103, 2016. View at Publisher · View at Google Scholar · View at Scopus
  54. B. Crawford, R. Soto, M. Olivares-Suárez et al., “A binary coded firefly algorithm that solves the set covering problem,” Romanian Journal of Information Science and Technology, vol. 17, no. 3, pp. 252–264, 2014. View at Google Scholar · View at Scopus
  55. E. Osaba, X.-S. Yang, F. Diaz, P. Lopez-Garcia, and R. Carballedo, “An improved discrete bat algorithm for symmetric and asymmetric traveling salesman problems,” Engineering Applications of Artificial Intelligence, vol. 48, pp. 59–71, 2016. View at Publisher · View at Google Scholar · View at Scopus
  56. I. H. Osman and G. Laporte, “Metaheuristics: a bibliography,” Annals of Operations Research, vol. 63, pp. 513–623, 1996. View at Google Scholar · View at Scopus
  57. C. Blum, “Ant colony optimization,” in Proceedings of the 13th Annual Genetic and Evolutionary Computation Conference (GECCO '11), pp. 963–990, Companion Material Proceedings, Dublin, Ireland, July 2011.
  58. Ö. Babaoglu, T. Binci, M. Jelasity, and A. Montresor, “Firefly-inspired heartbeat synchronization in overlay networks,” in Proceedings of the First International Conference on Self-Adaptive and Self-Organizing Systems (SASO '07), pp. 77–86, Boston, Mass, USA, July 2007.
  59. X. Yang, Nature-Inspired Metaheuristic Algorithms, Luniver Press, 2010.
  60. S. L. Tilahun and H. C. Ong, “Prey-predator algorithm: A new metaheuristic algorithm for optimization problems,” International Journal of Information Technology and Decision Making, vol. 14, no. 6, pp. 1331–1352, 2015. View at Publisher · View at Google Scholar · View at Scopus
  61. B. Yuce, M. S. Packianather, E. Mastrocinque, D. T. Pham, and A. Lambiase, “Honey bees inspired optimization method: the bees algorithm,” Insects, vol. 4, no. 4, pp. 646–662, 2013. View at Publisher · View at Google Scholar · View at Scopus
  62. A. Salman, I. Ahmad, and S. Al-Madani, “Particle swarm optimization for task assignment problem,” Microprocessors and Microsystems, vol. 26, no. 8, pp. 363–371, 2002. View at Publisher · View at Google Scholar · View at Scopus
  63. A. Y. Abdelaziz, R. A. Osama, S. M. El-Khodary, and B. K. Panigrahi, Distribution Systems Reconfiguration Using the Hyper-Cube Ant Colony Optimization Algorithm, Springer Berlin Heidelberg, Berlin, Germany, 2011.
  64. G. Venter and J. Sobieszczanski-Sobieski, “Multidisciplinary optimization of a transport aircraft wing using particle swarm optimization,” Structural and Multidisciplinary Optimization, vol. 26, no. 1-2, pp. 121–131, 2004. View at Publisher · View at Google Scholar · View at Scopus
  65. H. Yoshida, K. Kawata, Y. Fukuyama, S. Takayama, and Y. Nakanishi, “A Particle swarm optimization for reactive power and voltage control considering voltage security assessment,” IEEE Transactions on Power Systems, vol. 15, no. 4, pp. 1232–1239, 2000. View at Publisher · View at Google Scholar · View at Scopus
  66. N. Bacanin, I. Brajevic, and M. Tuba, “Firefly algorithm applied to integer programming problems,” Recent Advances in Mathematics, vol. 888:999, 2013. View at Google Scholar
  67. D. Karaboga and B. Basturk, “Artificial bee colony (ABC) optimization algorithm for solving constrained optimization problems,” in Proceedings of the Foundations of Fuzzy Logic and Soft Computing, 12th International Fuzzy Systems Association World Congress, (IFSA '07), pp. 789–798, Cancun , Mexico, June 18-21, 2007.
  68. X. Li, J. Wang, J. Zhou, and M. Yin, “An effective GSA based memetic algorithm for permutation flow shop scheduling,” in Proceedings of the IEEE Congress on Evolutionary Computation (CEC '10), pp. 1–6, Barcelona, Spain, 2010.
  69. H. Chen, S. Li, and T. Zheng, “Hybrid gravitational search algorithm with random-key encoding scheme combined with simulated annealing,” International Journal of Computer Science and Network Security, vol. 11, no. 6, pp. 208–217, 2011. View at Google Scholar
  70. M. F. Tasgetiren, Y. C. Liang, M. Sevkli, and G. A. Gencyilmaz, “A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem,” European Journal of Operational Research, vol. 177, no. 3, pp. 1930–1947, 2007. View at Publisher · View at Google Scholar · View at Scopus
  71. A. Yousif, A. H. Abdullah, S. M. Nor, and A. A. Abdelaziz, “Scheduling jobs on grid computing using firefly algorithm,” Journal of Theoretical and Applied Information Technology, vol. 33, no. 2, pp. 155–164, 2011. View at Google Scholar · View at Scopus
  72. A. Kumar and S. Chakarverty, “Design optimization for reliable embedded system using Cuckoo search,” in Proceedings of the 3rd International Conference on Electronics Computer Technology (ICECT '11), vol. 1, pp. 264–268, April 2011. View at Publisher · View at Google Scholar · View at Scopus
  73. A. Lotfipour and H. Afrakhte, “A discrete teaching-learning-based optimization algorithm to solve distribution system reconfiguration in presence of distributed generation,” International Journal of Electrical Power and Energy Systems, vol. 82, pp. 264–273, 2016. View at Publisher · View at Google Scholar · View at Scopus
  74. S. Palit, S. N. Sinha, M. A. Molla, A. Khanra, and M. Kule, “A cryptanalytic attack on the knapsack cryptosystem using binary firefly algorithm,” in Proceedings of the International Conference on Computer and Communication Technology (ICCCT '11), vol. 2, pp. 428–432, 2011.
  75. M. K. Sayadi, A. Hafezalkotob, and S. G. J. Naini, “Firefly-inspired algorithm for discrete optimization problems: an application to manufacturing cell formation,” Journal of Manufacturing Systems, vol. 32, no. 1, pp. 78–84, 2013. View at Publisher · View at Google Scholar
  76. N. Rajalakshmi, P. D. Subramanian, and K. Thamizhavel, “Performance enhancement of radial distributed system with distributed generators by reconfiguration using binary firefly algorithm,” Journal of The Institution of Engineers (India), vol. 96, no. 1, Series B, pp. 91–99, 2015. View at Publisher · View at Google Scholar
  77. Y. Yang, Y. Mao, P. Yang, and Y. Jiang, “The unit commitment problem based on an improved firefly and particle swarm optimization hybrid algorithm,” in Proceedings of the Chinese Automation Congress (CAC '13), pp. 718–722, IEEE, 2013.
  78. K. Chandrasekaran and S. P. Simon, “Network and reliability constrained unit commitment problem using binary real coded firefly algorithm,” International Journal of Electrical Power and Energy Systems, vol. 43, no. 1, pp. 921–932, 2012. View at Publisher · View at Google Scholar · View at Scopus
  79. K. Chandrasekaran, S. P. Simon, and N. P. Padhy, “Binary real coded firefly algorithm for solving unit commitment problem,” Information Sciences, vol. 249, pp. 67–84, 2013. View at Publisher · View at Google Scholar · View at Scopus
  80. E. Rashedi, H. Nezamabadi-pour, and S. Saryazdi, “BGSA: binary gravitational search algorithm,” Natural Computing, vol. 9, no. 3, pp. 727–745, 2010. View at Publisher · View at Google Scholar · View at MathSciNet
  81. T. Khalil, H. Youseef, and M. Aziz, “A binary particle swarm optimization for optimal placement and sizing of capacitor banks in radial distribution feeders with distorted substation voltages,” in Proceedings of the AIML international conference, pp. 137–143, 2006.
  82. D. Robinson, “Reliability analysis of bulk power systems using swarm intelligence,” IEEE, pp. 96–102, 2005. View at Google Scholar
  83. Y. Liu and X. Gu, “Skeleton-network reconfiguration based on topological characteristics of scale-free networks and discrete particle swarm optimization,” IEEE Transactions on Power Systems, vol. 22, no. 3, pp. 1267–1274, 2007. View at Publisher · View at Google Scholar · View at Scopus
  84. B. Crawford, R. Soto, R. Cuesta, M. Olivares-Suárez, F. Johnson, and E. Olgun, “Two swarm intelligence algorithms for the set covering problem,” in Proceedings of the 9th International Conference on Software Engineering and Applications, (ICSOFT-EA '14), pp. 29–31, Vienna, Austria, 29-31 August, 2014.
  85. M. Akhlaghi, F. Emami, and N. Nozhat, “Binary tlbo algorithm assisted for designing plasmonic nano bi-pyramids-based absorption coefficient,” Journal of Modern Optics, vol. 61, no. 13, pp. 1092–1096, 2014. View at Publisher · View at Google Scholar
  86. C. Lv, H. Zhao, and X. Yang, “Particle swarm optimization algorithm for quadratic assignment problem,” in Proceedings of the International Conference on Computer Science and Network Technology (ICCSNT '11), pp. 1728–1731, December 2011. View at Publisher · View at Google Scholar · View at Scopus
  87. Z. A. E. Moiz Dahi, C. Mezioud, and A. Draa, “Binary bat algorithm: On the efficiency of mapping functions when handling binary problems using continuous-variable-based metaheuristics,” IFIP Advances in Information and Communication Technology, vol. 456, pp. 3–14, 2015. View at Publisher · View at Google Scholar · View at Scopus
  88. J. Proakis and M. Salehi, Communication Systems Engineering, vol. 3, Prentice Hall, Upper Saddle River, NJ, USA, 2 edition, 2002.
  89. G. Pampara, N. Franken, and A. P. Engelbrecht, “Combining particle swarm optimisation with angle modulation to solve binary problems,” in Proceedings of the IEEE Congress on Evolutionary Computation (CEC '05), vol. 1, pp. 89–96, Edinburgh, UK, September 2005. View at Publisher · View at Google Scholar · View at Scopus
  90. W. Liu, L. Liu, and D. Cartes, “Angle modulated particle swarm optimization based defensive islanding of large scale power systems,” in Proceedings of the IEEE Power Engineering Society Conference and Exposition in Africa, pp. 1–8, 2007.
  91. S. Das, R. Mukherjee, R. Kundu, and T. Vasilakos, “Multi-user detection in multi-carrier CDMA wireless broadband system using a binary adaptive differential evolution algorithm,” in Proceedings of the Genetic and Evolutionary Computation Conference (GECCO '13), pp. 1245–1252, Amsterdam, The Netherlands, July 6-10, 2013.
  92. B. J. Leonard and A. P. Engelbrecht, “Frequency distribution of candidate solutions in angle modulated particle swarms,” in Proceedings of the IEEE Symposium Series on Computational Intelligence (SSCI '15), pp. 251–258, Cape Town, South Africa, December 7-10, 2015. View at Publisher · View at Google Scholar · View at Scopus
  93. C. Deng, T. Weise, and B. Zhao, “Pseudo binary differential evolution algorithm,” Journal of Computer Information Systems, vol. 8, no. 6, pp. 2425–2436, 2012. View at Google Scholar
  94. G. Pampará, A. P. Engelbrecht, and N. Franken, “Binary differential evolution,” in Proceedings of the IEEE Congress on Evolutionary Computation (CEC '06), pp. 1873–1879, Vancouver, BC, Canada, July 2006, Part of WCCI 2006. View at Publisher · View at Google Scholar · View at Scopus
  95. G. Yavuz and D. Aydin, “Angle modulated artificial bee colony algorithms for feature selection,” Applied Computational Intelligence and Soft Computing, vol. 2016, Article ID 9569161, 6 pages, 2016. View at Publisher · View at Google Scholar
  96. G. Pampará and A. P. Engelbrecht, “Binary artificial bee colony optimization,” in Proceedings of the IEEE Symposium on Swarm Intelligence (SIS '11), pp. 1–8, IEEE Perth, April 2011. View at Publisher · View at Google Scholar · View at Scopus
  97. F. Afshinmanesh, A. Marandi, and A. Rahimi-Kian, “A novel binary particle swarm optimization method using artificial immune system,” in Proceedings of the International Conference on Computer as a Tool (EUROCON '05), vol. 1, pp. 217–220, IEEE, 2005.
  98. A. Marandi, F. Afshinmanesh, M. Shahabadi, and F. Bahrami, “Boolean particle swarm optimization and its application to the design of a dual-band dual-polarized planar antenna,” in Proceedings of the IEEE International Conference on Evolutionary Computation (CEC '06), pp. 3212–3218, Vancouver, BC, Canada, July, 2006, Part of WCCI 2006.
  99. K. V. Deligkaris, Z. D. Zaharis, D. G. Kampitaki, S. K. Goudos, I. T. Rekanos, and M. N. Spasos, “Thinned planar array design using boolean PSO with velocity mutation,” IEEE Transactions on Magnetics, vol. 45, no. 3, pp. 1490–1493, 2009. View at Publisher · View at Google Scholar · View at Scopus
  100. D. Jia, X. Duan, and M. K. Khan, “Binary artificial bee colony optimization using bitwise operation,” Computers and Industrial Engineering, vol. 76, pp. 360–365, 2014. View at Publisher · View at Google Scholar · View at Scopus
  101. Y. J. Gong, J. Zhang, O. Liu, R. Z. Huang, H. S. H. Chung, and Y.-H. Shi, “Optimizing the vehicle routing problem with time windows: a discrete particle swarm optimization approach,” IEEE Transactions on Systems, Man and Cybernetics Part C: Applications and Reviews, vol. 42, no. 2, pp. 254–267, 2012. View at Publisher · View at Google Scholar · View at Scopus
  102. M. Neethling and A. P. Engelbrecht, “Determining RNA secondary structure using set-based particle swarm optimization,” in Proceedings of the IEEE International Conference on Evolutionary Computation (CEC '06), pp. 1670–1677, Vancouver , BC, Canada, July 2006, Part of WCCI 2006.
  103. W. N. Chen, J. Zhang, H. S. H. Chung, W. L. Zhong, W. G. Wu, and Y. H. Shi, “A novel set-based particle swarm optimization method for discrete optimization problems,” IEEE Transactions on Evolutionary Computation, vol. 14, no. 2, pp. 278–300, 2010. View at Publisher · View at Google Scholar · View at Scopus
  104. J. Langeveld and A. Engelbrecht, “A generic set-based particle swarm optimization algorithm,” in Proceedings of the International Conference on Swarm Intelligence (ICSI '11), Paris, France, 2011.
  105. J. Langeveld and A. P. Engelbrecht, “Set-based particle swarm optimization applied to the multidimensional knapsack problem,” Swarm Intelligence, vol. 6, no. 4, pp. 297–342, 2012. View at Publisher · View at Google Scholar · View at Scopus
  106. Y.-P. Chen and C.-H. Chen, “Enabling the extended compact genetic algorithm for real-parameter optimization by using adaptive discretization,” Evolutionary Computation, vol. 18, no. 2, pp. 199–228, 2010. View at Publisher · View at Google Scholar · View at Scopus
  107. J. Sun, B. Feng, and W. Xu, “Particle swarm optimization with particles having quantum behavior,” in Proceedings of the IEEE Congress on Evolutionary Computation (CEC '04), pp. 325–331, Portland, Ore, USA, June 2004.
  108. Y. Shuyuan, W. Min, and J. Licheng, “A quantum particle swarm optimization,” IEEE Congress on Evolutionary Computation, vol. 1, pp. 19–23, 2004. View at Google Scholar
  109. J. Wang, Y. Zhang, Y. Zhou, and J. Yin, “Discrete quantum-behaved particle swarm optimization based on estimation of distribution for combinatorial optimization,” in Proceedings of the IEEE Congress on Evolutionary Computation (CEC '08), pp. 897–904, Hong Kong, China, June 1-6, 2008. View at Publisher · View at Google Scholar · View at Scopus
  110. J. Zhao, J. Sun, and W. Xu, “A binary quantum-behaved particle swarm optimization algorithm with cooperative approach,” International Journal of Computer Science, vol. 10, no. 2, pp. 112–118, 2005. View at Google Scholar
  111. A. A. Ibrahim, A. Mohamed, H. Shareef, and S. P. Ghoshal, “An effective power quality monitor placement method utilizing quantum-inspired particle swarm optimization,” in Proceedings of the International Conference on Electrical Engineering and Informatics (ICEEI '11), pp. 1–6, Bandung, Indonesia, 7-19 July, 2011. View at Publisher · View at Google Scholar · View at Scopus
  112. A. R. Hota and A. Pat, “An adaptive quantum-inspired differential evolution algorithm for 0-1 knapsack problem,” in Proceedings of the 2nd World Congress on Nature and Biologically Inspired Computing (NaBIC '10), pp. 703–708, December 2010. View at Publisher · View at Google Scholar · View at Scopus
  113. J. Alegra and Y. Túpac, “A generalized quantum-inspired evolutionary algorithm for combinatorial optimization problems,” in Proceedings of the XXXII International Conference of the Chilean Computer Science Society (SCCC '14), pp. 11–15, November.
  114. S. Dey, S. Bhattacharyya, and U. Maulik, “New quantum inspired meta-heuristic techniques for multi-level colour image thresholding,” Applied Soft Computing, vol. 46, pp. 677–702, 2016. View at Publisher · View at Google Scholar
  115. A. Layeb, “A Novel Quantum Inspired Cuckoo Search for Knapsack Problems,” International Journal of Bio-Inspired Computation, vol. 3, no. 5, pp. 297–305, 2011. View at Publisher · View at Google Scholar · View at Scopus
  116. A. Layeb and S. R. Boussalia, “A novel quantum inspired cuckoo search algorithm for bin packing problem,” International Journal of Information Technology and Computer Science, vol. 4, no. 5, 58 pages, 2012. View at Publisher · View at Google Scholar
  117. A. Layeb, “A hybrid quantum inspired harmony search algorithm for 0-1 optimization problems,” Journal of Computational and Applied Mathematics, vol. 253, pp. 14–25, 2013. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  118. Y. Zhou, X. Chen, and G. Zhou, “An improved monkey algorithm for a 0-1 knapsack problem,” Applied Soft Computing Journal, vol. 38, pp. 817–830, 2016. View at Publisher · View at Google Scholar · View at Scopus
  119. P. Larranaga and J. A. Lozano, Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation, Kluwer Academic Publishers, Boston, UK, 2nd edition, 2002.
  120. J. Wang, “A novel discrete particle swarm optimization based on estimation of distribution,” in Proceedings of the Advanced Intelligent Computing Theories and Applications. With Aspects of Artificial Intelligence, Third International Conference on Intelligent Computing (ICIC '07), pp. 791–802, Qingdao, China, August 21-24, 2007.
  121. S. Tsutsui, M. Pelikan, and D. E. Goldberg, “Evolutionary algorithm using marginal histogram models in continuous domain,” IlliGAL Report, vol. 2001019, 2001. View at Google Scholar
  122. M. Pelikan, D. E. Goldberg, and S. Tsutsui, “Getting the best of both worlds: discrete and continuous genetic and evolutionary algorithms in concert,” Information Sciences, vol. 156, no. 3-4, pp. 147–171, 2003. View at Publisher · View at Google Scholar · View at MathSciNet
  123. P. Balaprakash, M. Birattari, T. Stützle, and M. Dorigo, “Estimation-based metaheuristics for the probabilistic traveling salesman problem,” Computers & OR, vol. 37, no. 11, pp. 1939–1951, 2010. View at Google Scholar
  124. B. J. Leonard, A. P. Engelbrecht, and C. W. Cleghorn, “Critical considerations on angle modulated particle swarm optimisers,” Swarm Intelligence, vol. 9, no. 4, pp. 291–314, 2015. View at Publisher · View at Google Scholar · View at Scopus
  125. F. Barani, M. Mirhosseini, and H. Nezamabadi-pour, “Application of binary quantum-inspired gravitational search algorithm in feature subset selection,” Applied Intelligence, pp. 1–15, 2017. View at Google Scholar
  126. J.-S. Chou and J. P. P. Thedja, “Metaheuristic optimization within machine learning-based classification system for early warnings related to geotechnical problems,” Automation in Construction, vol. 68, pp. 65–80, 2016. View at Publisher · View at Google Scholar · View at Scopus
  127. K.-C. Lin, K.-Y. Zhang, Y.-H. Huang, J. C. Hung, and N. Yen, “Feature selection based on an improved cat swarm optimization algorithm for big data classification,” Journal of Supercomputing, pp. 1–12, 2016. View at Publisher · View at Google Scholar · View at Scopus
  128. L. Shang, Z. Zhou, and X. Liu, “Particle swarm optimization-based feature selection in sentiment classification,” Soft Computing, vol. 20, no. 10, pp. 3821–3834, 2016. View at Publisher · View at Google Scholar · View at Scopus
  129. L. Shen, H. Chen, Z. Yu et al., “Evolving support vector machines using fruit fly optimization for medical data classification,” Knowledge-Based Systems, vol. 96, pp. 61–75, 2016. View at Publisher · View at Google Scholar · View at Scopus
  130. B. Z. Dadaneh, H. Y. Markid, and A. Zakerolhosseini, “Unsupervised probabilistic feature selection using ant colony optimization,” Expert Systems with Applications, vol. 53, pp. 27–42, 2016. View at Publisher · View at Google Scholar · View at Scopus
  131. G. J. Krishna and V. Ravi, “Modified harmony search applied to reliability optimization of complex systems,” Advances in Intelligent Systems and Computing, vol. 382, pp. 169–180, 2016. View at Publisher · View at Google Scholar · View at Scopus
  132. B. Crawford, R. Soto, M. O. Suárez, F. Paredes, and F. Johnson, “Binary Firefly algorithm for the set covering problem,” in Proceedings of the 9th Iberian Conference on Information Systems and Technologies (CISTI '14), pp. 1–5, June 2014. View at Publisher · View at Google Scholar · View at Scopus
  133. B. Crawford, R. Soto, M. Riquelme-Leiva et al., “Modified binary firefly algorithms with different transfer functions for solving set covering problems,” Advances in Intelligent Systems and Computing, vol. 349, pp. 307–315, 2015. View at Publisher · View at Google Scholar · View at Scopus
  134. L. Pappula and D. Ghosh, “Synthesis of thinned planar antenna array using multiobjective normal mutated binary cat swarm optimization,” Applied Computational Intelligence and Soft Computing, vol. 2016, Article ID 4102156, 9 pages, 2016. View at Publisher · View at Google Scholar
  135. M. F. Costa, A. M. Rocha, R. B. Francisco, and E. M. Fernandes, “Heuristic-based firefly algorithm for bound constrained nonlinear binary optimization,” Advances in Operations Research, Article ID 215182, 12 pages, 2014. View at Publisher · View at Google Scholar · View at MathSciNet
  136. M. K. Sayadi, R. Ramezanian, and N. Ghaffari-Nasab, “A discrete firefly meta-heuristic with local search for makespan minimization in permutation flow shop scheduling problems,” International Journal of Industrial Engineering Computations, vol. 1, no. 1, pp. 1–10, 2010. View at Publisher · View at Google Scholar · View at Scopus
  137. K. Chandrasekaran, S. Hemamalini, S. P. Simon, and N. P. Padhy, “Thermal unit commitment using binary/real coded artificial bee colony algorithm,” Electric Power Systems Research, vol. 84, no. 1, pp. 109–119, 2012. View at Publisher · View at Google Scholar
  138. S. Mirjalili, G.-G. Wang, and L. D. S. Coelho, “Binary optimization using hybrid particle swarm optimization and gravitational search algorithm,” Neural Computing and Applications, vol. 25, no. 6, pp. 1423–1435, 2014. View at Publisher · View at Google Scholar · View at Scopus
  139. Y. Saji and M. E. Riffi, “A novel discrete bat algorithm for solving the travelling salesman problem,” Neural Computing and Applications, vol. 27, no. 7, pp. 1853–1866, 2016. View at Publisher · View at Google Scholar · View at Scopus
  140. H. B. Khormouji, H. Hajipour, and H. Rostami, “BODMA: a novel metaheuristic algorithm for binary optimization problems based on open source development model algorithm,” in Proceedings of the 7th International Symposium on Telecommunications (IST '14), pp. 49–54, September 2014. View at Publisher · View at Google Scholar · View at Scopus
  141. N. Javadian, M. G. Alikhani, and R. Tavakkoli-Moghaddam, “A discrete binary version of the electromagnetism-like heuristic for solving traveling salesman problem,” in Proceedings of the Advanced Intelligent Computing Theories and Applications. With Aspects of Artificial Intelligence, 4th International Conference on Intelligent Computing, (ICIC '08), pp. 123–130, Shanghai , China, September 15-18, 2008.
  142. L.-Y. Chuang, S.-W. Tsai, and C.-H. Yang, “Catfish binary particle swarm optimization for feature selection,” in Proceedings of the International Conference on Machine Learning and Computing, (IPCSIT '11), vol. 3, pp. 40–44, 2011.
  143. H. Djelloul and S. Chikhi, “Combining bat algorithm with angle modulation for graph coloring problem,” in Proceedings of the Symposium on Complex Systems and Intelligent Computing, (Comp SIC '15), 2015.
  144. R. Jensen and Q. Shen, “Finding rough set reducts with ant colony optimization,” in Proceedings of the 2003 UK Workshop on Computational Intelligence, vol. 1, 2003.
  145. F. J. M. Garcia and J. A. M. Perez, “Jumping frogs optimization: a new swarm method for discrete optimization,” Documentos de Trabajo del DEIOC, vol. 3, 2008. View at Google Scholar
  146. A. Sadollah, H. Eskandar, A. Bahreininejad, and J. H. Kim, “Water cycle, mine blast and improved mine blast algorithms for discrete sizing optimization of truss structures,” Computers and Structures, vol. 149, pp. 1–16, 2015. View at Publisher · View at Google Scholar · View at Scopus
  147. M. B. Dowlatshahi, H. Nezamabadi-pour, and M. Mashinchi, “A discrete gravitational search algorithm for solving combinatorial optimization problems,” Information Sciences, vol. 258, pp. 94–107, 2014. View at Publisher · View at Google Scholar · View at MathSciNet
  148. E. A. Duki, H. A. Mansoorkhani, A. Soroudi, and M. Ehsan, “A discrete imperialist competition algorithm for transmission expansion planning,” in Proceedings of the 25th International Power System Conference, pp. 1–10, 2010.
  149. C. Veenhuis, “Binary invasive weed optimization,” in Proceedings of the 2010 2nd World Congress on Nature and Biologically Inspired Computing (NaBIC '10), pp. 449–454, December 2010. View at Publisher · View at Google Scholar · View at Scopus
  150. M. Macaš, A. P. Bhondekar, R. Kumar et al., “Binary social impact theory based optimization and its applications in pattern recognition,” Neurocomputing, vol. 132, pp. 85–96, 2014. View at Publisher · View at Google Scholar · View at Scopus
  151. S. A. MirHassani, S. Raeisi, and A. Rahmani, “Quantum binary particle swarm optimization-based algorithm for solving a class of bi-level competitive facility location problems,” Optimization Methods and Software, vol. 30, no. 4, pp. 756–768, 2015. View at Publisher · View at Google Scholar · View at MathSciNet