Table of Contents Author Guidelines Submit a Manuscript
Advances in Operations Research
Volume 2016 (2016), Article ID 7325263, 14 pages
http://dx.doi.org/10.1155/2016/7325263
Research Article

Extended Prey-Predator Algorithm with a Group Hunting Scenario

1School of Mathematics, Statistics and Computer Science, University of KwaZulu-Natal, Private Bag X01, Scottsville, Pietermaritzburg 3209, South Africa
2School of Mathematical Sciences, Universiti Sains Malaysia, 11800 Pulau Pinang, Malaysia

Received 25 November 2015; Revised 29 March 2016; Accepted 24 April 2016

Academic Editor: Imed Kacem

Copyright © 2016 Surafel Luleseged Tilahun 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. M. Villasana and G. Ochoa, “Heuristic design of cancer chemotherapies,” IEEE Transactions on Evolutionary Computation, vol. 8, no. 6, pp. 513–521, 2004. View at Publisher · View at Google Scholar · View at Scopus
  2. S. L. Tilahun and H. C. Ong, “Bus timetabling as a fuzzy multiobjective optimization problem using preference-based genetic algorithm,” ROMET-Traffic & Transportation, vol. 24, no. 3, pp. 183–191, 2012. View at Publisher · View at Google Scholar
  3. H. C. Ong and S. L. Tilahun, “Integrating fuzzy preference in genetic algorithm to solve multiobjective optimization problems,” Far East Journal of Mathematical Sciences, vol. 55, pp. 165–179, 2011. View at Google Scholar
  4. M. I. Fraidin, “Decision-making in dependency court: heuristics, cognitive biases and accountability,” Cleveland State Law Review, vol. 60, pp. 913–975, 2013. View at Google Scholar
  5. R. Valerdi, “Heuristics for systems engineering cost estimation,” IEEE Systems Journal, vol. 5, pp. 91–98, 2010. View at Publisher · View at Google Scholar · View at Scopus
  6. S. L. Tilahun, Prey predator algorithm: a new metaheuristic optimization approach [Ph.D. thesis], School of Mathematical Sciences, Universiti Sains Malaysia, Penang, Malaysia, April 2013.
  7. N. Hamadneh, S. Sathasivam, S. L. Tilahun, and O. H. Choon, “Learning logic programming in radial basis function network via genetic algorithm,” Journal of Applied Sciences, vol. 12, no. 9, pp. 840–847, 2012. View at Publisher · View at Google Scholar · View at Scopus
  8. S. L. Tilahun and H. C. Ong, “Modified firefly algorithm,” Journal of Applied Mathematics, vol. 2012, Article ID 467631, 12 pages, 2012. View at Publisher · View at Google Scholar · View at MathSciNet
  9. X.-S. Yang, “A new metaheuristic bat-inspired Algorithm,” Studies in Computational Intelligence, vol. 284, pp. 65–74, 2010. View at Publisher · View at Google Scholar · View at Scopus
  10. X.-S. Yang, “Metaheuristic optimization: algorithm analysis and open problems,” in Experimental Algorithms, P. M. Pardalos and S. Rebennack, Eds., vol. 6630 of Lecture Notes in Computer Science, pp. 21–32, 2011. View at Publisher · View at Google Scholar
  11. S. L. Tilahun, S. M. Kassa, and H. C. Ong, “A new algorithm for multilevel optimization problems using evolutionary strategy, inspired by natural adaptation,” in PRICAI 2012: Trends in Artificial Intelligence: 12th Pacific Rim International Conference on Artificial Intelligence, Kuching, Malaysia, September 3–7, 2012. Proceedings, P. Anthony, M. Ishizuka, and D. Lukose, Eds., vol. 7458 of Lecture Notes in Computer Science, pp. 577–588, Springer, Berlin, Germany, 2012. View at Publisher · View at Google Scholar
  12. C. Blum, J. Puchinger, G. R. Raidl, and A. Roli, “A brief survey on hybrid metaheuristics,” in Proceedings of 4th International Conference on Bioinspired Optimization Methods and their Applications (BIOMA '10), B. Filipic and J. Silc, Eds., pp. 3–16, Ljubljana, Slovenia, 2010.
  13. S. L. Tilahun and H. C. Ong, “Vector optimisation using fuzzy preference in evolutionary strategy based firefly algorithm,” International Journal of Operational Research, vol. 16, no. 1, pp. 81–95, 2013. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  14. C. Blum, C. Cotta, A. J. Fernàndez, J. E. Gallardo, and M. Mastrolilli, “Hybridizations of metaheuristics with branch & bound derivates,” Studies in Computational Intelligence, vol. 114, pp. 85–116, 2008. View at Publisher · View at Google Scholar · View at Scopus
  15. X.-S. Yang, Nature-Inspired Metaheuristics Algorithm, Luniver Press, Frome, UK, 2nd edition, 2010.
  16. S. L. Tilahun and H. C. Ong, “Prey-predator algorithm: a new metaheuristic optimization algorithm,” International Journal of Information Technology & Decision Making, vol. 13, pp. 1–22, 2014. View at Google Scholar
  17. W. Dai, Q. Liu, and T. Chai, “Particle size estimate of grinding processes using random vector functional link networks with improved robustness,” Neurocomputing, vol. 169, pp. 361–372, 2015. View at Publisher · View at Google Scholar · View at Scopus
  18. B. Bahmani-Firouzi, S. Sharifinia, R. Azizipanah-Abarghooee, and T. Niknam, “Scenario-based optimal bidding strategies of GENCOs in the incomplete information electricity market using a new improved prey—predator optimization algorithm,” IEEE Systems Journal, vol. 9, no. 4, pp. 1485–1495, 2015. View at Publisher · View at Google Scholar · View at Scopus
  19. N. Hamadneh, S. L. Tilahun, S. Sathasivam, and O. H. Choon, “Prey-predator algorithm as a new optimization technique using in radial basis function neural networks,” Research Journal of Applied Sciences, vol. 8, no. 7, pp. 383–387, 2013. View at Publisher · View at Google Scholar · View at Scopus
  20. S. L. Tilahun and H. C. Ong, “Comparison between genetic algorithm and prey-predator algorithm,” Malaysian Journal of Fundamental and Applied Sciences, vol. 9, no. 4, pp. 167–170, 2014. View at Google Scholar
  21. C. J. Krebs, Ecology, Pearson Education, San Francisco, Calif, USA, 6th edition, 2009.
  22. T. Haynes and S. Sen, “Evolving behavioral strategies in predators and prey,” in Adaption and Learning in Multi-Agent Systems: IJCAI'95 Workshop Montréal, Canada, August 21, 1995 Proceedings, vol. 1042 of Lecture Notes in Computer Science, pp. 113–126, Springer, Berlin, Germany, 1996. View at Publisher · View at Google Scholar
  23. M. Laumanns, G. Rudolph, and H.-P. Schwefel, “A spatial predator-prey approach to multi-objective optimization: a preliminary study,” in Parallel Problem Solving from Nature—PPSN V: 5th International Conference Amsterdam, The Netherlands September 27–30, 1998 Proceedings, vol. 1498 of Lecture Notes in Computer Science, pp. 241–249, Springer, Berlin, Germany, 1998. View at Publisher · View at Google Scholar
  24. M. Molga and C. Smutnicki, Test Functions for Optimization Needs, 2005.
  25. M. Jamil and X.-S. Yang, “A literature survey of benchmark functions for global optimisation problems,” International Journal of Mathematical Modelling and Numerical Optimisation, vol. 4, no. 2, pp. 150–194, 2013. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  26. J. Opacic, “A heuristic method for finding most extrema of a nonlinear functional,” IEEE Transactions on Systems, Man and Cybernetics, vol. 3, no. 1, pp. 102–107, 1973. View at Google Scholar · View at Scopus
  27. W. L. Price, “A controlled random search procedure for global optimisation,” The Computer Journal, vol. 20, no. 4, pp. 367–370, 1977. View at Publisher · View at Google Scholar
  28. J. K. Hartman, Some Experiments in Global Optimization, School United States Naval Postgraduate, 1972.
  29. S. Rahnamayan, H. R. Tizhoosh, and N. M. M. Salama, “A novel population initialization method for accelerating evolutionary algorithms,” Computers & Mathematics with Applications, vol. 53, no. 10, pp. 1605–1614, 2007. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus