Elsevier

Neurocomputing

Volume 177, 12 February 2016, Pages 147-157
Neurocomputing

Opposition-based krill herd algorithm with Cauchy mutation and position clamping

https://doi.org/10.1016/j.neucom.2015.11.018Get rights and content

Abstract

Krill herd (KH) has been proven to be an efficient algorithm for function optimization. For some complex functions, this algorithm may have problems with convergence or being trapped in local minima. To cope with these issues, this paper presents an improved KH-based algorithm, called Opposition Krill Herd (OKH). The proposed approach utilizes opposition-based learning (OBL), position clamping (PC) and Cauchy mutation (CM) to enhance the performance of basic KH. OBL accelerates the convergence of the method while both PC and heavy-tailed CM help KH escape from local optima. Simulations are implemented on an array of benchmark functions and two engineering optimization problems. The results show that OKH has a good performance on majority of the considered functions and two engineering cases. The influence of each individual strategy (OBL, CM and PC) on KH is verified through 25 benchmarks. The results show that the KH with OBL, CM and PC operators, has the best performance among different variants of OKH.

Introduction

Inspired by nature, a variety of modern intelligent algorithms have been developed and applied to solve optimization problems. Some of them, like cuckoo search (CS) [1], [2], [3], [4], [5], biogeography-based optimization (BBO) [6], [7], [8], [9], [10], [11], [12], [13], artificial bee colony (ABC) [14], [15], genetic algorithm (GA) [16], genetic programming (GP) [17], stud GA (SGA) [18], [19], differential evolution (DE) [20], [21], [22], [23], [24], [25], ant lion optimizer (ALO) [26], chicken swarm optimization (CSO) [27], wolf search algorithm (WSA) [28], multi-verse optimizer (MVO) [29], earthworm optimization algorithm (EWA) [30], grey wolf optimizer (GWO) [31], [32], firefly algorithm (FA) [33], [34], [35], dragonfly algorithm (DA) [36], harmony search (HS) [37], [38], [39], [40], [41], bird swarm algorithm (BSO) [42], moth-flame optimization (MFO) [43], animal migration optimization (AMO) [44], particle swarm optimization (PSO) [45], [46], [47], [48], ant colony optimization (ACO) [49], bat algorithm (BA) [50], [51], [52], [53], [54], have solved several complicated challenging problems that are hard to deal with by traditional optimization techniques. Among these algorithms, krill herd (KH) method [55], [56], [57] has been studied extensively due to its promising performance for solving most complex problems. KH was first proposed by Gandomi and Alavi by the idealization of communicating and foraging behaviors of krill swarms [55]. KH performed well on various optimization problems [55]. However, in some cases, it might not be capable of escaping from local minima. In order to decrease the influence of this problem for KH, this paper proposes different variants of KH algorithm using opposition-based learning (OBL), position clamping (PC) and Cauchy mutation (CM). The main idea of OBL is to search for a better candidate solution through the simultaneous consideration of a solution and its opposite that is closer to the global optimum. OBL can successfully handle this task by updating the other half krill according to the previous ones following its basic theory. Consequently, a faster convergence can be provided for the KH method. The heavy-tailed CM and PC help the krill not trap into the local optima. Through different experiments, the KH together with OBL, CM and PC operators performs the best among various OKHs. Experimental simulations on 25 benchmark functions and two engineering optimization problems show that OKH performs well on the majority of benchmark functions and engineering problems.

The remainder of this paper is organized as follows. The next section introduces the main process of the basic KH and OBL theory. Section 3 proposes an improved OKH model by combination of KH, CM operator and PC operator. Then, in Section 4, a series of comparison experiments on various benchmarks and two engineering cases are conducted. The final section provides our concluding remarks and points out our future work orientation.

Section snippets

Krill herd

