Table of Contents Author Guidelines Submit a Manuscript
Computational Intelligence and Neuroscience
Volume 2017 (2017), Article ID 3235720, 15 pages
https://doi.org/10.1155/2017/3235720
Research Article

Dynamic Inertia Weight Binary Bat Algorithm with Neighborhood Search

1National Network New Media Engineering Research Center, Institute of Acoustics, Chinese Academy of Sciences, Beijing 100190, China
2University of Chinese Academy of Sciences, Beijing 100049, China

Correspondence should be addressed to Rui Han

Received 27 February 2017; Accepted 20 April 2017; Published 28 May 2017

Academic Editor: Michael Schmuker

Copyright © 2017 Xingwang Huang 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. Z.-L. Gaing, “Discrete particle swarm optimization algorithm for unit commitment,” in Proceedings of the IEEE Power Engineering Society General Meeting, vol. 1, pp. 418–424, Toronto, Canada, 2003. View at Publisher · View at Google Scholar
  2. R. Y. Nakamura, L. A. Pereira, K. A. Costa, D. Rodrigues, J. P. Papa, and X. Yang, “Bba: a binary bat algorithm for feature selection,” in Proceedings of the 25th SIBGRAPI Conference on Graphics, Patterns and Images (SIBGRAPI '12), pp. 291–297, Ouro Preto, Brazil, 2012. View at Publisher · View at Google Scholar
  3. S. Kashef and H. Nezamabadi-pour, “An advanced ACO algorithm for feature subset selection,” Neurocomputing, vol. 147, no. 1, pp. 271–279, 2015. View at Publisher · View at Google Scholar · View at Scopus
  4. H. S. Al-Olimat, M. Alam, R. Green, and J. K. Lee, “Cloudlet scheduling with particle swarm optimization,” in Preceedings of the 5th International Conference on Communication Systems and Network Technologies (CSNT '15), pp. 991–995, April 2015. View at Publisher · View at Google Scholar · View at Scopus
  5. L. Xu, K. Wang, Z. Ouyang, and X. Qi, “An improved binary PSO-based task scheduling algorithm in green cloud computing,” in Proceedings of the 9th International Conference on Communications and Networking in China (CHINACOM '14), pp. 126–131, August 2014. View at Publisher · View at Google Scholar · View at Scopus
  6. J. C. Bansal and K. Deep, “A modified binary particle swarm optimization for knapsack problems,” Applied Mathematics and Computation, vol. 218, no. 22, pp. 11042–11061, 2012. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  7. H. Wu, F. Zhang, and R. Zhan, “A binary wolf pack algorithm for solving 0-1 knapsack problem,” Systems Engineering and Electronics, vol. 36, no. 8, pp. 1660–1667, 2014. View at Google Scholar
  8. S. Mirjalili, S. M. Mirjalili, and X.-S. Yang, “Binary bat algorithm,” Neural Computing and Applications, vol. 25, no. 3-4, pp. 663–681, 2014. View at Publisher · View at Google Scholar · View at Scopus
  9. X.-S. Yang, “A new metaheuristic bat-inspired algorithm,” in Nature Inspired Cooperative Strategies for Optimization (NICSO 2010), J. R. Gonzalez, D. A. Pelta, C. Cruz, G. Terrazas, and N. Krasnogor, Eds., vol. 284 of Studies in Computational Intelligence, pp. 65–74, Springer, Berlin, Germany, 2010. View at Publisher · View at Google Scholar
  10. S. P. Brooks and B. J. Morgan, “Optimization using simulated annealing,” The Statistician, vol. 44, no. 2, pp. 241–257, 1995. View at Publisher · View at Google Scholar
  11. J. Kennedy and R. Eberhart, “Particle swarm optimization,” in Proceedings of the IEEE International Conference on Neural Networks (ICNN ’95), vol. 4, pp. 1942–1948, Perth, Western Australia, 1995. View at Publisher · View at Google Scholar · View at Scopus
  12. Y. Shi and R. Eberhart, “A modified particle swarm optimizer,” in Proceedings of the IEEE International Conference on Evolutionary Computation and IEEE World Congress on Computational Intelligence, pp. 69–73, Anchorage, Ala, USA, 1998. View at Publisher · View at Google Scholar
  13. R. C. Eberhart and Y. Shi, “Tracking and optimizing dynamic systems with particle swarms,” in Proceedings of the Congress on Evolutionary Computation, vol. 1, pp. 94–100, Seoul, Republic of Korea, May 2001. View at Publisher · View at Google Scholar · View at Scopus
  14. S. U. Khan, S. Yang, L. Wang, and L. Liu, “A modified particle swarm optimization algorithm for global optimizations of inverse problems,” IEEE Transactions on Magnetics, vol. 52, no. 3, 2016. View at Publisher · View at Google Scholar · View at Scopus
  15. R. C. Eberhart and Y. Shi, “Comparing inertia weights and constriction factors in particle swarm optimization,” in Proceedings of the 2000 Congress on Evolutionary Computation (CEC' 00), vol. 1, pp. 84–88, La Jolla, Claif, USA, 2000. View at Publisher · View at Google Scholar
  16. A. Chatterjee and P. Siarry, “Nonlinear inertia weight variation for dynamic adaptation in particle swarm optimization,” Computers & Operations Research, vol. 33, no. 3, pp. 859–871, 2006. View at Publisher · View at Google Scholar
  17. Y.-L. Gao, X.-H. An, and J.-M. Liu, “A particle swarm optimization algorithm with logarithm decreasing inertia weight and chaos mutation,” in Proceedings of the 2008 International Conference on Computational Intelligence and Security (CIS '08), pp. 61–65, chn, December 2008. View at Publisher · View at Google Scholar · View at Scopus
  18. G. Chen, X. Huang, J. Jia, and Z. Min, “Natural exponential inertia weight strategy in particle swarm optimization,” in Proceedings of the 6th World Congress on Intelligent Control and Automation (WCICA '06), vol. 1, pp. 3672–3675, June 2006. View at Publisher · View at Google Scholar · View at Scopus
  19. A. Nickabadi, M. M. Ebadzadeh, and R. Safabakhsh, “A novel particle swarm optimization algorithm with adaptive inertia weight,” Applied Soft Computing Journal, vol. 11, no. 4, pp. 3658–3670, 2011. View at Publisher · View at Google Scholar · View at Scopus
  20. Z.-H. Zhan, J. Zhang, Y. Li, and H. S.-H. Chung, “Adaptive particle swarm optimization,” IEEE Transactions on Systems, Man, and Cybernetics Part B: Cybernetics, vol. 39, no. 6, pp. 1362–1381, 2009. View at Publisher · View at Google Scholar · View at Scopus
  21. X. Yang, J. Yuan, H. Yuan, and H. Mao, “A modified particle swarm optimizer with dynamic adaptation,” Applied Mathematics & Computation, vol. 189, no. 2, pp. 1205–1213, 2007. View at Publisher · View at Google Scholar
  22. S. Yilmaz and E. U. Küçüksille, “A new modification approach on bat algorithm for solving optimization problems,” Applied Soft Computing, vol. 28, pp. 259–275, 2015. View at Publisher · View at Google Scholar · View at Scopus
  23. G. Wang, M. Lu, and X. Zhao, “An improved bat algorithm with variable neighborhood search for global optimization,” in Proceedings of the IEEE Congress on Evolutionary Computation (CEC '16), pp. 1773–1778, Vancouver, Canada, 2016. View at Publisher · View at Google Scholar
  24. X. Cai, L. Wang, Q. Kang, and Q. Wu, “Bat algorithm with gaussian walk,” International Journal of Bio-Inspired Computation, vol. 6, no. 3, pp. 166–174, 2014. View at Publisher · View at Google Scholar · View at Scopus
  25. X. Cai, X. Z. Gao, and Y. Xue, “Improved bat algorithm with optimal forage strategy and random disturbance strategy,” International Journal of Bio-Inspired Computation, vol. 8, no. 4, pp. 205–214, 2016. View at Publisher · View at Google Scholar
  26. K. Lei and C. Pu, “Complex optimization problems using highly efficient particle swarm optimizer,” TELKOMNIKA (Telecommunication Computing Electronics and Control), vol. 12, no. 4, pp. 1023–1030, 2014. View at Publisher · View at Google Scholar
  27. S. Mirjalili, “Dragonfly algorithm: a new meta-heuristic optimization technique for solving single-objective, discrete, and multi-objective problems,” Neural Computing & Applications, vol. 27, no. 4, pp. 1053–1073, 2016. View at Publisher · View at Google Scholar · View at Scopus
  28. J. Kennedy and R. C. Eberhart, “A discrete binary version of the particle swarm algorithm,” in Proceedings of the IEEE International Conference on Systems, Man, and Cybernetics, Computational Cybernetics and Simulation, vol. 5, pp. 4104–4108, IEEE, Orlando, Fla, USA, October 1997. View at Publisher · View at Google Scholar · View at Scopus
  29. F. Wilcoxon, “Individual comparisons by ranking methods,” Biometrics Bulletin, vol. 1, no. 6, pp. 80–83, 1945. View at Google Scholar · View at MathSciNet
  30. J. Derrac, S. García, D. Molina, and F. Herrera, “A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms,” Swarm and Evolutionary Computation, vol. 1, no. 1, pp. 3–18, 2011. View at Publisher · View at Google Scholar · View at Scopus
  31. Y. Sharafi, M. A. Khanesar, and M. Teshnehlab, “Discrete binary cat swarm optimization algorithm,” in Proceedings of the 3rd IEEE International Conference on Computer, Control and Communication (IC4 '13), pp. 1–6, 2013. View at Publisher · View at Google Scholar · View at Scopus
  32. Y. Jiang, X. Zeng, and P. Sun, “A rapid application switch technique based on resource cache,” Journal of Network New Media, vol. 2, no. 4, pp. 33–38, 2013. View at Google Scholar