New Methods and Paradigms for Modeling Dynamic Processes Based on Cellular Automata

Bilan, Stepan; Bilan, Mykola; Motornyuk, Ruslan

doi:10.4018/978-1-7998-2649-1

Cited by 6 publications

(9 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The state change can depend on both the current state of each cell and its neighboring cells. With such simple dynamics, cellular automata can create periodic, chaotic, or complex global behavior ( Wolfram, 2002 ; McIntosh, 2009 ; Adamatzky, 2010 ; Bilan, Bilan & Motornyuk, 2020 ).…”

Section: Global-local Neighborhood Search Algorithm For the Fjspmentioning

confidence: 99%

A global-local neighborhood search algorithm and tabu search for flexible job shop scheduling problem

Serna¹,

Seck-Tuoh-Mora²,

Medina-Marín³

et al. 2021

PeerJ Computer Science

View full text Add to dashboard Cite

The Flexible Job Shop Scheduling Problem (FJSP) is a combinatorial problem that continues to be studied extensively due to its practical implications in manufacturing systems and emerging new variants, in order to model and optimize more complex situations that reflect the current needs of the industry better. This work presents a new metaheuristic algorithm called the global-local neighborhood search algorithm (GLNSA), in which the neighborhood concepts of a cellular automaton are used, so that a set of leading solutions called smart-cells generates and shares information that helps to optimize instances of the FJSP. The GLNSA algorithm is accompanied by a tabu search that implements a simplified version of the Nopt1 neighborhood defined in Mastrolilli & Gambardella (2000) to complement the optimization task. The experiments carried out show a satisfactory performance of the proposed algorithm, compared with other results published in recent algorithms, using four benchmark sets and 101 test problems.

show abstract

Section: Global-local Neighborhood Search Algorithm For the Fjspmentioning

confidence: 99%

A global-local neighborhood search algorithm and tabu search for flexible job shop scheduling problem

Serna¹,

Seck-Tuoh-Mora²,

Medina-Marín³

et al. 2021

PeerJ Computer Science

View full text Add to dashboard Cite

show abstract

“…Today, the development of scientific research in the field of information technology, as well as scientific experiments using modeling, is increasingly being implemented on the basis of cellular automata (CA), which are built on new paradigms and models of their representation [2], [3], [7], [9], [15], [17]. CAs are a physical space of discrete elements that change their states in time, and, therefore, the state of the entire CA (the entire discrete physical space) changes in time.…”

mentioning

confidence: 99%

“…CAs are a physical space of discrete elements that change their states in time, and, therefore, the state of the entire CA (the entire discrete physical space) changes in time. Such changes in CA states in time enable researchers to simulate various dynamic processes, as well as achieve and predict system states based on various initial settings [2], [9], [16], [24]. One of these works, considering the primitive behavior of cell colonies, is the Game of Life, which was proposed by Conway [16].…”

mentioning

confidence: 99%

“…In modern literature, the evolution of two-dimensional cellular automata is represented by a sequence of two-dimensional arrays, which complicates the analysis of the dynamics of changes in the CA states over time [1], [2], [9], [7], [17]. Behavioral schemes in modeling the dynamics of changes in the states of various systems and the interaction of elements of such systems are mainly considered.…”

mentioning

confidence: 99%

“…This approach often gives a misconception about the behavior of the system [1], [13], [19], [22], [25]. Therefore, new effective forms of representing the evolution of two-dimensional cellular automata are now being sought [7], [9].…”

mentioning

confidence: 99%

See 2 more Smart Citations

Evolution of Two-Dimensional Cellular Automata. New Forms of Presentation

Bilan¹

2021

UJIT

Self Cite

View full text Add to dashboard Cite

The paper considers cellular automata and forms of reflection of their evolution. Forms of evolution of elementary cellular automata are known and widely used, which allowed specialists to model different dynamic processes and behavior of systems in different directions. In the context of the easy construction of the form of evolution of elementary cellular automata, difficulties arise in representing the form of evolution of two-dimensional cellular automata, both synchronous and asynchronous. The evolution of two-dimensional cellular automata is represented by a set of states of two-dimensional forms of cellular automata, which complicates the perception and determination of the dynamics of state change. The aim of this work is to solve the problem of a fixed mapping of the evolution of a two-dimensional cellular automaton in the form of a three-dimensional representation, which is displayed in different colors on a two-dimensional image The paper proposes the evolution of two-dimensional cellular automata in the form of arrays of binary codes for each cell of the field. Each time step of the state change is determined by the state of the logical "1" or "0". Moreover, each subsequent state is determined by increasing the binary digit by one. The resulting binary code identifies the color code that is assigned to the corresponding cell at each step of the evolution iteration. As a result of such coding, a two-dimensional color matrix (color image) is formed, which in its color structure indicates the evolution of a two-dimensional cellular automaton. To represent evolution, Wolfram coding was used, which increases the number of rules for a two-dimensional cellular automaton. The rules were used for the von Neumann neighborhood without taking into account the own state of the analyzed cell. In accordance with the obtained two-dimensional array of codes, a discrete color image is formed. The color of each pixel of such an image is encoded by the obtained evolution code of the corresponding cell of the two-dimensional cellular automaton with the same coordinates. The bitness of the code depends on the number of time steps of evolution. The proposed approach allows us to trace the behavior of the cellular automaton in time depending on its initial states. Experimental analysis of various rules for the von Neumann neighborhood made it possible to determine various rules that allow the shift of an image in different directions, as well as various affine transformations over images. Using this approach, it is possible to describe various dynamic processes and natural phenomena.

show abstract

A New Algorithm Inspired on Reversible Elementary Cellular Automata for Global Optimization

et al. 2022

View full text Add to dashboard Cite

This work presents a new global optimization algorithm of functions inspired by the dynamic behavior of reversible cellular automata, denominated Reversible Elementary Cellular Automata Algorithm (RECAA). This algorithm adapts the reversible evolution rules in elementary cellular automata (in one dimension and only with two states) to work with vectors of real values to realize optimization tasks. The originality of RECAA lies in adapting the dynamic of the reversible elementary cellular automata to perform exploration and exploitation actions in the optimization process. This work shows that diversity in cellular automata behaviors (in this case, reversibility) is useful to define new metaheuristics to solve optimization problems. The algorithm is compared with 15 recently published metaheuristics that recognized for their good performance, using 50 test functions in 30, 500, and with a fixed number of dimensions, and the CEC 2022 benchmark suit. Additionally, it is shown that RECAA has been applied in 3 engineering problems. In all the experiments, RECAA obtained satisfactory results. RECAA was implemented in MATLAB, and its source code can be consulted in GitHub. https://github.com/juanseck/RECAA INDEX TERMS Engineering applications, global optimization, metaheuristics, reversible cellular automata.

show abstract

New Methods and Paradigms for Modeling Dynamic Processes Based on Cellular Automata

Cited by 6 publications

References 0 publications

A global-local neighborhood search algorithm and tabu search for flexible job shop scheduling problem

A global-local neighborhood search algorithm and tabu search for flexible job shop scheduling problem

Evolution of Two-Dimensional Cellular Automata. New Forms of Presentation

A New Algorithm Inspired on Reversible Elementary Cellular Automata for Global Optimization

Contact Info

Product

Resources

About