Theoretical analysis of garden balsam optimization algorithm
Open Access
- 8 May 2022
- journal article
- research article
- Published by Taylor & Francis in Systems Science & Control Engineering
- Vol. 10 (1) , 488-495
Abstract
Garden balsam optimization (GBO) is a new proposed evolutionary algorithm based on swarm intelligence. Convergence and time complexity analyses are very important in evolutionary computation, but the research on GBO is still blank. Same as other evolutionary algorithms, the optimization process of the GBO algorithm can be regarded as a Markov process. In this paper, a Markov stochastic model of the GBO algorithm is defined and used to prove the convergence of GBO algorithm. Finally, the approximation region of the estimated convergence time of GBO algorithm is calculated, which characterizes the evolution of the evolutionary process of the proposed algorithm.Keywords
Funding Information
- Key specialized research and development breakthrough of Henan province (222102320456)
- National Key R&D Program of China (2018YFB1308800)
This publication has 20 references indexed in Scilit:
- Runtime analysis of the (1 + 1) EA on computing unique input output sequencesInformation Sciences, 2014
- Multiplicative Drift AnalysisAlgorithmica, 2012
- Some techniques for analyzing time complexity of evolutionary algorithmsTransactions of the Institute of Measurement and Control, 2011
- Analysis of the $(1+1)$-EA for Finding Approximate Solutions to Vertex Cover ProblemsIEEE Transactions on Evolutionary Computation, 2009
- A new approach to estimating the expected first hitting time of evolutionary algorithmsArtificial Intelligence, 2008
- Time complexity of evolutionary algorithms for combinatorial optimization: A decade of resultsInternational Journal of Automation and Computing, 2007
- Towards an analytic framework for analysing the computation time of evolutionary algorithmsArtificial Intelligence, 2003
- From an individual to a population: an analysis of the first hitting time of population-based evolutionary algorithmsIEEE Transactions on Evolutionary Computation, 2002
- On the analysis of the (1+1) evolutionary algorithmTheoretical Computer Science, 2002
- Drift analysis and average time complexity of evolutionary algorithmsArtificial Intelligence, 2001