Matheuristics: hybridizing metaheuristics and mathematical programming
Gespeichert in:
| Weitere beteiligte Personen: | |
|---|---|
| Format: | Buch |
| Sprache: | Englisch |
| Veröffentlicht: |
Dordrecht [u.a.]
Springer
[2009]
|
| Schriftenreihe: | Annals of information systems
Volume 10 |
| Schlagwörter: | |
| Links: | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=028473788&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| Umfang: | XVII, 269 Seiten graphische Darstellungen |
| ISBN: | 9781441913050 |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV043049374 | ||
| 003 | DE-604 | ||
| 005 | 20190111 | ||
| 007 | t| | ||
| 008 | 151124s2009 xx |||| |||| 10||| eng d | ||
| 020 | |a 9781441913050 |c PB. : ca. EUR 110.21 (freier Pr.), ca. sfr 160.00 (freier Pr.) |9 978-1-4419-1305-0 | ||
| 024 | 3 | |a 9781441913050 | |
| 035 | |a (OCoLC)699008263 | ||
| 035 | |a (DE-599)HBZHT016350512 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91 |a DE-384 | ||
| 084 | |a QH 420 |0 (DE-625)141574: |2 rvk | ||
| 084 | |a WIR 527f |2 stub | ||
| 084 | |a 330 |2 sdnb | ||
| 084 | |a MAT 902f |2 stub | ||
| 245 | 1 | 0 | |a Matheuristics |b hybridizing metaheuristics and mathematical programming |c [Marco Caserta ...]. Edited by Vittorio Maniezzo ... |
| 264 | 1 | |a Dordrecht [u.a.] |b Springer |c [2009] | |
| 300 | |a XVII, 269 Seiten |b graphische Darstellungen | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Annals of information systems |v Volume 10 | |
| 650 | 0 | 7 | |a Optimierung |0 (DE-588)4043664-0 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Metaheuristik |0 (DE-588)4820176-5 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Metaheuristik |0 (DE-588)4820176-5 |D s |
| 689 | 0 | 1 | |a Optimierung |0 (DE-588)4043664-0 |D s |
| 689 | 0 | |5 DE-604 | |
| 700 | 1 | |a Maniezzo, Vittorio |d ca. 20./21. Jh. |0 (DE-588)1175111791 |4 edt | |
| 700 | 1 | |a Caserta, Marco |e Sonstige |4 oth | |
| 776 | 0 | 8 | |i Erscheint auch als |n Online-Ausgabe |z 978-1-4419-1306-7 |
| 830 | 0 | |a Annals of information systems |v Volume 10 |w (DE-604)BV022718881 |9 10 | |
| 856 | 4 | 2 | |m Digitalisierung UB Augsburg - ADAM Catalogue Enrichment |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=028473788&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-028473788 | |
Datensatz im Suchindex
| DE-BY-TUM_call_number | 0002 MAT 902f 2016 A 384 |
|---|---|
| DE-BY-TUM_katkey | 2150827 |
| DE-BY-TUM_location | 00 |
| DE-BY-TUM_media_number | 040008091934 |
| _version_ | 1821934167884038144 |
| adam_text | Contents
1 Metaheuristics: Intelligent Problem Solving.................... 1
Marco Caserta and Stefan Vofi
1.1 Introduction............................................... 1
1.2 Basic Concepts and Discussion.............................. 5
1.2.1 Local Search....................................... 5
1.2.2 Metaheuristics..................................... 7
1.2.3 Miscellaneous..................................... 14
1.3 A Taxonomy................................................ 15
1.4 Hybrids with Exact Methods................................ 19
1.5 General Frames: A Pool-Template........................... 22
1.6 Fine Tuning and Evaluation of Algorithms ................. 24
1.6.1 Fine Tuning of Metaheuristics..................... 24
1.6.2 Empirical Evaluation of Metaheuristics............ 26
1.7 Optimization Software Libraries........................... 30
1.8 Conclusions .............................................. 30
References.................................................... 32 2
2 Just MIP it!.................................................. 39
Matteo Fischetti, Andrea Lodi, and Domenico Salvagnin
2.1 Introduction............................................ 40
2.2 MIP ping Cut Separation.................................. 41
2.2.1 Pure Integer Cuts................................. 43
2.2.2 Mixed Integer Cuts ............................... 44
2.2.3 A Computational Overview.......................... 47
2.3 MIPping Heuristics........................................ 50
2.3.1 Local Branching and Feasibility Pump.............. 51
2.3.2 LB with Infeasible Reference Solutions............ 54
2.3.3 Computational Results............................. 55
2.4 MIPping the Dominance Test................................ 61
2.4.1 Borrowing Nogoods from Constraint Programming . 63
2.4.2 Improving the Auxiliary Problem................... 64
IX
X
Contents
2.4.3 Computational Results........................... 65
References .................................................... 68
3 MetaBoosting: Enhancing Integer Programming
Techniques by Metaheuristics................................... 71
Jakob Puchinger, Günther R. Raidl, and Sandro Pirkwieser
3.1 Introduction............................................. 71
3.2 Integer Programming Techniques........................... 73
3.2.1 Relaxations and Duality........................... 73
3.2.2 LP-Based Branch-and-Bound......................... 75
3.2.3 Cutting Plane Algorithm and Branch-and-Cut..... 76
3.2.4 Column Generation and Branch-and-Price............ 77
3.3 Metaheuristics for Finding Primal Bounds................. 78
3.3.1 Initial Solutions................................. 78
3.3.2 B B Acting as Local Search Based Metaheuristic . . 80
3.3.3 Solution Merging.................................. 81
3.3.4 Metaheuristics and Lagrangian Relaxation.......... 83
3.4 Collaborative Hybrids ................................... 84
3.5 Metaheuristics for Cut and Column Generation............. 85
3.5.1 Cut Separation.................................... 85
3.5.2 Column Generation................................. 86
3.6 Case Study: A Lagrangian Decomposition/EA Hybrid...... 87
3.6.1 The Knapsack Constrained Maximum Spanning
Tree Problem...................................... 87
3.6.2 Lagrangian Decomposition of the KCMST Problem 88
3.6.3 Lagrangian Heuristic.............................. 89
3.6.4 Evolutionary Algorithm for the KCMST.............. 89
3.6.5 LD/EA Hybrid.................................... 90
3.6.6 Experimental Results.............................. 91
3.7 Case Study: Metaheuristic Column Generation.............. 92
3.7.1 The Periodic Vehicle Routing Problem with Time
Windows .......................................... 92
3.7.2 Set Covering Formulation for the PVRPTW........... 94
3.7.3 Column Generation for Solving the LP Relaxation . 95
3.7.4 Exact and Metaheuristic Pricing Procedures........ 96
3.7.5 Experimental Results.............................. 97
3.8 Conclusions ............................................. 99
References.....................................................100
4 Usage of Exact Algorithms to Enhance Stochastic Local
Search Algorithms..............................................103
Irina Dumitrescu and Thomas Stützle
4.1 Introduction........................................... 103
4.2 Exploring large neighborhoods............................106
4.2.1 NSP Example: Cyclic and Path Exchange
Neighborhoods
108
Contents
xi
4.2.2 NSP Example: Dynasearch...........................Ill
4.2.3 PNSP Example: Hyperopt Neighborhoods..............112
4.2.4 Other Approaches..................................113
4.2.5 Discussion .......................................114
4.3 Enhancing Metaheuristics.................................115
4.3.1 Example: Perturbation in Iterated Local Search .... 115
4.3.2 Other Approaches..................................117
4.3.3 Discussion .......................................118
4.4 Using Branch-and-Bound Techniques in Constructive
Search Heuristics........................................118
4.4.1 Example: Approximate Nondeterministic Tree
Search (ANTS)................................... 119
4.4.2 Other Approaches..................................121
4.5 Exploiting the Structure of Good Solutions...............121
4.5.1 Example: Heuristic Concentration..................122
4.5.2 Example: Tour Merging.............................123
4.5.3 Discussion........................................124
4.6 Exploiting Information from Relaxations in Metaheuristics . 125
4.6.1 Example: Simplex and Tabu Search Hybrid ..........125
4.6.2 Discussion .......................................127
4.7 Conclusions .............................................128
References....................................................129
5 Decomposition Techniques as Metaheuristic Frameworks . 135
Marco Boschetti, Vittorio Maniezzo, and Matteo Roffilli
5.1 Introduction.............................................135
5.2 Decomposition Methods....................................137
5.2.1 Lagrangean Relaxation.............................137
5.2.2 Dantzig-Wolfe Decomposition ......................138
5.2.3 Benders Decomposition.............................139
5.3 Metaheuristics Derived from Decompositions...............141
5.3.1 A Lagrangean Metaheuristic........................142
5.3.2 A Dantzig-Wolfe Metaheuristic.....................142
5.3.3 A Benders Metaheuristic...........................143
5.4 Single Source Capacitated Facility Location..............144
5.4.1 Solving the SCFLP with a Lagrangean
Metaheuristic.....................................146
5.4.2 Solving the SCFLP with a Dantzig-Wolfe
Metaheuristic.................................. 147
5.4.3 Solving the SCFLP with a Benders Metaheuristic . . 149
5.5 Computational Results....................................150
5.5.1 Lagrangean Metaheuristic..........................151
5.5.2 Dantzig-Wolfe Metaheuristic ......................153
5.5.3 Benders Metaheuristic.............................153
5.6 Conclusions .............................................155
References....................................................156
xii Contents
6 Convergence Analysis
of Metaheuristics............................................159
Walter J. Gutjahr
6.1 Introduction......................................... 159
6.2 A Generic Metaheuristic Algorithm......................161
6.3 Convergence............................................164
6.3.1 Convergence Notions.............................164
6.3.2 Best-So-Far Convergence.........................165
6.3.3 Model Convergence ..............................167
6.4 Proving Convergence....................................169
6.4.1 Proving Best-So-Far Convergence.................169
6.4.2 Proving Model Convergence..................... 169
6.5 Convergence for Problems with Noise....................175
6.6 Convergence Speed......................................178
6.7 Conclusions .......................................... 183
References...................................................184
7 MIP-based GRASP and Genetic Algorithm for Balancing
Transfer Lines...............................................189
Alexandre Dolgui, Anton Eremeev, and Olga Guschinskaya
7.1 Introduction...........................................189
7.2 Problem Statement......................................191
7.3 Greedy Randomized Adaptive Search Procedure ...........195
7.3.1 Construction Phase..............................195
7.3.2 Improvement Phase . . ..........................197
7.4 Genetic Algorithm......................................198
7.5 Experimental Results...................................200
7.5.1 Problem Instances ..............................200
7.5.2 Experimental Settings...........................201
7.5.3 Results.........................................202
7.6 Conclusions ...........................................206
References...................................................207
8 (Meta-)Heuristic Separation of Jump Cuts in a
Branch Cut Approach for the Bounded Diameter
Minimum Spanning Tree Problem................................209
Martin Gruber and Günther R. Raidl
8.1 Introduction...........................................209
8.2 Previous Work..........................................210
8.3 The Jump Model.........................................211
8.4 Jump Cut Separation....................................213
8.4.1 Exact Separation Model..........................214
8.4.2 Simple Construction Heuristic CA................215
8.4.3 Constraint Graph Based Construction Heuristic CB 216
8.4.4 Local Search and Tabu Search.......... . . ....219
8.5 Primal Heuristics......................................220
8.6 Computational Results..................................222
Contents
Xlll
g 7 Conclusions and Future Work.............................228
References.................................................. 228
9 A Good Recipe for Solving MINLPs..............................231
Leo Liberty Giacomo Nannicini, and Nenad Mladenovic
9.1 Introduction...........................................231
9.2 The Basic Ingredients...................................233
9.2.1 Variable Neighbourhood Search....................233
9.2.2 Local Branching..................................234
9.2.3 Branch-and-Bound for cMINLPs.....................234
9.2.4 Sequential Quadratic Programming ................235
9.3 The RECIPE Algorithm...................................236
9.3.1 Hyperrectangular Neighbourhood Structure.........236
9.4 Computational Results............................... 238
9.4.1 MINLPLib.........................................239
9.5 Conclusion..............................................242
References....................................................243
10 Variable Intensity Local Search...............................245
Snezana Mitrovic-Minic and Abraham P. Punnen
10.1 Introduction............................................245
10.2 The General VILS Framework..............................246
10.3 Experimental Studies....................................249
10.4 Conclusion..............................................250
References....................................................251
11 A Hybrid Tabu Search for the m-Peripatetic Vehicle
Routing Problem...............................................253
Sandra Ulrich Ngueveu, Christian Prins, and Roberto Wolfler
Calvo
11.1 Introduction............................................253
11.2 Tabu Search.............................................255
11.2.1 Initial Solution Heuristic and Neighborhood
Structure........................................255
11.2.2 Penalization and Tabu List Management........... . 257
11.3 Hybridization with 6-Matching and Diversification.......257
11.3.1 5-Matching.......................................257
11.3.2 Hybridization ...................................258
11.3.3 Diversification Procedure ..................... 259
11.4 Computational Analysis .................................259
11.4.1 VRP and ro-PSP ..................................261
11.4.2 m-PVRP with 2 m 7............................262
11.5 Conclusion..............................................263
References....................................................264
Index
267
|
| any_adam_object | 1 |
| author2 | Maniezzo, Vittorio ca. 20./21. Jh |
| author2_role | edt |
| author2_variant | v m vm |
| author_GND | (DE-588)1175111791 |
| author_facet | Maniezzo, Vittorio ca. 20./21. Jh |
| building | Verbundindex |
| bvnumber | BV043049374 |
| classification_rvk | QH 420 |
| classification_tum | WIR 527f MAT 902f |
| ctrlnum | (OCoLC)699008263 (DE-599)HBZHT016350512 |
| discipline | Mathematik Wirtschaftswissenschaften |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01857nam a2200433 cb4500</leader><controlfield tag="001">BV043049374</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20190111 </controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">151124s2009 xx |||| |||| 10||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781441913050</subfield><subfield code="c">PB. : ca. EUR 110.21 (freier Pr.), ca. sfr 160.00 (freier Pr.)</subfield><subfield code="9">978-1-4419-1305-0</subfield></datafield><datafield tag="024" ind1="3" ind2=" "><subfield code="a">9781441913050</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)699008263</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)HBZHT016350512</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91</subfield><subfield code="a">DE-384</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">QH 420</subfield><subfield code="0">(DE-625)141574:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">WIR 527f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">330</subfield><subfield code="2">sdnb</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 902f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Matheuristics</subfield><subfield code="b">hybridizing metaheuristics and mathematical programming</subfield><subfield code="c">[Marco Caserta ...]. Edited by Vittorio Maniezzo ...</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Dordrecht [u.a.]</subfield><subfield code="b">Springer</subfield><subfield code="c">[2009]</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XVII, 269 Seiten</subfield><subfield code="b">graphische Darstellungen</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="1" ind2=" "><subfield code="a">Annals of information systems</subfield><subfield code="v">Volume 10</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">Metaheuristik</subfield><subfield code="0">(DE-588)4820176-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Metaheuristik</subfield><subfield code="0">(DE-588)4820176-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><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="700" ind1="1" ind2=" "><subfield code="a">Maniezzo, Vittorio</subfield><subfield code="d">ca. 20./21. Jh.</subfield><subfield code="0">(DE-588)1175111791</subfield><subfield code="4">edt</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Caserta, Marco</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Online-Ausgabe</subfield><subfield code="z">978-1-4419-1306-7</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Annals of information systems</subfield><subfield code="v">Volume 10</subfield><subfield code="w">(DE-604)BV022718881</subfield><subfield code="9">10</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">Digitalisierung UB Augsburg - ADAM Catalogue Enrichment</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=028473788&sequence=000002&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-028473788</subfield></datafield></record></collection> |
| id | DE-604.BV043049374 |
| illustrated | Not Illustrated |
| indexdate | 2024-12-20T17:26:35Z |
| institution | BVB |
| isbn | 9781441913050 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-028473788 |
| oclc_num | 699008263 |
| open_access_boolean | |
| owner | DE-91 DE-BY-TUM DE-384 |
| owner_facet | DE-91 DE-BY-TUM DE-384 |
| physical | XVII, 269 Seiten graphische Darstellungen |
| publishDate | 2009 |
| publishDateSearch | 2009 |
| publishDateSort | 2009 |
| publisher | Springer |
| record_format | marc |
| series | Annals of information systems |
| series2 | Annals of information systems |
| spellingShingle | Matheuristics hybridizing metaheuristics and mathematical programming Annals of information systems Optimierung (DE-588)4043664-0 gnd Metaheuristik (DE-588)4820176-5 gnd |
| subject_GND | (DE-588)4043664-0 (DE-588)4820176-5 |
| title | Matheuristics hybridizing metaheuristics and mathematical programming |
| title_auth | Matheuristics hybridizing metaheuristics and mathematical programming |
| title_exact_search | Matheuristics hybridizing metaheuristics and mathematical programming |
| title_full | Matheuristics hybridizing metaheuristics and mathematical programming [Marco Caserta ...]. Edited by Vittorio Maniezzo ... |
| title_fullStr | Matheuristics hybridizing metaheuristics and mathematical programming [Marco Caserta ...]. Edited by Vittorio Maniezzo ... |
| title_full_unstemmed | Matheuristics hybridizing metaheuristics and mathematical programming [Marco Caserta ...]. Edited by Vittorio Maniezzo ... |
| title_short | Matheuristics |
| title_sort | matheuristics hybridizing metaheuristics and mathematical programming |
| title_sub | hybridizing metaheuristics and mathematical programming |
| topic | Optimierung (DE-588)4043664-0 gnd Metaheuristik (DE-588)4820176-5 gnd |
| topic_facet | Optimierung Metaheuristik |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=028473788&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| volume_link | (DE-604)BV022718881 |
| work_keys_str_mv | AT maniezzovittorio matheuristicshybridizingmetaheuristicsandmathematicalprogramming AT casertamarco matheuristicshybridizingmetaheuristicsandmathematicalprogramming |
Inhaltsverzeichnis
Paper/Kapitel scannen lassen
Paper/Kapitel scannen lassen
Teilbibliothek Stammgelände
| Signatur: |
0002 MAT 902f 2016 A 384
Lageplan |
|---|---|
| Exemplar 1 | Ausleihbar Am Standort |