Evolutionary algorithms for continuous-space optimisation
From a global viewpoint, evolutionary algorithms (EAs) working on continuous search-
spaces can be regarded as homogeneous Markov chains (MCs) with discrete time and …
spaces can be regarded as homogeneous Markov chains (MCs) with discrete time and …
Theoretical analysis of the convergence property of a basic pigeon-inspired optimizer in a continuous search space
Y Zhang, H Huang, H Wu, Z Hao - Science China Information Sciences, 2019 - Springer
The pigeon-inspired optimization (PIO) algorithm is a newly presented swarm intelligence
optimization algorithm inspired by the homing behavior of pigeons. Although PIO has …
optimization algorithm inspired by the homing behavior of pigeons. Although PIO has …
[图书][B] Theoretical Analysis of Continuous Evolutionary Algorithms
For each t= 0, 1, 2,..., let Pt be the random variable'(best individual from) EA population at
iteration t'. Then {Pt} t≥ 0 is a stochastic process on n. We also define a distance d: n←+ 0 …
iteration t'. Then {Pt} t≥ 0 is a stochastic process on n. We also define a distance d: n←+ 0 …
[PDF][PDF] Stochastic Modeling of Continuous Evolutionary Algorithms
Evolutionary algorithms (EAs) acting on continuous space require a more sophisticated
modeling than their discrete counterparts. Sharing with classical theory of evolution …
modeling than their discrete counterparts. Sharing with classical theory of evolution …