A chaotic particle swarm optimization exploiting a virtual quartic objective function based on the personal and global best solutions
DOI10.1016/j.amc.2013.03.029zbMath1291.90328OpenAlexW1972892829MaRDI QIDQ2453297
Tetsuzo Tanino, Keiji Tatsumi, Takeru Ibuki
Publication date: 6 June 2014
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2013.03.029
snap-back repellermetaheuristicschaotic systemparticle swarm optimizationsteepest descent methodcontinuous global optimization
Abstract computational complexity for mathematical programming problems (90C60) Nonconvex programming, global optimization (90C26) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (5)
Cites Work
- Unnamed Item
- Unnamed Item
- Chaos embedded particle swarm optimization algorithms
- Chaos generator exploiting a gradient model with sinusoidal perturbations for global optimization
- Euler's finite difference scheme and chaos in \(R^ n\)
- Global optimization using a synchronization of multiple search points autonomously driven by a chaotic dynamic model
- Snap-back repellers imply chaos in \(\mathbb{R}^n\)
- An improved version of the Marotto theorem
- A hybrid method of chaotic particle swarm optimization and linear interior for reactive power optimisation
- Improved particle swarm optimization combined with chaos
- Particle Swarm Optimization
This page was built for publication: A chaotic particle swarm optimization exploiting a virtual quartic objective function based on the personal and global best solutions