Cover image for Parallel metaheuristics : a new class of algorithms
Title:
Parallel metaheuristics : a new class of algorithms
Series:
Wiley series on parallel and distributed computing
Publication Information:
Hoboken, NJ : John Wiley, 2005
ISBN:
9780471678069
Added Author:

Available:*

Library
Item Barcode
Call Number
Material Type
Item Category 1
Status
Searching...
30000004728014 T57 P37 2005 Open Access Book Book
Searching...

On Order

Summary

Summary

Solving complex optimization problems with parallel metaheuristics

Parallel Metaheuristics brings together an international group of experts in parallelism and metaheuristics to provide a much-needed synthesis of these two fields. Readers discover how metaheuristic techniques can provide useful and practical solutions for a wide range of problems and application domains, with an emphasis on the fields of telecommunications and bioinformatics. This volume fills a long-existing gap, allowing researchers and practitioners to develop efficient metaheuristic algorithms to find solutions.

The book is divided into three parts:
* Part One: Introduction to Metaheuristics and Parallelism, including an Introduction to Metaheuristic Techniques, Measuring the Performance of Parallel Metaheuristics, New Technologies in Parallelism, and a head-to-head discussion on Metaheuristics and Parallelism
* Part Two: Parallel Metaheuristic Models, including Parallel Genetic Algorithms, Parallel Genetic Programming, Parallel Evolution Strategies, Parallel Ant Colony Algorithms, Parallel Estimation of Distribution Algorithms, Parallel Scatter Search, Parallel Variable Neighborhood Search, Parallel Simulated Annealing, Parallel Tabu Search, Parallel GRASP, Parallel Hybrid Metaheuristics, Parallel Multi-Objective Optimization, and Parallel Heterogeneous Metaheuristics
* Part Three: Theory and Applications, including Theory of Parallel Genetic Algorithms, Parallel Metaheuristics Applications, Parallel Metaheuristics in Telecommunications, and a final chapter on Bioinformatics and Parallel Metaheuristics

Each self-contained chapter begins with clear overviews and introductions that bring the reader up to speed, describes basic techniques, and ends with a reference list for further study. Packed with numerous tables and figures to illustrate the complex theory and processes, this comprehensive volume also includes numerous practical real-world optimization problems and their solutions.

This is essential reading for students and researchers in computer science, mathematics, and engineering who deal with parallelism, metaheuristics, and optimization in general.


Author Notes

ENRIQUE ALBA, PhD, is a Professor of Computer Science at the University of Málaga, Spain. His research interests involve the design and application of evolutionary algorithms, neural networks, parallelism, and metaheuristic algorithms to solve problems in telecommunications, combinatorial optimization, and bioinformatics. Dr. Alba has published many papers in leading journals and international conferences, and has garnered international awards for his research.


Table of Contents

