<s>
A	O
cellular	B-Algorithm
evolutionary	I-Algorithm
algorithm	I-Algorithm
(	O
cEA	O
)	O
is	O
a	O
kind	O
of	O
evolutionary	B-Algorithm
algorithm	I-Algorithm
(	O
EA	O
)	O
in	O
which	O
individuals	O
cannot	O
mate	O
arbitrarily	O
,	O
but	O
every	O
one	O
interacts	O
with	O
its	O
closer	O
neighbors	O
on	O
which	O
a	O
basic	O
EA	O
is	O
applied	O
(	O
selection	O
,	O
variation	O
,	O
replacement	O
)	O
.	O
</s>
<s>
Cellular	O
EAs	O
are	O
very	O
amenable	O
to	O
parallelism	O
,	O
thus	O
usually	O
found	O
in	O
the	O
literature	O
of	O
parallel	B-Algorithm
metaheuristics	I-Algorithm
.	O
</s>
<s>
In	O
this	O
way	O
,	O
large	O
time	O
reductions	O
can	O
be	O
obtained	O
when	O
running	O
cEAs	O
on	O
FPGAs	B-Architecture
or	O
GPUs	B-Architecture
.	O
</s>
