Distributed memetic algorithms for graph theoretical combinatorial optimization problems:
Saved in:
| Main Author: | |
|---|---|
| Format: | Thesis Book |
| Language: | English |
| Published: |
Berlin
Logos-Verl.
2009
|
| Subjects: | |
| Online Access: | Inhaltstext Inhaltsverzeichnis |
| Physical Description: | XXII, 305 S. graph. Darst. 21 cm |
| ISBN: | 9783832521783 |
Staff View
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV035644378 | ||
| 003 | DE-604 | ||
| 005 | 20181121 | ||
| 007 | t | ||
| 008 | 090724s2009 gw d||| m||| 00||| eng d | ||
| 015 | |a 09,H07,0723 |2 dnb | ||
| 016 | 7 | |a 994066945 |2 DE-101 | |
| 020 | |a 9783832521783 |c kart. : EUR 41.00 (DE), EUR 42.10 (AT), sfr 73.00 (freier Pr.) |9 978-3-8325-2178-3 | ||
| 035 | |a (OCoLC)370756002 | ||
| 035 | |a (DE-599)DNB994066945 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 044 | |a gw |c XA-DE | ||
| 049 | |a DE-634 | ||
| 082 | 0 | |a 519.64 |2 22/ger | |
| 084 | |a 510 |2 sdnb | ||
| 100 | 1 | |a Fischer, Thomas |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Distributed memetic algorithms for graph theoretical combinatorial optimization problems |c Thomas Fischer |
| 264 | 1 | |a Berlin |b Logos-Verl. |c 2009 | |
| 300 | |a XXII, 305 S. |b graph. Darst. |c 21 cm | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 502 | |a Zugl.: Kaiserslautern, Techn. Univ., Diss., 2008 | ||
| 650 | 0 | 7 | |a Kombinatorische Optimierung |0 (DE-588)4031826-6 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Memetischer Algorithmus |0 (DE-588)4625421-3 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Verteilter Algorithmus |0 (DE-588)4200453-6 |2 gnd |9 rswk-swf |
| 655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
| 689 | 0 | 0 | |a Kombinatorische Optimierung |0 (DE-588)4031826-6 |D s |
| 689 | 0 | 1 | |a Memetischer Algorithmus |0 (DE-588)4625421-3 |D s |
| 689 | 0 | 2 | |a Verteilter Algorithmus |0 (DE-588)4200453-6 |D s |
| 689 | 0 | |5 DE-604 | |
| 856 | 4 | 2 | |q text/html |u http://deposit.dnb.de/cgi-bin/dokserv?id=3304665&prov=M&dok_var=1&dok_ext=htm |3 Inhaltstext |
| 856 | 4 | 2 | |m Manuelle Übernahme aus dem DNB-Katalog / BSB München |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=017699112&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-017699112 | |
Record in the Search Index
| _version_ | 1809403649721368576 |
|---|---|
| adam_text |
CONTENTS
1 INTRODUCTION 1
2 FOUNDATIONS 5
2.1 MEMETIC ALGORITHMS 5
2.1.1 COMBINATORIAL PROBLEMS 5
2.1.2 HEURISTICS AND LOCAL SEARCH 7
2.1.3 METAHEURISTICS 9
2.1.4 POPULATION-BASED AND EVOLUTIONAER/ ALGORITHMS 13
2.L5 MEMETIC ALGORITHMS 17
2.1.6 LOWER BOUNDS 19
2.1.7 TERMINATION DETECTION 20
2.2 DISTRIBUTION 21
2.2.1 DISTRIBUTED SYSTEMS 21
2.2.2 DISTRIBUTED COMPUTATION 26
2.2.3 ARGUMENTS FOR AND AGAINST DISTRIBUTED ALGO-
RITHMS 30
2.3 EXPERIMENTAL ENVIRONMENT 31
3 TRAVELLING SALESMAN PROBLEM 33
3.1 LITERATURE 34
3.1.1 HISTORICAL BACKGROUND 34
3.1.2 EXACT ALGORITHMS AND BOUNDS 36
3.1.3 PRACTICALWORK 38
3.1.4 BENCHMARK INSTANCES 48
3.2 FIXINGEDGES IN TSP TOURS 49
3.2.1 EDGE SELECTION HEURISTICS 53
3.2.2 ANALYZING SELECTION HEURISTICS 56
3.23 EXPERIMENTAL SETUP AND RESULTS 62
3.2.4 SUMMARY 73
3.3 DISTRIBUTED CHAINED LIN-KERNIGHAN ALGORITHM 74
3.3.1 SYSTEM ARCHITECTURE 74
3.3.2 EXPERIMENTAL SETUP 78
3.3.3 EXPERIMENTAL RESULTS 80
3.3.4 SUMMARY 95
3.4 SUMMARY 98
BIBLIOGRAFISCHE INFORMATIONEN
HTTP://D-NB.INFO/994066945
DIGITALISIERT DURCH
CONTENTS
4 ROUTING AND WAVELENGTH ASSIGNMENT PROBLEM 101
4.1 RELATED WORK 103
4.1.1 SOLVING THE SUBPROBLEMS OF THE RWA INDEPEN-
DENTLY 104
4.1.2 SOLVING THE RWA AS AN INTEGRAL PROBLEM 109
4.2 LOWER BOUNDS 115
4.3 BENCHMARK INSTANCES 118
4.4 CONSTRUCTION ALGORITHMS 120
4.4.1 RESULTS 125
4.5 ITERATED LOCAL SEARCH 129
4.5.1 LOCAL SEARCH 130
4.5.2 MUTATION 133
4.5.3 EXPERIMENTAL SETUP & RESULTS 134
4.6 MEMETIC ALGORITHM 141
4.6.1 RECOMBINATION 142
4.6.2 DISTRIBUTION 143
4.6.3 RESULTS 145
4.7 MULTI-LEVEL 147
4.7.1 SCALING CONSTRUCTOR 154
4.7.2 MULTILEVEL APPROACH 155
4.7.3 RESULTS 164
4.8 ANALYZING THE SEARCH SPACE 167
4.9 SUMMARY 181
5 OPTIMUM COMMUNICATION SPANNING TREE PROBLEM 185
5.1 LITERATURE 186
5.1.1 THEORETICAL WORKS 186
5.1.2 PRACTICAL APPROACHES 192
5.2 PROBLEM INSTANCES 203
5.2.1 BENCHMARK INSTANCES 203
5.2.2 RANDOMLY GENERATED INSTANCES 204
5.2.3 LOWER BOUNDS 205
5.3 CONSTRUCTION HEURISTICS 205
5.3.1 RESULTS 208
5.4 LOCAL SEARCH 216
5.4.1 RESULTS 219
5.4.2 RANDOM SHUFFLE 224
5.5 MEMETIC ALGORITHM 232
5.5.1 RECOMBINATION 233
5.5.2 DISTRIBUTION 235
CONTENTS
5.6 EXPERIMENTAL SETUP & RESULTS 236
5.7 SOLUTION ANALYSIS 247
5.8 SUMMARY 252
6 CONCLUSIONS 263
A APPENDIX 269
A.1 TRAVELLING SALESMAN PROBLEM 269
A.1.1 LOWER BOUNDS FOR THE TSP 269
A.2 OPTIMUM COMMUNICATION SPANNING TREES 272
A.2.1 PROOF OF NP-COMPLETENESS OF THE OCST 272
A.2.2 LOWER BOUNDS FOR THE OCST 275
A.2.3 POLYLOG APPROXIMATION 279
A.3 ROUTING AND WAVELENGTH ASSIGNMENT PROBLEM 282
A.3.1 BENCHMARK INSTANCES 282
BLBLIOGRAPHY 285 |
| any_adam_object | 1 |
| author | Fischer, Thomas |
| author_facet | Fischer, Thomas |
| author_role | aut |
| author_sort | Fischer, Thomas |
| author_variant | t f tf |
| building | Verbundindex |
| bvnumber | BV035644378 |
| ctrlnum | (OCoLC)370756002 (DE-599)DNB994066945 |
| dewey-full | 519.64 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 519 - Probabilities and applied mathematics |
| dewey-raw | 519.64 |
| dewey-search | 519.64 |
| dewey-sort | 3519.64 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| format | Thesis Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 c 4500</leader><controlfield tag="001">BV035644378</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20181121</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">090724s2009 gw d||| m||| 00||| eng d</controlfield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">09,H07,0723</subfield><subfield code="2">dnb</subfield></datafield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">994066945</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783832521783</subfield><subfield code="c">kart. : EUR 41.00 (DE), EUR 42.10 (AT), sfr 73.00 (freier Pr.)</subfield><subfield code="9">978-3-8325-2178-3</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)370756002</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DNB994066945</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</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-634</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">519.64</subfield><subfield code="2">22/ger</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">Fischer, Thomas</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Distributed memetic algorithms for graph theoretical combinatorial optimization problems</subfield><subfield code="c">Thomas Fischer</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin</subfield><subfield code="b">Logos-Verl.</subfield><subfield code="c">2009</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XXII, 305 S.</subfield><subfield code="b">graph. Darst.</subfield><subfield code="c">21 cm</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="502" ind1=" " ind2=" "><subfield code="a">Zugl.: Kaiserslautern, Techn. Univ., Diss., 2008</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Kombinatorische Optimierung</subfield><subfield code="0">(DE-588)4031826-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Memetischer Algorithmus</subfield><subfield code="0">(DE-588)4625421-3</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Verteilter Algorithmus</subfield><subfield code="0">(DE-588)4200453-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)4113937-9</subfield><subfield code="a">Hochschulschrift</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Kombinatorische Optimierung</subfield><subfield code="0">(DE-588)4031826-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Memetischer Algorithmus</subfield><subfield code="0">(DE-588)4625421-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Verteilter Algorithmus</subfield><subfield code="0">(DE-588)4200453-6</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="q">text/html</subfield><subfield code="u">http://deposit.dnb.de/cgi-bin/dokserv?id=3304665&prov=M&dok_var=1&dok_ext=htm</subfield><subfield code="3">Inhaltstext</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">Manuelle Übernahme aus dem DNB-Katalog / BSB München</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=017699112&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-017699112</subfield></datafield></record></collection> |
| genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV035644378 |
| illustrated | Illustrated |
| indexdate | 2024-09-06T00:16:28Z |
| institution | BVB |
| isbn | 9783832521783 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-017699112 |
| oclc_num | 370756002 |
| open_access_boolean | |
| owner | DE-634 |
| owner_facet | DE-634 |
| physical | XXII, 305 S. graph. Darst. 21 cm |
| publishDate | 2009 |
| publishDateSearch | 2009 |
| publishDateSort | 2009 |
| publisher | Logos-Verl. |
| record_format | marc |
| spelling | Fischer, Thomas Verfasser aut Distributed memetic algorithms for graph theoretical combinatorial optimization problems Thomas Fischer Berlin Logos-Verl. 2009 XXII, 305 S. graph. Darst. 21 cm txt rdacontent n rdamedia nc rdacarrier Zugl.: Kaiserslautern, Techn. Univ., Diss., 2008 Kombinatorische Optimierung (DE-588)4031826-6 gnd rswk-swf Memetischer Algorithmus (DE-588)4625421-3 gnd rswk-swf Verteilter Algorithmus (DE-588)4200453-6 gnd rswk-swf (DE-588)4113937-9 Hochschulschrift gnd-content Kombinatorische Optimierung (DE-588)4031826-6 s Memetischer Algorithmus (DE-588)4625421-3 s Verteilter Algorithmus (DE-588)4200453-6 s DE-604 text/html http://deposit.dnb.de/cgi-bin/dokserv?id=3304665&prov=M&dok_var=1&dok_ext=htm Inhaltstext Manuelle Übernahme aus dem DNB-Katalog / BSB München application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=017699112&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Fischer, Thomas Distributed memetic algorithms for graph theoretical combinatorial optimization problems Kombinatorische Optimierung (DE-588)4031826-6 gnd Memetischer Algorithmus (DE-588)4625421-3 gnd Verteilter Algorithmus (DE-588)4200453-6 gnd |
| subject_GND | (DE-588)4031826-6 (DE-588)4625421-3 (DE-588)4200453-6 (DE-588)4113937-9 |
| title | Distributed memetic algorithms for graph theoretical combinatorial optimization problems |
| title_auth | Distributed memetic algorithms for graph theoretical combinatorial optimization problems |
| title_exact_search | Distributed memetic algorithms for graph theoretical combinatorial optimization problems |
| title_full | Distributed memetic algorithms for graph theoretical combinatorial optimization problems Thomas Fischer |
| title_fullStr | Distributed memetic algorithms for graph theoretical combinatorial optimization problems Thomas Fischer |
| title_full_unstemmed | Distributed memetic algorithms for graph theoretical combinatorial optimization problems Thomas Fischer |
| title_short | Distributed memetic algorithms for graph theoretical combinatorial optimization problems |
| title_sort | distributed memetic algorithms for graph theoretical combinatorial optimization problems |
| topic | Kombinatorische Optimierung (DE-588)4031826-6 gnd Memetischer Algorithmus (DE-588)4625421-3 gnd Verteilter Algorithmus (DE-588)4200453-6 gnd |
| topic_facet | Kombinatorische Optimierung Memetischer Algorithmus Verteilter Algorithmus Hochschulschrift |
| url | http://deposit.dnb.de/cgi-bin/dokserv?id=3304665&prov=M&dok_var=1&dok_ext=htm http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=017699112&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT fischerthomas distributedmemeticalgorithmsforgraphtheoreticalcombinatorialoptimizationproblems |