Christian Blum and Andrea Roli and Enrique AlbaEnrique Alba and Gabriel LuqueEnrique Alba and Antonio J. NebroEnrique Alba and El-Ghazali Talbi and Gabriel Luque and Nouredine MelabGabriel Luque and Enrique Alba and Bernabe DorronsoroF. Fernandez and G. Spezzano and M. Tomassini and L. VanneschiGunter RudolphStefan Janson and Daniel Merkle and Martin MiddendorfJulio Madera and Enrique Alba and Alberto OchoaF. Garcia and M. Garcia and B. Melian and J. A. Moreno-Perez and J. M. Moreno-VegaJose A. Moreno-Perez and Pierre Hansen and Nenad MladenovicM. Emin Aydin and Vecihi YigitTeodor Gabriel Crainic and Michel Gendreau and Jean-Yves PotvinMauricio G. C. Resende and Celso C. RibeiroCarlos Cotta and El-Ghazali Talbi and Enrique AlbaAntonio J. Nebro and Francisco Luna and El-Ghazali Talbi and Enrique AlbaFrancisco Luna and Enrique Alba and Antonio J. NebroErick Cantu-PazTeodor Gabriel Crainic and Nourredine HailSergio Nesmachnow and Hector Cancela and Enrique Alba and Francisco ChicanoOswaldo Trelles and Andres Rodriguez
Forewordp. xi
Prefacep. xiii
Contributorsp. xv
Part I Introduction to Metaheuristics and Parallelismp. 1
1 An Introduction to Metaheuristic Techniquesp. 3
1.1 Introductionp. 3
1.2 Trajectory Methodsp. 8
1.3 Population-Based Methodsp. 19
1.4 Decentralized Metaheuristicsp. 28
1.5 Hybridization of Metaheuristicsp. 29
1.6 Conclusionsp. 31
Referencesp. 31
2 Measuring the Performance of Parallel Metaheuristicsp. 43
2.1 Introductionp. 43
2.2 Parallel Performance Measuresp. 44
2.3 How to Report Resultsp. 48
2.4 Illustrating the Influence of Measuresp. 54
2.5 Conclusionsp. 60
Referencesp. 60
3 New Technologies in Parallelismp. 63
3.1 Introductionp. 63
3.2 Parallel Computer Architectures: An Overviewp. 63
3.3 Shared-Memory and Distributed-Memory Programmingp. 65
3.4 Shared-Memory Toolsp. 68
3.5 Distributed-Memory Toolsp. 70
3.6 Which of Them?p. 74
3.7 Summaryp. 75
Referencesp. 76
4 Metaheuristics and Parallelismp. 79
4.1 Introductionp. 79
4.2 Parallel LSMsp. 80
4.3 Case Studies of Parallel LSMsp. 81
4.4 Parallel Evolutionary Algorithmsp. 85
4.5 Case Studies of Parallel EAsp. 87
4.6 Other Modelsp. 93
4.7 Conclusionsp. 95
Referencesp. 96
Part II Parallel Metaheuristic Modelsp. 105
5 Parallel Genetic Algorithmsp. 107
5.1 Introductionp. 107
5.2 Panmictic Genetic Algorithmsp. 108
5.3 Structured Genetic Algorithmsp. 110
5.4 Parallel Genetic Algorithmsp. 112
5.5 Experimental Resultsp. 118
5.6 Summaryp. 121
Referencesp. 122
6 Parallel Genetic Programmingp. 127
6.1 Introduction to GPp. 127
6.2 Models of Parallel and Distributed GPp. 130
6.3 Problemsp. 134
6.4 Real-Life Applicationsp. 137
6.5 Placement and Routing in FPGAp. 139
6.6 Data Classification Using Cellular Genetic Programmingp. 144
6.7 Concluding Discussionp. 150
Referencesp. 150
7 Parallel Evolution Strategiesp. 155
7.1 Introductionp. 155
7.2 Deployment Scenarios of Parallel Evolutionary Algorithmsp. 156
7.3 Sequential Evolutionary Algorithmsp. 159
7.4 Parallel Evolutionary Algorithmsp. 159
7.5 Conclusionsp. 165
Referencesp. 165
8 Parallel Ant Colony Algorithmsp. 171
8.1 Introductionp. 171
8.2 Ant Colony Optimizationp. 172
8.3 Parallel ACOp. 175
8.4 Hardware Parallelization of ACOp. 190
8.5 Other Ant Colony Approachesp. 195
Referencesp. 197
9 Parallel Estimation of Distribution Algorithmsp. 203
9.1 Introductionp. 203
9.2 Levels of Parallelism in EDAp. 204
9.3 Parallel Models for EDAsp. 206
9.4 A Classification of Parallel EDAsp. 216
9.5 Conclusionsp. 219
Referencesp. 220
10 Parallel Scatter Searchp. 223
10.1 Introductionp. 223
10.2 Scatter Searchp. 224
10.3 Parallel Scatter Searchp. 225
10.4 Application of Scatter Search to the p-Median Problemp. 229
10.5 Application of Scatter Search to Feature Subset Selectionp. 232
10.6 Computational Experimentsp. 239
10.7 Conclusionsp. 243
Referencesp. 244
11 Parallel Variable Neighborhood Searchp. 247
11.1 Introductionp. 247
11.2 The VNS Metaheuristicp. 248
11.3 The Parallelizationsp. 251
11.4 Application of VNS for the p-medianp. 258
11.5 Computational Experimentsp. 262
11.6 Conclusionsp. 263
Referencesp. 264
12 Parallel Simulated Annealingp. 267
12.1 Introductionp. 267
12.2 Simulated Annealingp. 268
12.3 Parallel Simulated Annealingp. 269
12.4 A Case Studyp. 275
12.5 Summaryp. 283
Referencesp. 284
13 Parallel Tabu Searchp. 289
13.1 Introductionp. 289
13.2 Tabu Searchp. 290
13.3 Parallelization Strategies for Tabu Searchp. 291
13.4 Literature Reviewp. 294
13.5 Two Parallel Tabu Search Heuristics for Real-Time Fleet Managementp. 302
13.6 Perspectives and Research Directionsp. 305
Referencesp. 306
14 Parallel Greedy Randomized Adaptive Search Proceduresp. 315
14.1 Introductionp. 315
14.2 Multiple-Walk Independent-Thread Strategiesp. 317
14.3 Multiple-Walk Cooperative-Thread Strategiesp. 323
14.4 Some Parallel GRASP Implementationsp. 327
14.5 Conclusionp. 340
Referencesp. 341
15 Parallel Hybrid Metaheuristicsp. 347
15.1 Introductionp. 347
15.2 Historical Notes on Hybrid Metaheuristicsp. 348
15.3 Classifying Hybrid Metaheuristicsp. 350
15.4 Implementing Parallel Hybrid Metaheuristicsp. 355
15.5 Applications of Parallel Hybrid Metaheuristicsp. 358
15.6 Conclusionsp. 359
Referencesp. 359
16 Parallel Multiobjective Optimizationp. 371
16.1 Introductionp. 371
16.2 Parallel Metaheuristics for Multiobjective Optimizationp. 372
16.3 Two Parallel Multiobjective Metaheuristicsp. 377
16.4 Experimentationp. 379
16.5 Conclusions and Future Workp. 386
Referencesp. 387
17 Parallel Heterogeneous Metaheuristicsp. 395
17.1 Introductionp. 395
17.2 Heterogeneous Metaheuristics Surveyp. 397
17.3 Taxonomy of Parallel Heterogeneous Metaheuristicsp. 400
17.4 Frameworks for Heterogeneous Metaheuristicsp. 404
17.5 Concluding Remarksp. 406
17.6 Annotated Bibliographyp. 407
Referencesp. 412
Part III Theory and Applicationsp. 423
18 Theory of Parallel Genetic Algorithmsp. 425
18.1 Introductionp. 425
18.2 Master-Slave Parallel GAsp. 428
18.3 Multipopulation Parallel GAsp. 430
18.4 Cellular Parallel GAsp. 437
18.5 Conclusionsp. 438
Referencesp. 439
19 Parallel Metaheuristics Applicationsp. 447
19.1 Introductionp. 447
19.2 Parallel Metaheuristicsp. 448
19.3 Graph Coloringp. 451
19.4 Graph Partitioningp. 452
19.5 Steiner Tree Problemp. 456
19.6 Set Partitioning and Coveringp. 457
19.7 Satisfiability Problemsp. 459
19.8 Quadratic Assignmentp. 462
19.9 Location Problemsp. 464
19.10 Network Designp. 468
19.11 The Traveling Salesman Problemp. 471
19.12 Vehicle Routing Problemsp. 476
19.13 Summaryp. 479
Referencesp. 480
20 Parallel Metaheuristics in Telecommunicationsp. 495
20.1 Introductionp. 495
20.2 Network Designp. 496
20.3 Network Routingp. 502
20.4 Network Assignment and Dimensioningp. 504
20.5 Conclusionsp. 510
Referencesp. 510
21 Bioinformatics and Parallel Metaheuristicsp. 517
21.1 Introductionp. 517
21.2 Bioinformatics at a Glancep. 519
21.3 Parallel Computersp. 522
21.4 Bioinformatic Applicationsp. 526
21.5 Parallel Metaheuristics in Bioinformaticsp. 534
21.6 Conclusionsp. 543
Referencesp. 543