Spatially structured evolutionary algorithms: artificial evolution in space and time
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Buch |
Sprache: | English |
Veröffentlicht: |
Berlin [u.a.]
Springer
2005
|
Schriftenreihe: | Natural computing series
|
Schlagworte: | |
Online-Zugang: | Inhaltsverzeichnis |
Beschreibung: | XIII, 192 S. Ill., graph. Darst. |
ISBN: | 9783540241935 3540241930 |
Internformat
MARC
LEADER | 00000nam a2200000 c 4500 | ||
---|---|---|---|
001 | BV021254668 | ||
003 | DE-604 | ||
005 | 20080116 | ||
007 | t | ||
008 | 051206s2005 gw ad|| |||| 00||| eng d | ||
015 | |a 05,N01,0813 |2 dnb | ||
015 | |a 05,A45,0846 |2 dnb | ||
016 | 7 | |a 973033339 |2 DE-101 | |
020 | |a 9783540241935 |c Pp. : EUR 48.10 (freier Pr.), sfr 82.00 (freier Pr.) |9 978-3-540-24193-5 | ||
020 | |a 3540241930 |c Pp. : EUR 48.10 (freier Pr.), sfr 82.00 (freier Pr.) |9 3-540-24193-0 | ||
024 | 3 | |a 9783540241935 | |
028 | 5 | 2 | |a 11371687 |
035 | |a (OCoLC)62902448 | ||
035 | |a (DE-599)BVBBV021254668 | ||
040 | |a DE-604 |b ger |e rakddb | ||
041 | 0 | |a eng | |
044 | |a gw |c XA-DE-BE | ||
049 | |a DE-703 |a DE-824 |a DE-91G |a DE-384 | ||
050 | 0 | |a QA76.618 | |
082 | 0 | |a 006.3 |2 22 | |
084 | |a SK 870 |0 (DE-625)143265: |2 rvk | ||
084 | |a ST 301 |0 (DE-625)143651: |2 rvk | ||
084 | |a 004 |2 sdnb | ||
084 | |a DAT 718f |2 stub | ||
084 | |a 510 |2 sdnb | ||
100 | 1 | |a Tomassini, Marco |e Verfasser |0 (DE-588)122948084 |4 aut | |
245 | 1 | 0 | |a Spatially structured evolutionary algorithms |b artificial evolution in space and time |c Marco Tomassini |
264 | 1 | |a Berlin [u.a.] |b Springer |c 2005 | |
300 | |a XIII, 192 S. |b Ill., graph. Darst. | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
490 | 0 | |a Natural computing series | |
650 | 4 | |a Evolutionary computation | |
650 | 4 | |a Evolutionary programming (Computer science) | |
650 | 0 | 7 | |a Evolutionärer Algorithmus |0 (DE-588)4366912-8 |2 gnd |9 rswk-swf |
689 | 0 | 0 | |a Evolutionärer Algorithmus |0 (DE-588)4366912-8 |D s |
689 | 0 | |5 DE-604 | |
856 | 4 | 2 | |m Digitalisierung UB Augsburg |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=014575989&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
999 | |a oai:aleph.bib-bvb.de:BVB01-014575989 |
Datensatz im Suchindex
_version_ | 1804135025974706176 |
---|---|
adam_text | Contents
Setting the Stage for Structured Populations
.............. 1
1.1
Useful Definitions for Graphs
............................. 2
1.2
Main Graph Structures of Populations
..................... 5
1.2.1
Island or Multipopulation Models
................... 6
1.2.2
Cellular Models
................................... 7
1.2.3
Other Topologies
.................................. 8
Island Models
............................................. 11
2.1
History and Background
.................................. 11
2.2
Homogeneous and Heterogeneous Islands
................... 14
2.3
Theoretical Results
...................................... 14
2.4
Asynchronous Islands
.................................... 17
Island Models: Empirical Properties
....................... 19
3.1
An Experimental Investigation
............................ 19
3.2
Description of the Test Problems
.......................... 19
3.3
Multipopulation GP Parameters
........................... 20
3.4
Performance Measures and Statistics
....................... 21
3.5
Number of
Subpopulations
and Their Size
.................. 23
3.5.1
Isolated Populations vs. Standard GP
................ 23
3.5.2
Communicating Islands vs. Standard GP
............. 27
3.6
Comparing Communication Topologies
..................... 30
3.7
Migration Parameters
.................................... 33
3.8
Summary of Case Study
.................................. 37
3.9
The Role of Diversity
.................................... 37
3.9.1
Diversity Measures
................................ 38
3.9/2
Experimental Results
.............................. 40
3.9.3
Summary
......................................... 44
3.1.0
Asynchronous Island Models
.............................. 44
3.10.1
Experimental Results
.............................. 46
4
Lattice Cellular Models
.................................... 53
4.1
Takeover Time
.......................................... 54
4.2
Synchronous cEAs
....................................... 55
4.3
The Time Dimension: Asynchronous cEAs
.................. 57
4.4
Models and Their Validation
.............................. 59
4.5
Mathematical Models
.................................... 59
4.5.1
Limitations of Logistic Modeling
.................... 60
4.5.2
The Ring Structure
................................ 62
4.5.3
The Torus Structure
............................... 66
4.6
Experimental Validation
.................................. 70
4.6.1
Ring Structure
.................................... 70
4.6.2
Torus Structure
................................... 73
4.7
Rectangular Toroidal Structures
........................... 76
4.7.1
Validation of the Rectangular Toroidal Models
........ 78
4.8
Varying the Radius
...................................... 79
4.9
Summary
............................................... 80
5
Lattice Cellular Models: Empirical Properties
............. 85
5.1
cGA Case Study
........................................ 85
5.2
Varying the Lattice Shape
................................ 86
5.3
Selection Pressure. Grid Shape and Time
.................. . 87
5.4
Test Suite
.............................................. 88
5.4.1
Discrete Optimization Problems
..............:...... 90
5.4.2
Experimental Analysis
............................. 93
5.4.3
Continuous Optimization Problems
.................. 96
5.4.4
Experimental Analysis
.............................. 97
5.5
Cellular Genetic Programming
............................100
5.5.1
Experimental Results
..............................100
5.5.2
Fitness Evolution
..................................100
5.5.3
Diversity Evolution
................................101
5.6
Summary
...............................................104
6
Random and Irregular Cellular Populations
................107
6.1
Random Graphs
.........................................108
6.2
Selection Intensity in Random Cellular Populations
..........109
6.3
Experimental Results
....................................
Ill
6.4
Small-World Networks
...................................113
6.4.1
Some Graph Statistics
.............................116
6.4.2
The Watts Strogatz Model
.........................118
6.4.3
The
Bara basi-
Albert Model
........................119
6.5
Selection Intensity in Small-World Networks
................120
6.5.1
Watts-Strogatz Model
............................. 120
6.5.2
Barabást
Albert Model
............................122
6.6
Summary
...............................................124
7
Coevolutionary Structured Models
........................125
7.
L W
li
at Is Coevolutiou?
....................................125
7.2
Cooperative Cocvolution
.................................126
7.3
Competitive Coevolution: Hosts and Parasites
...............127
7.4
A Case Study: Coevolution of Cellular Automata
............130
7.4.1
Cellular Automata
.................................131
7.4.2
The Majority Task
................................131
7.5
Artificial Evolution of CAs for the Majority Task
............ 133
7.5.1
Coevolving Uniform CAs for the Majority Task
.......134
7.5.2
Coevolving Nonuniform CAs for the Majority Task
.... 137
7.5.3
Results for the Density Task
........................139
7.6
Summan-
...............................................141
8
Some Nonconventional Models
.............................143
8.1
Nonconventional Island Models
............................144
8.1.1
The Injection Island Model
. . .......................144
8.1.2
Islands with Variable Population Size
................145
8.2
Nonconventional Cellular Models
..........................151
8.2.1
The Patchwork Model
.............................152
8.2.2
Dynamic Neighborhoods in Cellular Evolution Stxategiesl53
A Implementation Notes
.....................................157
A.l Computing Environment
.................................158
A.
1.1
MPI
.............................................158
A.
2
Implementation of Island EAs
.............................159
A.
2.1
Synchronous Islands
...............................159
A.
2.2
Asynchronous Islands
..............................165
A
.2,3
Summary
.........................................168
A.3 Implementation of Lattice Cellular EAs
....................168
A
.3.1
Synchronous Cellular EAs
..........................168
A.
3.2
Asynchronous Cellular EAs
.........................170
A.
4
Performance Measures and Speedup
.......................170
A.
5
A Remark on Pseudorandom Number Generators
............173
References
.....................................................177
Index
..........................................................189
|
adam_txt |
Contents
Setting the Stage for Structured Populations
. 1
1.1
Useful Definitions for Graphs
. 2
1.2
Main Graph Structures of Populations
. 5
1.2.1
Island or Multipopulation Models
. 6
1.2.2
Cellular Models
. 7
1.2.3
Other Topologies
. 8
Island Models
. 11
2.1
History and Background
. 11
2.2
Homogeneous and Heterogeneous Islands
. 14
2.3
Theoretical Results
. 14
2.4
Asynchronous Islands
. 17
Island Models: Empirical Properties
. 19
3.1
An Experimental Investigation
. 19
3.2
Description of the Test Problems
. 19
3.3
Multipopulation GP Parameters
. 20
3.4
Performance Measures and Statistics
. 21
3.5
Number of
Subpopulations
and Their Size
. 23
3.5.1
Isolated Populations vs. Standard GP
. 23
3.5.2
Communicating Islands vs. Standard GP
. 27
3.6
Comparing Communication Topologies
. 30
3.7
Migration Parameters
. 33
3.8
Summary of Case Study
. 37
3.9
The Role of Diversity
. 37
3.9.1
Diversity Measures
. 38
3.9/2
Experimental Results
. 40
3.9.3
Summary
. 44
3.1.0
Asynchronous Island Models
. 44
3.10.1
Experimental Results
. 46
4
Lattice Cellular Models
. 53
4.1
Takeover Time
. 54
4.2
Synchronous cEAs
. 55
4.3
The Time Dimension: Asynchronous cEAs
. 57
4.4
Models and Their Validation
. 59
4.5
Mathematical Models
. 59
4.5.1
Limitations of Logistic Modeling
. 60
4.5.2
The Ring Structure
. 62
4.5.3
The Torus Structure
. 66
4.6
Experimental Validation
. 70
4.6.1
Ring Structure
. 70
4.6.2
Torus Structure
. 73
4.7
Rectangular Toroidal Structures
. 76
4.7.1
Validation of the Rectangular Toroidal Models
. 78
4.8
Varying the Radius
. 79
4.9
Summary
. 80
5
Lattice Cellular Models: Empirical Properties
. 85
5.1
cGA Case Study
. 85
5.2
Varying the Lattice Shape
. 86
5.3
Selection Pressure. Grid Shape and Time
. . 87
5.4
Test Suite
. 88
5.4.1
Discrete Optimization Problems
.:. 90
5.4.2
Experimental Analysis
. 93
5.4.3
Continuous Optimization Problems
. 96
5.4.4
Experimental Analysis
. 97
5.5
Cellular Genetic Programming
.100
5.5.1
Experimental Results
.100
5.5.2
Fitness Evolution
.100
5.5.3
Diversity Evolution
.101
5.6
Summary
.104
6
Random and Irregular Cellular Populations
.107
6.1
Random Graphs
.108
6.2
Selection Intensity in Random Cellular Populations
.109
6.3
Experimental Results
.
Ill
6.4
Small-World Networks
.113
6.4.1
Some Graph Statistics
.116
6.4.2
The Watts Strogatz Model
.118
6.4.3
The
Bara basi-
Albert Model
.119
6.5
Selection Intensity in Small-World Networks
.120
6.5.1
Watts-Strogatz Model
. 120
6.5.2
Barabást
Albert Model
.122
6.6
Summary
.124
7
Coevolutionary Structured Models
.125
7.
L W
li
at Is Coevolutiou?
.125
7.2
Cooperative Cocvolution
.126
7.3
Competitive Coevolution: Hosts and Parasites
.127
7.4
A Case Study: Coevolution of Cellular Automata
.130
7.4.1
Cellular Automata
.131
7.4.2
The Majority Task
.131
7.5
Artificial Evolution of CAs for the Majority Task
. 133
7.5.1
Coevolving Uniform CAs for the Majority Task
.134
7.5.2
Coevolving Nonuniform CAs for the Majority Task
. 137
7.5.3
Results for the Density Task
.139
7.6
Summan-
.141
8
Some Nonconventional Models
.143
8.1
Nonconventional Island Models
.144
8.1.1
The Injection Island Model
. . .144
8.1.2
Islands with Variable Population Size
.145
8.2
Nonconventional Cellular Models
.151
8.2.1
The Patchwork Model
.152
8.2.2
Dynamic Neighborhoods in Cellular Evolution Stxategiesl53
A Implementation Notes
.157
A.l Computing Environment
.158
A.
1.1
MPI
.158
A.
2
Implementation of Island EAs
.159
A.
2.1
Synchronous Islands
.159
A.
2.2
Asynchronous Islands
.165
A
.2,3
Summary
.168
A.3 Implementation of Lattice Cellular EAs
.168
A
.3.1
Synchronous Cellular EAs
.168
A.
3.2
Asynchronous Cellular EAs
.170
A.
4
Performance Measures and Speedup
.170
A.
5
A Remark on Pseudorandom Number Generators
.173
References
.177
Index
.189 |
any_adam_object | 1 |
any_adam_object_boolean | 1 |
author | Tomassini, Marco |
author_GND | (DE-588)122948084 |
author_facet | Tomassini, Marco |
author_role | aut |
author_sort | Tomassini, Marco |
author_variant | m t mt |
building | Verbundindex |
bvnumber | BV021254668 |
callnumber-first | Q - Science |
callnumber-label | QA76 |
callnumber-raw | QA76.618 |
callnumber-search | QA76.618 |
callnumber-sort | QA 276.618 |
callnumber-subject | QA - Mathematics |
classification_rvk | SK 870 ST 301 |
classification_tum | DAT 718f |
ctrlnum | (OCoLC)62902448 (DE-599)BVBBV021254668 |
dewey-full | 006.3 |
dewey-hundreds | 000 - Computer science, information, general works |
dewey-ones | 006 - Special computer methods |
dewey-raw | 006.3 |
dewey-search | 006.3 |
dewey-sort | 16.3 |
dewey-tens | 000 - Computer science, information, general works |
discipline | Informatik Mathematik |
discipline_str_mv | Informatik Mathematik |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01933nam a2200505 c 4500</leader><controlfield tag="001">BV021254668</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20080116 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">051206s2005 gw ad|| |||| 00||| eng d</controlfield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">05,N01,0813</subfield><subfield code="2">dnb</subfield></datafield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">05,A45,0846</subfield><subfield code="2">dnb</subfield></datafield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">973033339</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783540241935</subfield><subfield code="c">Pp. : EUR 48.10 (freier Pr.), sfr 82.00 (freier Pr.)</subfield><subfield code="9">978-3-540-24193-5</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3540241930</subfield><subfield code="c">Pp. : EUR 48.10 (freier Pr.), sfr 82.00 (freier Pr.)</subfield><subfield code="9">3-540-24193-0</subfield></datafield><datafield tag="024" ind1="3" ind2=" "><subfield code="a">9783540241935</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">11371687</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)62902448</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV021254668</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">gw</subfield><subfield code="c">XA-DE-BE</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-703</subfield><subfield code="a">DE-824</subfield><subfield code="a">DE-91G</subfield><subfield code="a">DE-384</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA76.618</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">006.3</subfield><subfield code="2">22</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 870</subfield><subfield code="0">(DE-625)143265:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 301</subfield><subfield code="0">(DE-625)143651:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">004</subfield><subfield code="2">sdnb</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 718f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">510</subfield><subfield code="2">sdnb</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Tomassini, Marco</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)122948084</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Spatially structured evolutionary algorithms</subfield><subfield code="b">artificial evolution in space and time</subfield><subfield code="c">Marco Tomassini</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin [u.a.]</subfield><subfield code="b">Springer</subfield><subfield code="c">2005</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XIII, 192 S.</subfield><subfield code="b">Ill., graph. Darst.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">Natural computing series</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Evolutionary computation</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Evolutionary programming (Computer science)</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Evolutionärer Algorithmus</subfield><subfield code="0">(DE-588)4366912-8</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Evolutionärer Algorithmus</subfield><subfield code="0">(DE-588)4366912-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">Digitalisierung UB Augsburg</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=014575989&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-014575989</subfield></datafield></record></collection> |
id | DE-604.BV021254668 |
illustrated | Illustrated |
index_date | 2024-07-02T13:40:12Z |
indexdate | 2024-07-09T20:33:57Z |
institution | BVB |
isbn | 9783540241935 3540241930 |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-014575989 |
oclc_num | 62902448 |
open_access_boolean | |
owner | DE-703 DE-824 DE-91G DE-BY-TUM DE-384 |
owner_facet | DE-703 DE-824 DE-91G DE-BY-TUM DE-384 |
physical | XIII, 192 S. Ill., graph. Darst. |
publishDate | 2005 |
publishDateSearch | 2005 |
publishDateSort | 2005 |
publisher | Springer |
record_format | marc |
series2 | Natural computing series |
spelling | Tomassini, Marco Verfasser (DE-588)122948084 aut Spatially structured evolutionary algorithms artificial evolution in space and time Marco Tomassini Berlin [u.a.] Springer 2005 XIII, 192 S. Ill., graph. Darst. txt rdacontent n rdamedia nc rdacarrier Natural computing series Evolutionary computation Evolutionary programming (Computer science) Evolutionärer Algorithmus (DE-588)4366912-8 gnd rswk-swf Evolutionärer Algorithmus (DE-588)4366912-8 s DE-604 Digitalisierung UB Augsburg application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=014575989&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
spellingShingle | Tomassini, Marco Spatially structured evolutionary algorithms artificial evolution in space and time Evolutionary computation Evolutionary programming (Computer science) Evolutionärer Algorithmus (DE-588)4366912-8 gnd |
subject_GND | (DE-588)4366912-8 |
title | Spatially structured evolutionary algorithms artificial evolution in space and time |
title_auth | Spatially structured evolutionary algorithms artificial evolution in space and time |
title_exact_search | Spatially structured evolutionary algorithms artificial evolution in space and time |
title_exact_search_txtP | Spatially structured evolutionary algorithms artificial evolution in space and time |
title_full | Spatially structured evolutionary algorithms artificial evolution in space and time Marco Tomassini |
title_fullStr | Spatially structured evolutionary algorithms artificial evolution in space and time Marco Tomassini |
title_full_unstemmed | Spatially structured evolutionary algorithms artificial evolution in space and time Marco Tomassini |
title_short | Spatially structured evolutionary algorithms |
title_sort | spatially structured evolutionary algorithms artificial evolution in space and time |
title_sub | artificial evolution in space and time |
topic | Evolutionary computation Evolutionary programming (Computer science) Evolutionärer Algorithmus (DE-588)4366912-8 gnd |
topic_facet | Evolutionary computation Evolutionary programming (Computer science) Evolutionärer Algorithmus |
url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=014575989&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
work_keys_str_mv | AT tomassinimarco spatiallystructuredevolutionaryalgorithmsartificialevolutioninspaceandtime |