Ant colony optimization and constraint programming:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English French |
| Veröffentlicht: |
London [u.a.]
Iste [u.a.]
2010
|
| Schlagworte: | |
| Online-Zugang: | Publisher description Inhaltsverzeichnis |
| Beschreibung: | Includes bibliographical references and index |
| Beschreibung: | XII, 232 S. graph. Darst. |
| ISBN: | 9781848211308 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV036428199 | ||
| 003 | DE-604 | ||
| 005 | 20130430 | ||
| 007 | t | ||
| 008 | 100428s2010 xxud||| |||| 00||| eng d | ||
| 010 | |a 2009050443 | ||
| 020 | |a 9781848211308 |9 978-1-8482-1130-8 | ||
| 035 | |a (OCoLC)699560583 | ||
| 035 | |a (DE-599)BVBBV036428199 | ||
| 040 | |a DE-604 |b ger |e aacr | ||
| 041 | 1 | |a eng |h fre | |
| 044 | |a xxu |c US | ||
| 049 | |a DE-11 |a DE-355 |a DE-473 | ||
| 050 | 0 | |a QA76.612 | |
| 082 | 0 | |a 005.1/16 | |
| 084 | |a ST 230 |0 (DE-625)143617: |2 rvk | ||
| 100 | 1 | |a Solnon, Christine |e Verfasser |4 aut | |
| 240 | 1 | 0 | |a Optimisation par colonies de fourmis |
| 245 | 1 | 0 | |a Ant colony optimization and constraint programming |c Christine Solnon |
| 264 | 1 | |a London [u.a.] |b Iste [u.a.] |c 2010 | |
| 300 | |a XII, 232 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 500 | |a Includes bibliographical references and index | ||
| 650 | 4 | |a Constraint programming (Computer science) | |
| 650 | 4 | |a Mathematical optimization | |
| 650 | 4 | |a Swarm intelligence | |
| 650 | 4 | |a Ant algorithms | |
| 650 | 0 | 7 | |a Optimierung |0 (DE-588)4043664-0 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Ameisenalgorithmus |0 (DE-588)4704280-1 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Constraint |g Künstliche Intelligenz |0 (DE-588)4314755-0 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Ameisenalgorithmus |0 (DE-588)4704280-1 |D s |
| 689 | 0 | 1 | |a Constraint |g Künstliche Intelligenz |0 (DE-588)4314755-0 |D s |
| 689 | 0 | 2 | |a Optimierung |0 (DE-588)4043664-0 |D s |
| 689 | 0 | |5 DE-604 | |
| 856 | 4 | |u http://www.loc.gov/catdir/enhancements/fy1005/2009050443-d.html |3 Publisher description | |
| 856 | 4 | 2 | |m HBZ Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=020300843&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-020300843 | ||
Datensatz im Suchindex
| _version_ | 1804142904367644672 |
|---|---|
| adam_text | Titel: Ant colony optimization and constraint programming
Autor: Solnon, Christine
Jahr: 2010
Table of Contents
Foreword .................................. xi
Acknowledgements ............................ xiii
Chapter 1. Introduction ......................... 1
1.1. Overview of the book....................... 2
1.1.1. Constraint programming.................. 3
1.1.2. Ant colony optimization.................. 4
1.1.3. Constraint programming with ant colony optimization . 4
Chapter 2. Computational Complexity ................ 7
2.1. Complexity of an algorithm................... 8
2.2. Complexity of a problem..................... 10
2.2.1. The V class......................... 10
2.2.2. TheTVP class........................ 11
2.2.3. TVT-complete problems.................. 12
2.2.4. ËËÑ-hard problems..................... 14
2.2.5. Undecidable problems................... 14
2.2.6. Complexity of optimization problems.......... 15
2.3. Where the most difficult instances can be found........ 15
2.3.1. Phase transition....................... 16
2.3.2. Search landscape...................... 19
2.4. Solving AfP-hard problems in practice............. 21
2.4.1. Exploitation of particular cases.............. 23
2.4.2. Approximation algorithms................. 23
2.4.3. Heuristics and metaheuristics............... 24
2.4.4. Structuring and filtering the search space ........ 24
vi ACÓ and CP
Part I. Constraint Programming................ 27
Introduction to Part I........................... 29
Chapter 3. Constraint Satisfaction Problems............. 31
3.1. What is a constraint?....................... 31
3.1.1. Definition of a constraint.................. 32
3.1.2. Arity of a constraint and global constraints....... 33
3.2. What is a constraint satisfaction problem?........... 33
3.2.1. Complexity of CSPs.................... 34
3.3. Optimization problems related to CSPs............. 35
3.3.1. Maximizing constraint satisfaction............ 35
3.3.2. Constrained optimization ................. 36
3.4. The ?-queens problem...................... 37
3.4.1. Description of the problem ................ 37
3.4.2. First CSP model ...................... 38
3.4.3. Second CSP model..................... 39
3.4.4. Third CSP model...................... 40
3.4.5. Influence of the model on the solution process ..... 41
3.5. The stable marriage problem................... 43
3.5.1. Description of the problem ................ 43
3.5.2. CSPmodel ......................... 45
3.6. Randomly generated binary CSPs................ 46
3.7. The car sequencing problem................... 47
3.7.1. Description of the problem ................ 47
3.7.2. CSPmodel ......................... 49
3.8. Discussion............................. 50
Chapter 4. Exact Approaches ...................... 53
4.1. Construction of a search tree................... 53
4.2. Constraint propagation...................... 57
4.2.1. Forward checking...................... 57
4.2.2. Maintaining arc consistency................ 59
4.3. Ordering heuristics........................ 60
4.3.1. Heuristics for choosing variables............. 61
4.3.2. Heuristics for choosing values............... 62
4.3.3. Randomized restart..................... 63
4.4. From satisfaction to optimization problems.......... 63
4.5. Discussion............................. 65
Table of Contents vii
Chapter 5. Perturbative Heuristic Approaches............ 69
5.1. Genetic algorithms........................ 70
5.1.1. Basic principles....................... 70
5.1.2. Using GAs to solve CSPs................. 73
5.2. Local search............................ 73
5.2.1. Basic principles....................... 73
5.2.2. Metaheuristics based on LS................ 75
5.2.3. Using LS to solve CSPs.................. 77
5.3. Particle swarm optimization................... 78
5.3.1. Basic principles....................... 78
5.3.2. Using PSO to solve CSPs................. 80
5.4. Discussion............................. 80
Chapter 6. Constructive Heuristic Approaches............ 85
6.1. Greedy randomized approaches................. 86
6.1.1. Basic principles....................... 86
6.1.2. Using greedy randomized algorithms to solve CSPs . . 88
6.2. Estimation of distribution algorithms.............. 88
6.2.1. Basic principles....................... 88
6.2.2. Using EDAs to solve CSPs ................ 90
6.3. Ant colony optimization..................... 90
6.4. Discussion............................. 91
Chapter 7. Constraint Programming Languages........... 93
7.1. Constraint logic programming.................. 94
7.2. Constraint programming libraries................ 96
7.3. Constraint-based local search.................. 96
7.4. Discussion............................. 99
Part II. Ant Colony Optimization ............... 101
Introduction to Part II .......................... 103
Chapter 8. From Swarm Intelligence to Ant Colony Optimization 105
8.1. Complex systems and swarm intelligence........... 106
8.2. Searching for shortest paths by ant colonies.......... 108
8.3. Ant system and the traveling salesman problem........ Ill
8.3.1. Pheromone structure.................... 112
8.3.2. Construction of a Hamiltonian cycle by an ant..... 114
viii ACO and CP
8.3.3. Pheromone updating step................. 115
8.3.4. Artificial versus real ants.................. 115
8.4. Generic ACO framework..................... 116
8.4.1. Pheromone structure and construction graph ...... 116
8.4.2. Construction of combinations by ants .......... 118
8.4.3. Improving combinations with local search........ 120
8.4.4. Pheromone updating step................. 121
8.4.5. Parameters of an ACO algorithm............. 122
Chapter 9. Intensification versus Diversification........... 125
9.1. ACO mechanisms for intensifying the search......... 125
9.2. ACO mechanisms for diversifying the search......... 127
9.3. Balancing intensification and diversification.......... 128
9.4. Measures of diversification/intensification........... 135
9.4.1. The ë-branching factor................... 136
9.4.2. Resampling ratio...................... 136
9.4.3. Similarity ratio....................... 137
Chapter 10. Beyond Static Combinatorial Problems ........ 141
10.1. Multi-objective problems..................... 141
10.1.1. Definition of multi-objective problems.......... 141
10.1.2. Solving multi-objective problems with ACO...... 143
10.2. Dynamic optimization problems................. 145
10.2.1. Definition of dynamic optimization problems...... 145
10.2.2. Solving dynamic optimization problems with ACO ... 146
10.3. Optimization problems over continuous domains....... 147
10.3.1. Definition of continuous optimization problems..... 147
10.3.2. Solving continuous optimization problems with ACO . 148
Chapter 11. Implementation Issues................... 151
11.1. Data structures........................... 151
11.1.1. Data structures associated with pheromone factors ... 151
11.1.2. Data structures associated with heuristic factors..... 153
11.1.3. Data structures associated with ants ........... 154
11.2. Selection of a component with respect to probabilities .... 154
11.3. Implementation of a local search procedure.......... 157
11.4. Computation of diversification/intensification measures . . . 157
11.4.1. Resampling ratio...................... 158
11.4.2. Similarity ratio....................... 158
Table of Contents ix
Part III. CP with ACÓ........................ 161
Introduction to Part III.......................... 163
Chapter 12. Sequencing Cars with ACO................. 165
12.1. Notation.............................. 165
12.2. A first pheromone structure for identifying good car
sequences ............................. 166
12.2.1. Pheromone structure.................... 167
12.2.2. Construction of a sequence by an ant........... 168
12.2.3. Pheromone laying step................... 170
12.3. A second pheromone structure for identifying critical cars . . 171
12.3.1. Pheromone structure.................... 171
12.3.2. Construction of a sequence by an ant........... 172
12.3.3. Pheromone updating step................. 172
12.4. Combining the two pheromone structures........... 173
12.4.1. First pheromone structure................. 173
12.4.2. Second pheromone structure................ 173
12.4.3. Construction of a sequence by an ant........... 173
12.5. Comparison of the different ACO algorithms......... 174
12.5.1. Considered algorithms................... 174
12.5.2. Test suite........................... 175
12.5.3. Parameter settings ..................... 175
12.5.4. Experimental results.................... 177
12.6. Comparison of ACO with state-of-the-art approaches..... 178
12.6.1. Considered approaches................... 178
12.6.2. IDWalk ........................... 179
12.6.3. VFLS ............................ 179
12.6.4. Experimental set-up.................... 180
12.6.5. Experimental results.................... 180
12.7. Discussion............................. 182
Chapter 13. Subset Selection with ACO................ 185
13.1. Subset selection problems.................... 186
13.1.1. Maximum clique...................... 186
13.1.2. Multidimensional knapsack................ 187
13.1.3. Maximum Boolean satisfiability ............. 187
13.1.4. Maximum constraint satisfaction............. 187
13.1.5. Minimum vertex cover................... 188
13.1.6. Maximum common subgraph............... 188
÷ ACO and CP
13.1.7. Edge-weighted fc-cardinality tree............. 189
13.2. Description of Ant-SSP...................... 189
13.2.1. Construction of a combination by an ant......... 190
13.2.2. Pheromone laying step................... 192
13.3. Instantiations of Ant-SSP with respect to two pheromone
strategies.............................. 192
13.3.1. The vertex pheromone strategy.............. 193
13.3.2. The clique pheromone strategy.............. 193
13.3.3. Comparison of the two strategies............. 194
13.4. Instantiation of Ant-SSP to solve CSPs............. 196
13.4.1. Heuristic factor....................... 196
13.4.2. Local search......................... 197
13.5. Experimental results....................... 197
13.5.1. Randomly generated binary instances.......... 197
13.5.2. Results on instances of the 2006 solver competition . . 199
13.6. Discussion............................. 202
Chapter 14. Integration of ACO in a CP Language ......... 205
14.1. Framework for integrating ACO within a CP library..... 206
14.1.1. Pheromone strategy..................... 207
14.1.2. Construction of assignments................ 208
14.1.3. Pheromone updating step................. 210
14.2. Illustration of ACO-CP on the car sequencing problem . . . . 210
14.2.1. CSP model ......................... 210
14.2.2. Variable ordering heuristic................. 211
14.2.3. Pheromone strategies.................... 211
14.2.4. Heuristic factor....................... 212
14.2.5. Experimental results.................... 213
14.3. Discussion............................. 214
Chapter 15. Conclusion.......................... 215
15.1. Towards constraint-based ACO search............. 215
15.2. Towards a reactive ACO search................. 216
Bibliography ................................ 219
Index..................................... 231
|
| any_adam_object | 1 |
| author | Solnon, Christine |
| author_facet | Solnon, Christine |
| author_role | aut |
| author_sort | Solnon, Christine |
| author_variant | c s cs |
| building | Verbundindex |
| bvnumber | BV036428199 |
| callnumber-first | Q - Science |
| callnumber-label | QA76 |
| callnumber-raw | QA76.612 |
| callnumber-search | QA76.612 |
| callnumber-sort | QA 276.612 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | ST 230 |
| ctrlnum | (OCoLC)699560583 (DE-599)BVBBV036428199 |
| dewey-full | 005.1/16 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 005 - Computer programming, programs, data, security |
| dewey-raw | 005.1/16 |
| dewey-search | 005.1/16 |
| dewey-sort | 15.1 216 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01950nam a2200493 c 4500</leader><controlfield tag="001">BV036428199</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20130430 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">100428s2010 xxud||| |||| 00||| eng d</controlfield><datafield tag="010" ind1=" " ind2=" "><subfield code="a">2009050443</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781848211308</subfield><subfield code="9">978-1-8482-1130-8</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)699560583</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV036428199</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">aacr</subfield></datafield><datafield tag="041" ind1="1" ind2=" "><subfield code="a">eng</subfield><subfield code="h">fre</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">xxu</subfield><subfield code="c">US</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-11</subfield><subfield code="a">DE-355</subfield><subfield code="a">DE-473</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA76.612</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.1/16</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 230</subfield><subfield code="0">(DE-625)143617:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Solnon, Christine</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="240" ind1="1" ind2="0"><subfield code="a">Optimisation par colonies de fourmis</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Ant colony optimization and constraint programming</subfield><subfield code="c">Christine Solnon</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">London [u.a.]</subfield><subfield code="b">Iste [u.a.]</subfield><subfield code="c">2010</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XII, 232 S.</subfield><subfield code="b">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="500" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references and index</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Constraint programming (Computer science)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematical optimization</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Swarm intelligence</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Ant algorithms</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Optimierung</subfield><subfield code="0">(DE-588)4043664-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Ameisenalgorithmus</subfield><subfield code="0">(DE-588)4704280-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Constraint</subfield><subfield code="g">Künstliche Intelligenz</subfield><subfield code="0">(DE-588)4314755-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Ameisenalgorithmus</subfield><subfield code="0">(DE-588)4704280-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Constraint</subfield><subfield code="g">Künstliche Intelligenz</subfield><subfield code="0">(DE-588)4314755-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Optimierung</subfield><subfield code="0">(DE-588)4043664-0</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=" "><subfield code="u">http://www.loc.gov/catdir/enhancements/fy1005/2009050443-d.html</subfield><subfield code="3">Publisher description</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">HBZ Datenaustausch</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=020300843&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-020300843</subfield></datafield></record></collection> |
| id | DE-604.BV036428199 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T22:39:10Z |
| institution | BVB |
| isbn | 9781848211308 |
| language | English French |
| lccn | 2009050443 |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-020300843 |
| oclc_num | 699560583 |
| open_access_boolean | |
| owner | DE-11 DE-355 DE-BY-UBR DE-473 DE-BY-UBG |
| owner_facet | DE-11 DE-355 DE-BY-UBR DE-473 DE-BY-UBG |
| physical | XII, 232 S. graph. Darst. |
| publishDate | 2010 |
| publishDateSearch | 2010 |
| publishDateSort | 2010 |
| publisher | Iste [u.a.] |
| record_format | marc |
| spelling | Solnon, Christine Verfasser aut Optimisation par colonies de fourmis Ant colony optimization and constraint programming Christine Solnon London [u.a.] Iste [u.a.] 2010 XII, 232 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Includes bibliographical references and index Constraint programming (Computer science) Mathematical optimization Swarm intelligence Ant algorithms Optimierung (DE-588)4043664-0 gnd rswk-swf Ameisenalgorithmus (DE-588)4704280-1 gnd rswk-swf Constraint Künstliche Intelligenz (DE-588)4314755-0 gnd rswk-swf Ameisenalgorithmus (DE-588)4704280-1 s Constraint Künstliche Intelligenz (DE-588)4314755-0 s Optimierung (DE-588)4043664-0 s DE-604 http://www.loc.gov/catdir/enhancements/fy1005/2009050443-d.html Publisher description HBZ Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=020300843&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Solnon, Christine Ant colony optimization and constraint programming Constraint programming (Computer science) Mathematical optimization Swarm intelligence Ant algorithms Optimierung (DE-588)4043664-0 gnd Ameisenalgorithmus (DE-588)4704280-1 gnd Constraint Künstliche Intelligenz (DE-588)4314755-0 gnd |
| subject_GND | (DE-588)4043664-0 (DE-588)4704280-1 (DE-588)4314755-0 |
| title | Ant colony optimization and constraint programming |
| title_alt | Optimisation par colonies de fourmis |
| title_auth | Ant colony optimization and constraint programming |
| title_exact_search | Ant colony optimization and constraint programming |
| title_full | Ant colony optimization and constraint programming Christine Solnon |
| title_fullStr | Ant colony optimization and constraint programming Christine Solnon |
| title_full_unstemmed | Ant colony optimization and constraint programming Christine Solnon |
| title_short | Ant colony optimization and constraint programming |
| title_sort | ant colony optimization and constraint programming |
| topic | Constraint programming (Computer science) Mathematical optimization Swarm intelligence Ant algorithms Optimierung (DE-588)4043664-0 gnd Ameisenalgorithmus (DE-588)4704280-1 gnd Constraint Künstliche Intelligenz (DE-588)4314755-0 gnd |
| topic_facet | Constraint programming (Computer science) Mathematical optimization Swarm intelligence Ant algorithms Optimierung Ameisenalgorithmus Constraint Künstliche Intelligenz |
| url | http://www.loc.gov/catdir/enhancements/fy1005/2009050443-d.html http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=020300843&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT solnonchristine optimisationparcoloniesdefourmis AT solnonchristine antcolonyoptimizationandconstraintprogramming |