Abstract
The real-valued satin bowerbird optimization (SBO) is a novel bio-inspired algorithm which imitates the ‘male-attracts-the-female for breeding’ principle of the specialized stick structure mechanism of satin birds. SBO has achieved success in congestion management, accurate software development effort estimation. In this paper, a complex-valued encoding satin bowerbird optimization algorithm (CSBO) is proposed aiming to enhance the global exploration ability. The idea of complex-valued coding and finds the optimal one by updating the real and imaginary parts value. With Complex-valued coding increase the diversity of the population, and enhance the global exploration ability of the basic SBO algorithm. The proposed CSBO optimization algorithm is compared against SBO and other state-of-art optimization algorithms using 20 benchmark functions. Simulation results show that the proposed CSBO can significantly improve the convergence accuracy and convergence speed of the original algorithm.
Access provided by CONRICYT-eBooks. Download conference paper PDF
Similar content being viewed by others
Keywords
- Complex-valued encoding
- Satin bowerbird optimization
- Benchmark functions
- Motor parameter identification
1 Introduction
Metaheuristics algorithm have become very popular over the past decade. This popularity is due to several key reasons: flexibility, lack of a gradient mechanism, simple structure and easy-to-understand features. The most popular of which is the genetic algorithm (GA) [1], which simulates Darwin’s evolutionary theory, the principle is that optimization is a set of stochastic solutions for specific problems. In the case of the evaluation objective function, it updates the variables according to their fitness values. Similarly, there are many evolutionary algorithms, such as Differential Evolution (DE) [2]. These are evolutionary algorithms. The second type of algorithms are the ecosystem simulation algorithms, including Biogeography-Based Optimization (BBO) [3], Weed Colonization Algorithm (WCA).
While the third group are swarm intelligence algorithms, which representative are Particle Swarm Optimization (PSO) [4] algorithm, Ant Colony Optimization (ACO) [5]. There are some other swarm intelligent algorithms, such as, Artificial Bee Colony (ABC) algorithm [6], Bat Algorithm (BA) [7], Cuckoo Search (CS) algorithm [8], Satin bowerbird optimizer (SBO) [9].
The remainder of this paper is organized as follows: Sect. 2 discusses the basic principles of the complex-valued encoding satin bower bird optimizer (CSBO) Algorithm. Section 3 tests the performance of the algorithm using standard test functions and discusses the experimental results of standard test functions. Section 4 uses the CSBO algorithm to solve motor parameter identification problem and compare it with other algorithms. Finally, Sect. 4 contains some conclusions and future research directions.
2 Complex-Valued Satin Bower Bird Optimizer (CSBO)
2.1 Initialize the Complex-Valued Encoding Population
Let the range of the function argument be interval \( [\mathop {\text{var} }\nolimits_{{R{ \text{min} }}} ,\mathop {\text{var} }\nolimits_{{R{ \text{max} }}} ] \). Randomly generate n complex modulus \( \mathop \rho \nolimits_{n} \) and the amplitude \( \mathop \theta \nolimits_{n} \), the resulting modulus vector satisfies the following relation.
In Eq. (1), \( \mathop {\text{var} }\nolimits_{{R{ \text{max} }}} \) denotes the upper bound of the real part and \( \mathop {\text{var} }\nolimits_{{R{ \text{min} }}} \) denotes the lower bound of the real part. \( \mathop {\text{var} }\nolimits_{\text{Imax}} \) denotes the upper bound of the imaginary part, which is set as \( 2\pi \), \( \mathop {\text{var} }\nolimits_{\text{Imin}} \) denotes the lower bound of the imaginary part, and is set to \( - 2\pi \). The n real and imaginary parts are assigned to the real and virtual genes of the bower according to produce a bird’s bower.
The Updating Method of CSBO
In Eq. (2), \( \mathop X\nolimits_{Rn} \) is nth real parts bower or solution vector. \( \mathop X\nolimits_{R\,elite} \) represents the real parts position of the elite. The value \( \mathop X\nolimits_{Rj} \) is calculated by the roulette wheel procedure. \( \mathop {\text{var} }\nolimits_{{R{ \text{max} }}} \) and \( \mathop {\text{var} }\nolimits_{{R{ \text{min} }}} \) mean the upper and lower bounds of the real part. \( \mathop x\nolimits_{In} \) is nth imaginary parts bower or solution vector. \( \mathop x\nolimits_{Ielite} \) Represents the imaginary parts position of the elite. The value \( \mathop x\nolimits_{Ij} \) is calculated by the roulette wheel procedure. \( \mathop {\text{var} }\nolimits_{\text{Imax}} \) and \( \mathop {\text{var} }\nolimits_{\text{Imin}} \) mean the upper and lower bounds of the real part.
Bower Mutation
In Eq. (4), the real and imaginary parts of the bird’s bower position obey normal distribution N. \( \mathop {\text{var} }\nolimits_{\text{Imax}} \) and \( \mathop {\text{var} }\nolimits_{\text{Imin}} \) mean the upper and lower bounds of the real part. \( \mathop {\text{var} }\nolimits_{\text{Imax}} \) and \( \mathop {\text{var} }\nolimits_{\text{Imin}} \) mean the upper and lower bounds of the virtual part.
Fitness Calculation
In order to solve the fitness function, the complex-valued of bower must be converted into a real number, the number of modulo as the size of the real number, the symbol determined by the amplitude. The specific approach is shown in Eqs. (5) and (6)
where \( \mathop \rho \nolimits_{n} \) denotes the nth multidimensional modulus, \( X_{Rn} \) and \( X_{Ln} \) denote the real and imaginary parts of the complex modulus, respectively, and \( X_{n} \) is the transformed real number independent variable.
3 Experimental Results and Discussion
3.1 Simulation Platform
All calculations run in Matlab R2016a. The CPU is Intel i5 processor. The operating system is win10.
3.2 Compare Algorithm Parameter Settings
We have chosen five classical optimization algorithms to compare with CSBO, including the artificial bee colony optimization algorithm [6], bat algorithm [7], Cuckoo search optimizer (CS) [8] and the original version Satin Bowerbird Optimization algorithm [9].
3.3 Benchmark Test Functions
In this section, the CSBO algorithm is based on 20 Standard test functions. These 20 reference functions are classical functions used by many researchers. In spite of the simplicity, we chose these test functions to compare our results with the current heuristic results. These reference functions are listed in Table 1, where Dim represents the dimension of the function, range is the boundary of the function search space (Figs. 1 and 2).
The results of the standard test function are shown in Table 2. It can be observed that the accuracy of the CSBO algorithm exceeds that of other algorithms. From the convergence graph, we can see that the convergence speed of the CSBO algorithm is faster than other algorithms. The variance map shows that the CSBO algorithm results are stable. Summary, the experimental results in this paper demonstrates that CSBO shows competitive results among the three benchmark functions and outperforms other well-known algorithms and points out that CSBO has better in more other kinds of algorithms. The next section examines the CSBO solution to engineering problems.
4 Conclusions
This paper a complex-valued encoding satin bowerbird optimization algorithm (CSBO) is proposed. This algorithm introduces the idea of complex-valued coding and finds the optimal one by updating the real and imaginary parts value. The proposed CSBO optimization algorithm is compared against real-valued SBO and other bio-inspired optimization algorithms using 3 standard test functions including unimodal and multimodal functions, induction motor parameter identification and p-value test. Results show that the proposed CSBO can significantly improve the performance metrics. Future research focuses on the complex-valued satin bowerbird optimizer (CSBO) algorithm is used in combinatorial optimization, engineering optimization and other applied fields.
References
Goldberg, D.E., Holland, J.H.: Genetic algorithms and machine learning. Mach. Learn. 3, 95–99 (1988)
Storn, R., Price, K.: Differential evolution–a simple and efficient heuristic for global optimization over continuous spaces. J. Glob. Optim. 11, 341–359 (1997)
Simon, D.: Biogeography-based optimization. IEEE Trans. Evol. Comput. 12, 702–713 (2008)
Kennedy, J.: Particle swarm optimization. In: Sammut, C., Webb, G.I. (eds.) Encyclopedia of machine learning, pp. 760–766. Springer, Boston (2011). https://doi.org/10.1007/978-0-387-30164-8_630
Dorigo, M., Birattari, M., Stutzle, T.: Ant colony optimization. IEEE Comput. Intell. Mag. 1, 28–39 (2006)
Karaboga, D., Basturk, B.: A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm. J. Glob. Optim. 39, 459–471 (2006)
Yang, X.-S.: A new metaheuristic bat-inspired algorithm. In: González, J.R., Pelta, D.A., Cruz, C., Terrazas, G., Krasnogor, N. (eds.) Nature Inspired Cooperative Strategies for Optimization (NICSO 2010). SCI, vol. 284, pp. 65–74. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-12538-6_6
Yang, X.-S., Deb, S.: Cuckoo search via Lévy flights. In: World Congress on Nature Biologically Inspired Computing, NaBIC 2009. IEEE (2009)
Moosavi, S.H.S., Bardsiri, V.K.: Satin bowerbird optimizer: a new optimization algorithm to optimize ANFIS for software development effort estimation. Eng. Appl. Artif. Intell. 60, 1–15 (2017)
Acknowledgment
This work is supported by National Science Foundation of China under Grants No. 61563008, 61463007, and by Project of Guangxi Natural Science Foundation under Grant No. 2016GXNSFAA380264.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this paper
Cite this paper
Zhang, S., Zhou, Y., Luo, Q., Abdel-Baset, M. (2018). A Complex-Valued Encoding Satin Bowerbird Optimization Algorithm for Global Optimization. In: Huang, DS., Gromiha, M., Han, K., Hussain, A. (eds) Intelligent Computing Methodologies. ICIC 2018. Lecture Notes in Computer Science(), vol 10956. Springer, Cham. https://doi.org/10.1007/978-3-319-95957-3_89
Download citation
DOI: https://doi.org/10.1007/978-3-319-95957-3_89
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-95956-6
Online ISBN: 978-3-319-95957-3
eBook Packages: Computer ScienceComputer Science (R0)