In computer science, KH [55] is a probabilistic technique for solving computational problems. It is a kind of swarm intelligence algorithms that take advantage of the evolving behaviors of krill individuals. It is based on the idealization of the krill swarms when hunting for food and communicating with each other. The KH method repeats the implementation of the three movements and takes search directions that proceed to the best solution. The behavior of krill is idealized into three actions

Improving KH using OBL

This study is aimed at improving the performance of KH by combining it with OBL, CM, and PC operators. The OBL method forces krill to move toward the best solutions, while CM and PC operators are well capable of adding the diversity of the population. These two operators also provide an effective balance between exploration and exploitation.

Simulation results

In this section, the OKH method is evaluated from various aspects using a series of experiments on benchmark functions (see Table 1) and two engineering optimization problems. In order to obtain fair results, all the implementations are conducted under the same conditions as discussed in [73]. More detailed descriptions of all the benchmarks can be referred as [6], [74]. Note that, without special clarification, the dimensions of function is set to 20. Population size and maximum generation are

Conclusion

This paper presented various OKH methods for solving the continuous and discrete optimization problems. In OKH, first of all, a half population of candidate solutions is randomly initialized. And then, the rest half population is initialized as per the first half population based on the OBL theory. After initialization, new solutions are created by applying the KH and OBL process. By simultaneous consideration of the krill in the KH process and OBL process, OBL can provide a higher chance of

Acknowledgments

This work was supported by Jiangsu Province Science Foundation for Youths (No. BK20150239) and National Natural Science Foundation of China (No. 61503165).

Gai-Ge Wang obtained his bachelor degree in computer science and technology from Yili Normal University, Yining, Xinjiang, China, in 2007. His master degree was in the field of intelligent planning and planning recognition at Northeast Normal University, Changchun, China. In 2010 he began working on his Ph.D for computational intelligence and its applications at Changchun Institute of Optics, Fine Mechanics and Physics, Chinese Academy of Sciences, Changchun, China. He is currently an associate

