Stability Analysis of the Bat Algorithm Described as a Stochastic Discrete-Time State-Space System
The main problem with the soft-computing algorithms is a determination of their parameters. The tuning rules are very general and need experiments during a trial and error method. The equations describing the bat algorithm have the form of difference equations, and the algorithm can be treated as a...
Saved in:
Main Author: | Janusz Piotr Paplinski |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2018-01-01
|
Series: | Complexity |
Online Access: | http://dx.doi.org/10.1155/2018/9837462 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
New Results on Robust Stability and Stabilization of Linear Discrete-Time Stochastic Systems with Convex Polytopic Uncertainties
by: P. Niamsup, et al.
Published: (2013-01-01) -
Losslessness of Nonlinear Stochastic Discrete-Time Systems
by: Xikui Liu, et al.
Published: (2015-01-01) -
Discrete Bat Algorithm for Optimal Problem of Permutation Flow Shop Scheduling
by: Qifang Luo, et al.
Published: (2014-01-01) -
State Estimation for Discrete-Time Stochastic Neural Networks with Mixed Delays
by: Liyuan Hou, et al.
Published: (2014-01-01) -
Hopf Bifurcation Analysis for a Stochastic Discrete-Time Hyperchaotic System
by: Jie Ran, et al.
Published: (2015-01-01)