2015
DOI: 10.1109/tcyb.2014.2361731
|View full text |Cite
|
Sign up to set email alerts
|

Evolving Transport Networks With Cellular Automata Models Inspired by Slime Mould

Abstract: Man-made transport networks and their design are closely related to the shortest path problem and considered amongst the most debated problems of computational intelligence. Apart from using conventional or bio-inspired computer algorithms, many researchers tried to solve this kind of problem using biological computing substrates, gas-discharge solvers, prototypes of a mobile droplet, and hot ice computers. In this aspect, another example of biological computer is the plasmodium of acellular slime mould Physar… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
24
0

Year Published

2015
2015
2019
2019

Publication Types

Select...
5
3

Relationship

2
6

Authors

Journals

citations
Cited by 41 publications
(24 citation statements)
references
References 44 publications
0
24
0
Order By: Relevance
“…Increasing the number of states in automaton could make model more realistic however fine-granular parallelism with a large number of node states leads to increased time consumption during modelling. The time consumption could be reduced when cellular automata models of Physarum are implemented in hardware [62][63][64]. We did not consider cellular automata as truly alternative models because they usually focus on the morphology of the patterns and their qualitative dynamics rather then quantitative transitions that are characteristic for supply chains.…”
Section: Discussionmentioning
confidence: 99%
“…Increasing the number of states in automaton could make model more realistic however fine-granular parallelism with a large number of node states leads to increased time consumption during modelling. The time consumption could be reduced when cellular automata models of Physarum are implemented in hardware [62][63][64]. We did not consider cellular automata as truly alternative models because they usually focus on the morphology of the patterns and their qualitative dynamics rather then quantitative transitions that are characteristic for supply chains.…”
Section: Discussionmentioning
confidence: 99%
“…The different modeling approaches have, also, various implementations, from the purely spatial CA models to mathematical representations of flux canalization, oscillatory behavior, two-variable Oregonator model of Belousov-Zhabotinsky (BZ) medium, and path length as found in literature [16][17][18][20][21][22][23][24][25][26][27].…”
Section: Cellular Automata Basicsmentioning
confidence: 99%
“…Recently, cellular automata (CA) based image encryption methods have been presented because of the capacity of parallel calculation and high security. CA are dynamical systems on finite state sets [33][34][35]. Pseudorandom number obtained by CA, which plays a very important role in image encryption.…”
Section: Introductionmentioning
confidence: 99%
“…">MonospectralEIs encrypted by linear CA and hyper-chaotic system 2.2.1. M-sequence generated by linear CA CA can offer significant benefit over existing algorithms [33,34]. In a one-dimensional (1D), two-state, three-site neighbourhood CA, where the next state of a cell is updated according to its neighborhood, the value of each cell is 0 or 1.…”
mentioning
confidence: 99%