MAKHA-A new hybrid swarm intelligence global optimization algorithm

Algorithms

Volumn 8, Issue 2, 2015, Pages 336-365

  Khalil, Ahmed M E ^a   Fateen, Seif Eddeen K ^a,b   Bonilla Petriciolet, Adrián ^c  

^a CAIRO UNIVERSITY   (Egypt)

^b The American University in Cairo   (Egypt)

^c Institute of Technology of Aguascalientes   (Mexico)

Author keywords

Global optimization; Hybridization; Krill herd algorithm; Monkey algorithm; Nature inspired methods

Indexed keywords

ARTIFICIAL INTELLIGENCE; GLOBAL OPTIMIZATION; OPTIMIZATION;

BENCH-MARK PROBLEMS; BIO-INSPIRED OPTIMIZATIONS; GLOBAL OPTIMIZATION ALGORITHM; HYBRIDIZATION; MONKEY ALGORITHMS; NATURE-INSPIRED METHODS; OPTIMIZATION METHOD; SWARM INTELLIGENCE OPTIMIZATION ALGORITHM;

ALGORITHMS;

EID: 84940369380     PISSN: None     EISSN: 19994893     Source Type: Journal    
DOI: 10.3390/a8020336     Document Type: Article

References (55)

1. Floudas, C.A.; Gounaris, C.E. A review of recent advances in global optimization. J. Glob. Optim. 2009, 45, 3-38.
2. Zhao, R.; Tang, W. Monkey algorithm for global numerical optimization. J. Uncertain Syst. 2008, 2, 165-176.
3. Gandomi, A.H.; Alavi, A.H. Krill herd: A new bio-inspired optimization algorithm. Commun. Nonlinear Sci. Numer. Simul. 2012, 17, 4831-4845.
4. Ituarte-Villarreal, C.M.; Lopez, N.; Espiritu, J.F. Using the Monkey Algorithm for Hybrid Power Systems Optimization. Procedia Comput. Sci. 2012, 12, 344-349.
5. Aghababaei, M.; Farsangi, M.M. Coordinated Control of Low Frequency Oscillations Using Improved Monkey Algorithm. Int. J. Tech. Phys. Probl. Eng. 2012, 4, 13-17.
6. Yi, T.-H.; Li, H.-N.; Zhang, X.-D. A modified monkey algorithm for optimal sensor placement in structural health monitoring. Smart Mater. Struct. 2012, 21, doi:10.1088/0964-1726/21/10/105033.
7. Yi, T.-H.; Li, H.-N.; Zhang, X.-D. Sensor placement on Canton Tower for health monitoring using asynchronous-climb monkey algorithm. Smart Mater. Struct. 2012, 21, doi:10.1088/0964-1726/21/12/125023.
8. Yi, T.H.; Zhang, X.D.; Li, H.N. Modified monkey algorithm and its application to the optimal sensor placement. Appl. Mech. Mater. 2012, 178, 2699-2702.
9. Sur, C.; Shukla, A. Discrete Krill Herd Algorithm-A Bio-Inspired Meta-Heuristics for Graph Based Network Route Optimization. In Distributed Computing and Internet Technology; Springer: New York, NY, USA, 2014; pp. 152-163.
10. Mandal, B.; Roy, P.K.; Mandal, S. Economic load dispatch using krill herd algorithm. Int. J. Electr. Power Energy Syst. 2014, 57, 1-10.
11. Zheng, L. An improved monkey algorithm with dynamic adaptation. Appl. Math. Comput. 2013, 222, 645-657.
12. Saremi, S.; Mirjalili, S.M.; Mirjalili, S. Chaotic krill herd optimization algorithm. Procedia Technol. 2014, 12, 180-185.
13. Wang, G.-G.; Gandomi, A.H.; Alavi, A.H. A chaotic particle-swarm krill herd algorithm for global numerical optimization. Kybernetes 2013, 42, 962-978.
14. Gharavian, L.; Yaghoobi, M.; Keshavarzian, P. Combination of krill herd algorithm with chaos theory in global optimization problems. In Proceedings of the 2013 3rd Joint Conference of AI & Robotics and 5th RoboCup Iran Open International Symposium (RIOS), Tehran, Iran, 8 April 2013; IEEE: Piscataway, NJ, USA, 2013.
15. Wang, J.; Yu, Y.; Zeng, Y.; Luan, W. Discrete monkey algorithm and its application in transmission network expansion planning. In Proceedings of the Power and Energy Society General Meeting, Minneapolis, MN, USA, 25-29 July 2010; IEEE: Piscataway, NJ, USA, 2010.
16. Wang, G.; Guo, L.; Gandomi, A.H.; Cao, L. Lévy-flight krill herd algorithm. Math. Probl. Eng. 2013, doi:10.1155/2013/682073.
17. Guo, L.; Wang, G.-G.; Gandomi, A.H.; Alavi, A.H.; Duan, H. A new improved krill herd algorithm for global numerical optimization. Neurocomputing 2014, 138, 392-402.
18. Wang, G.; Guo, L.; Wang, H.; Duan, H.; Liu, L.; Li, J. Incorporating mutation scheme into krill herd algorithm for global numerical optimization. Neural Comput. Appl. 2014, 24, 853-871.
19. Wang, G.-G.; Guo, L.H.; Gandomi, A.H.; Alavi, A.H.; Duan, H. Simulated annealing-based krill herd algorithm for global optimization. In Abstract and Applied Analysis; Hindawi Publishing Corporation: Cairo, Egypt, 2013.
20. Blum, C.; Roli, A. Metaheuristics in combinatorial optimization: Overview and conceptual comparison. ACM Comput. Surv. 2003, 35, 268-308.
21. Lozano, M.; García-Martínez, C. Hybrid metaheuristics with evolutionary algorithms specializing in intensification and diversification: Overview and progress report. Comput. Op. Res. 2010, 37, 481-497.
22. Liu, P.-F.; Xu, P.; Han, S.-X.; Zheng, J.-Y. Optimal design of pressure vessel using an improved genetic algorithm. J. Zhejiang Univ. Sci. A 2008, 9, 1264-1269.
23. Abdullah, A.; Deris, S.; Mohamad, M.S.; Hashim, S.Z.M. A New Hybrid Firefly Algorithm for Complex and Nonlinear Problem. In Distributed Computing and Artificial Intelligence; Omatu, S.; Bersini, H., Corchado, J.M., Rodríguez, S., Pawlewski, P., Bucciarelli, E., Eds.; Springer:Berlin, Germany; Heidelberg, Germany, 2012; pp. 673-680.
24. Biswas, A.; Dasgupta, S.; Das, S.; Abraham, A. Synergy of PSO and Bacterial Foraging Optimization-A Comparative Study on Numerical Benchmarks Innovations in Hybrid Intelligent Systems; Corchado, E., Corchado, J., Abraham, A., Eds.; Springer: Berlin, Germany; Heidelberg, Germany, 2007; pp. 255-263.
25. Li, S.; Chen, H.; Tang, Z. Study of Pseudo-Parallel Genetic Algorithm with Ant Colony Optimization to Solve the TSP. Int. J. Comput. Sci. Netw. Secur. 2011, 11, 73-79.
26. Nguyen, K.; Nguyen, P.; Tran, N. A hybrid algorithm of Harmony Search and Bees Algorithm for a University Course Timetabling Problem. Int. J. Comput. Sci. Issues 2012, 9, 12-17.
27. Farahani, Sh. M.; Abshouri, A.A.; Nasiri, B.; Meybodi, M.R. Some hybrid models to improve Firefly algorithm performance. Int. J. Artif. Intell. 2012, 8, 97-117.
28. Kim, D.H.; Abraham, A.; Cho, J.H. A hybrid genetic algorithm and bacterial foraging approach for global optimization. Inf. Sci. 2007, 177, 3918-3937.
29. Kim, D.H.; Cho, J.H. A Biologically Inspired Intelligent PID Controller Tuning for AVR Systems. Int. J. Control Autom. Syst. 2006, 4, 624-636.
30. Dehbari, S.; Rosta, A.P.; Nezhad, S.E.; Tavakkoli-Moghaddam, R. A new supply chain management method with one-way time window: A hybrid PSO-SA approach. Int. J. Ind. Eng. Comput. 2012, 3, 241-252.
31. Zahrani, M.S.; Loomes, M.J.; Malcolm, J.A.; Dayem Ullah, A.Z.M.; Steinhöfel, K.; Albrecht, A.A. Genetic local search for multicast routing with pre-processing by logarithmic simulated annealing. Comput. Op. Res. 2008, 35, 2049-2070.
32. Huang, K.-L.; Liao, C.-J. Ant colony optimization combined with taboo search for the job shop scheduling problem. Comput. Oper. Res. 2008, 35, 1030-1046.
33. Shahrouzi, M. A new hybrid genetic and swarm optimization for earthquake accelerogram scaling. Int. J. Optim. Civ. Eng. 2011, 1, 127-140.
34. Bäck, T.; Schwefel, H.-P. An overview of evolutionary algorithms for parameter optimization. Evolut. Comput. 1993, 1, 1-23.
35. Jamil, M.; Yang, X.-S. A literature survey of benchmark functions for global optimization problems. Int. J. Math. Model. Numer. Optim. 2013, 4, 150-194.
36. Mishra, S.K. Global optimization by differential evolution and particle swarm methods:Evaluation on some benchmark functions, Social Science Research Network, Rochester, NY, USA. Available online: http://ssrn.com/abstract=933827 (accessed on 3 April 2015).
37. Mishra, S.K. Some new test functions for global optimization and performance of repulsive particle swarm method, Social Science Research Network, Rochester, NY, USA. Available online: http://ssrn.com/abstract=926132 (accessed on 3 April 2015).
38. Goldstein, A.; Price, J. On descent from local minima. Math. Comput. 1971, 25, 569-574.
39. Himmelblau, D.M. Applied Nonlinear Programming; McGraw-Hill Companies: New York, NY, USA, 1972.
40. Ortiz, G.A. Evolution Strategies (ES); Mathworks: Natick, MA, USA, 2012.
41. Schwefel, H.-P.P. Evolution and Optimum Seeking: The Sixth Generation; John Wiley & Sons:Hoboken, NJ, USA, 1993.
42. Fletcher, R.; Powell, M.J. A rapidly convergent descent method for minimization. Comput. J. 1963, 6, 163-168.
43. Fu, M.C.; Hu, J.; Marcus, S.I. Model-based randomized methods for global optimization. In Proceedings of the 17th International Symposium on Mathematical Theory of Networks and Systems, Kyoto, Japan, 24-28 July 2006.
44. Grippo, L.; Lampariello, F.; Lucidi, S. A truncated Newton method with nonmonotone line search for unconstrained optimization. J. Optim. Theory Appl. 1989, 60, 401-419.
45. Oldenhuis, R.P.S. Extended Cube Function; Mathworks: Natick, MA, USA, 2009.
46. Pintér, J. Global Optimization in Action: Continuous and Lipschitz optimization: Algorithms, Implementations and Applications; Springer Science & Business Media: Berlin, Germany; Heidelberg, Germany, 1995; Volume 6.
47. Schumer, M.; Steiglitz, K. Adaptive step size random search. Autom. Control IEEE Trans. 1968, 13, 270-276.
48. Hartman, J.K. Some experiments in global optimization. Nav. Res. Logist. Q. 1973, 20, 569-576.
49. Griewank, A.O. Generalized descent for global optimization. J. Optim. Theory Appl. 1981, 34, 11-39.
50. Rastrigin, L. Systems of Extremal Control; Nauka: Moscow, Russia, 1974.
51. Rosenbrock, H.H. An automatic method for finding the greatest or least value of a function. Comput. J. 1960, 3, 175-184.
52. Silagadze, Z. Finding two-dimensional peaks. Phys. Part. Nucl. Lett. 2007, 4, 73-80.
53. Dixon, L.C.W.; Szegö, G.P. (Eds.) Towards Global Optimisation 2; North-Holland Publishing:Amsterdam, The Netherlands, 1978.
54. Rahnamayan, S.; Tizhoosh, H.R.; Salama, M.M. A novel population initialization method for accelerating evolutionary algorithms. Comput. Math. Appl. 2007, 53, 1605-1614.
55. Dolan, E.D.; Moré, J.J. Benchmarking optimization software with performance profiles. Math. Program. 2002, 91, 201-213.