References (79)

  • A.H. Gandomi et al.

    Mixed variable structural optimization using firefly algorithm

    Comput. Struct.

    (2011)
  • D. Zou et al.

    Solving 0-1 knapsack problem by a novel global harmony search algorithm

    Appl. Soft Comput.

    (2011)
  • D. Zou et al.

    A novel global harmony search algorithm for reliability problems

    Comput. Ind. Eng.

    (2010)
  • D. Zou et al.

    A novel global harmony search algorithm for task assignment problem

    J. Syst. Softw.

    (2010)
  • A.H. Gandomi et al.

    Krill herd: a new bio-inspired optimization algorithm

    Commun. Nonlinear Sci. Numer. Simulat

    (2012)
  • X. Li et al.

    An opposition-based differential evolution algorithm for permutation flow shop scheduling based on diversity measure

    Adv. Eng. Softw.

    (2013)
  • M. Ventresca et al.

    A diversity maintaining population-based incremental learning algorithm

    Inf. Sci.

    (2008)
  • H. Wang et al.

    Enhancing particle swarm optimization using generalized opposition-based learning

    Inf. Sci

    (2011)
  • A. Rajasekhar et al.

    Design of intelligent PID/PIλDμ speed controller for chopper fed DC motor drive using opposition based artificial bee colony algorithm

    Eng. Appl. Artif. Intel.

    (2014)
  • Q. Wu

    Hybrid forecasting model based on support vector machine and particle swarm optimization with adaptive and Cauchy mutation

    Expert. Syst. Appl.

    (2011)
  • H. Qin et al.

    Multi-objective differential evolution with adaptive Cauchy mutation for short-term multi-objective optimal hydro-thermal scheduling

    Energ. Convers. Manag.

    (2010)
  • G.-G. Wang et al.

    Chaotic krill herd algorithm

    Inf. Sci.

    (2014)
  • L. Guo et al.

    A new improved krill herd algorithm for global numerical optimization

    Neurocomputing

    (2014)
  • X.S. Yang, S. Deb, Cuckoo search via Lévy flights, in: A. Abraham, A. Carvalho, F. Herrera, V. Pai (Eds.), Proceeding...
  • G.-G. Wang et al.

    Hybridizing harmony search algorithm with cuckoo search for global numerical optimization

    Soft Comput.

    (2014)
  • G.-G. Wang et al.

    Chaotic cuckoo search

    Soft Comput.

    (2015)
  • G. Wang et al.

    A hybrid meta-heuristic DE/CS algorithm for UCAV path planning

    J. Inf. Comput. Sci.

    (2012)
  • X. Li et al.

    Enhancing the performance of cuckoo search algorithm using orthogonal learning method

    Neural Comput. Appl.

    (2013)
  • D. Simon

    Biogeography-based optimization

    IEEE Trans. Evol. Comput.

    (2008)
  • S. Saremi et al.

    Biogeography-based optimisation with chaos

    Neural Comput. Appl.

    (2014)
  • G. Wang et al.

    Dynamic deployment of wireless sensor networks by biogeography based optimization algorithm

    J. Sens. Actuator Netw.

    (2012)
  • X. Li et al.

    Multiobjective binary biogeography based optimization for feature selection using gene expression data

    IEEE Trans. Nanobiosci.

    (2013)
  • D. Karaboga et al.

    A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm

    J. Glob. Optim.

    (2007)
  • X. Li et al.

    Self-adaptive constrained artificial bee colony for constrained numerical optimization

    Neural Comput. Appl.

    (2012)
  • D.E. Goldberg

    Genetic Algorithms in Search, Optimization and Machine learning

    (1998)
  • W. Khatib, P. Fleming, The stud GA: a mini revolution?, in: A. Eiben, T. Back, M. Schoenauer, H. Schwefel (Eds.)...
  • R. Storn et al.

    Differential evolution-a simple and efficient heuristic for global optimization over continuous spaces

    J. Glob. Optim.

    (1997)
  • G.-G. Wang et al.

    Hybrid krill herd algorithm with differential evolution for global numerical optimization

    Neural Comput. Appl.

    (2014)
  • G. Wang et al.

    Path planning for uninhabited combat aerial vehicle using hybrid meta-heuristic DE/BBO algorithm

    Adv. Sci. Eng. Med.

    (2012)
  • Cited by (155)

    • Evolved opposition-based Mountain Gazelle Optimizer to solve optimization problems

      2023, Journal of King Saud University - Computer and Information Sciences
    View all citing articles on Scopus

    Gai-Ge Wang obtained his bachelor degree in computer science and technology from Yili Normal University, Yining, Xinjiang, China, in 2007. His master degree was in the field of intelligent planning and planning recognition at Northeast Normal University, Changchun, China. In 2010 he began working on his Ph.D for computational intelligence and its applications at Changchun Institute of Optics, Fine Mechanics and Physics, Chinese Academy of Sciences, Changchun, China. He is currently an associate professor in School of Computer Science and Technology at Jiangsu Normal University, Xuzhou, China. Gai-Ge Wang has published over 50 journal papers and conference papers, and more than 30 papers are indexed by SCI/EI. Furthermore, he is referee of other 50 international journals (Elsevier, IEEE, and Springer). He is a member of the International Society for Metaheuristic Optimization in Science and Technology (ISMOST), Publications Chairs of ISCMI 2015, and International Program Committee Member in more than 30 conferences. His research interests are swarm intelligence, soft computing, evolutionary computation, metaheuristic optimization and its applications in engineering, such as scheduling, path planning.

    Suash Deb specializes in Soft Computing, Nanocomputing, Artificial Intelligence, Bioinformatics & the related fields & has published extensively in these areas on reputed SCIindexed journals in these areas. In the year 2013, his two manuscripts entitled i) “Multiobjective Cuckoo Search for Design Optimization”, published in Elsevier Publications “Computers & Operations Research” & ii) “Coupled Eagle Strategy and Differential Evolution for Unconstrained and Constrained Global Optimization” published in Elsevier Publications “Computers & Mathematics with Applications” were awarded one of the Top 25 Hottest (Most Downloaded) Articles (Engineering Category by Elsevier. Apart from journals. His research efforts were also found mention in “Wikipedia, the online Encyclopedia”. He has been the recipient of Bharat Excellence Award, Albert Einstein International Award for Scientific Excellence and also Rajiv Gandhi Education Excellence Award (from Intl. Business Council). Indian Solidarity Council bestowed upon him the Global Education Excellence Award & Certificate of Education Excellence. In 2015, he was awarded the “Pride of International Education Excellence Award” by Intellectual People and Economic Growth Association at Indo-Nepal Friendship Summit, held in Kathmandu. He also held a number of prestigious fellowships, including i) UNDP Fellowship for visiting Stanford University, USA, ii) CIMPA-INRIA-UNESCO Fellowship for Visiting Intl. Centre for Pure & Applied Mathematics, Nice, France, iii) ICTP Fellowship for visiting Intl. Centre for Theoretical Physics, Trieste, Italy etc. He has served as the Asian Expert of Advanced Research Project Agency (ARPA), Dept. of Defense, Federal Govt. of USA. He is currently on the Editorial Board of Numerous Intl. journals. His experience consists of academics as well as industry with more emphasis on the former. Currently belonging to CIT, Ranchi, he served reputed institutions like Natl. Centre for Knowledge Based Computing, Kolkata, National Inst. of Science & Technology as well as C.V. Raman College of Engineering, Orissa. He is the Editor-in-Chief of International Journal of Soft Computing & Bioinformatics, Regional Editor of Neural Computer & Applications & Advisory Editor of a no. of other journals. He was the Regional Editor of IEEE Robotics & Automation. He was elected the President of the International Neural Network Society (INNS)-India Regional Chapter and also served as the Secretary of the IEEE Computational Intelligence Society, Calcutta Chapter. He had also been the Chair of the Task Force of Business Intelligence & Knowledge Management, IEEE Computational Intelligence Society. He is the General Chair of Intl. Symposium on Computational & Business Intelligence (ISCBI15), the flagship event of INNS-India Regional Chapter, to be held in Bali, Indonesia this year. He is also the General Chair of ISCMI15, the event to commemorate the 5th anniversary of INNS-India, to be held in Hong Kong this year. He had been the General Chairs of ISCBI12 & ISCBI13 as well as of ISCMI14, held in New Delhi. Apart from these, he has been the General Chair of many intl. conferences in the field of artificial intelligence, computational intelligence, nanocomputing e.g. Intl. Conference on Intelligent Network & Computing (ICINC13), held in Dubai, Intl. Conference on NanoScience, Technology & Societal Implications (NSTSI12), held in Bhubaneswar etc. He was also the Technical Chair of numerous international events & traveled widely across the globe to deliver keynote address/plenary talk/tutorial talk etc. He is listed in a no. of Who’sWho.

    Amir H. Gandomi is the pioneer of Krill Herd Algorithm. He was selected as an elite in 2008 by Iranian National Institute of Elites. He used to be a lecturer in Tafresh University and serve as a researcher in National Elites Foundation. He is currently a researcher in Department of Civil Engineering at the University of Akron, OH. Amir Hossein Gandomi has published over 70 journal papers and several discussion papers, conference papers and book chapters. He has two patents and has published three books in Elsevier. His research interests are Metaheuristics modeling and optimization.

    Amir H. Alavi is a senior researcher at the Department of Civil & Environmental Engineering, Michigan State University (MSU), MI, USA. His area of expertize includes energy harvesting, sensor technology, big data analysis, artificial intelligence, statistical and probabilistic methods, and metaheuristic modeling and optimization. He has published three books and over one hundred research papers in book chapters, indexed journals, and conference proceedings, along with two patents. He is on the editorial board of several journals. He is the pioneer of Krill Herd (KH) optimization algorithm.

    View full text