Efficient fractal-based mutation in evolutionary algorithms from iterated function systems

DOI10.1016/j.cnsns.2017.08.010OpenAlexW2751670493MaRDI QIDQ2205722

Yanyan Li

Publication date: 21 October 2020

Published in: Communications in Nonlinear Science and Numerical Simulation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cnsns.2017.08.010

zbMATH Keywords

fractalsevolutionary programmingiterated function systemsmutation procedures design

Mathematics Subject Classification ID

General and overarching topics; collections (00-XX)

Related Items (2)

Hybrid L-systems-diffusion limited aggregation schemes ⋮ Multi-fractal multi-resolution structures from DLA -- strange attractors hybrids

Cites Work

• Particle swarm optimization with chaotic opposition-based population initialization and stochastic search technique
• A chaos-based evolutionary algorithm for general nonlinear programming problems
• Chaos embedded particle swarm optimization algorithms
• Chaotic harmony search algorithms
• Evolution strategies. A comprehensive introduction
• Chaos optimization algorithms based on chaotic maps with different probability distribution and search speed for global optimization
• Iterated function systems and the global construction of fractals
• Period Three Implies Chaos
• Chaos in Dynamical Systems
• A FRACTAL VALUED RANDOM ITERATION ALGORITHM AND FRACTAL HIERARCHY
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Efficient fractal-based mutation in evolutionary algorithms from iterated function systems