A continuos state cellular automata algorithm for global optimization
Seck Tuoh Mora, Juan Carlos
2021
Seck Tuoh, J. Hernández, N. Lagos, P. Medina, J. Zúñiga, N.
Abstract
A continuos state cellular automata algorithm for global optimizationCellular automata are capable of developing complex venhavior based on simple local interactions between their elements. Some of there caracteristics have been used on propose and improve metaheuristics for global optimization; however, the properties offered by the evolution rules in cellular automata have not yet been used directly in optimizatios tasks.
Artículos relacionados
Elementary cellular automaton Rule 110 explained as a block substitution system
Unconventional invertible behaviors in reversible one-dimensional cellular automata.
How to Make Dull Cellular Automata Complex by Adding Memory: Rule 126 Case Study
Pair Diagram and Cyclic Properties Characterizing the Inverse of Reversible Automata
Modeling a Nonlinear Liquid Level System by Cellular Neural Networks
Complex Dynamics Emerging in Rule 30 with Majority Memory
Reproducing the Cyclic Tag System Developed by Matthew Cook with Rule 110 Using the Phases f(i-)1.