Ebook: Essays and Surveys in Metaheuristics

Finding exact solutions to many combinatorial optimization problems in busi­ ness, engineering, and science still poses a real challenge, despite the impact of recent advances in mathematical programming and computer technology. New fields of applications, such as computational biology, electronic commerce, and supply chain management, bring new challenges and needs for algorithms and optimization techniques. Metaheuristics are master procedures that guide and modify the operations of subordinate heuristics, to produce improved approx­ imate solutions to hard optimization problems with respect to more simple algorithms. They also provide fast and robust tools, producing high-quality solutions in reasonable computation times. The field of metaheuristics has been fast evolving in recent years. Tech­ niques such as simulated annealing, tabu search, genetic algorithms, scatter search, greedy randomized adaptive search, variable neighborhood search, ant systems, and their hybrids are currently among the most efficient and robust optimization strategies to find high-quality solutions to many real-life optimiza­ tion problems. A very large nmnber of successful applications of metaheuristics are reported in the literature and spread throughout many books, journals, and conference proceedings. A series of international conferences entirely devoted to the theory, applications, and computational developments in metaheuristics has been attracting an increasing number of participants, from universities and the industry.

---

The field of metaheuristics has been fast evolving in recent years. Techniques such as simulated annealing, tabu search, genetic algorithms, scatter search, greedy randomized adaptive search, variable neighborhood search, ant systems, and their hybrids are currently among the most efficient and robust optimization strategies to find high-quality solutions to many real-life optimization problems. A very large number of successful applications of metaheuristics are reported in the literature and spread throughout many books, journals, and conference proceedings. A series of international conferences entirely devoted to the theory, applications, and computational developments in metaheuristics has been attracting an increasing number of participants, from universities and the industry.
Essays and Surveys in Metaheuristics goes beyond the recent conference-oriented volumes in Metaheuristics, with its focus on surveys of recent developments of the main metaheuristics. Well-known specialists have written surveys on the following subjects: simulated annealing (E. Aarts and J. Korst, The Netherlands), noising methods (I. Charon and O. Hudry, France), strategies for the parallel implementation of metaheuristics (V.-D. Cung and C. Roucairol, France, and S.L. Martins and C.C. Ribeiro, Brazil), greedy randomized adaptive search procedures (P. Festa, Italy, and M.G.C. Resende, USA), tabu search (M. Gendreau, Canada), variable neighborhood search (P. Hansen and N. Mladenovic, Canada), ant colonies (V. Maniezzo and A. Carbonaro, Italy), and evolutionary algorithms (H. M?hlenbein and Th. Mahnig, Germany). Several further essays address issues or variants of metaheuristics, as well as innovative or successful applications of metaheuristics to classical or new combinatorial optimization problems.

---

The field of metaheuristics has been fast evolving in recent years. Techniques such as simulated annealing, tabu search, genetic algorithms, scatter search, greedy randomized adaptive search, variable neighborhood search, ant systems, and their hybrids are currently among the most efficient and robust optimization strategies to find high-quality solutions to many real-life optimization problems. A very large number of successful applications of metaheuristics are reported in the literature and spread throughout many books, journals, and conference proceedings. A series of international conferences entirely devoted to the theory, applications, and computational developments in metaheuristics has been attracting an increasing number of participants, from universities and the industry.
Essays and Surveys in Metaheuristics goes beyond the recent conference-oriented volumes in Metaheuristics, with its focus on surveys of recent developments of the main metaheuristics. Well-known specialists have written surveys on the following subjects: simulated annealing (E. Aarts and J. Korst, The Netherlands), noising methods (I. Charon and O. Hudry, France), strategies for the parallel implementation of metaheuristics (V.-D. Cung and C. Roucairol, France, and S.L. Martins and C.C. Ribeiro, Brazil), greedy randomized adaptive search procedures (P. Festa, Italy, and M.G.C. Resende, USA), tabu search (M. Gendreau, Canada), variable neighborhood search (P. Hansen and N. Mladenovic, Canada), ant colonies (V. Maniezzo and A. Carbonaro, Italy), and evolutionary algorithms (H. M?hlenbein and Th. Mahnig, Germany). Several further essays address issues or variants of metaheuristics, as well as innovative or successful applications of metaheuristics to classical or new combinatorial optimization problems.
Content:
Front Matter....Pages i-xi
Selected Topics in Simulated Annealing....Pages 1-37
Reactive Tabu Search with Path-Relinking for the Steiner Problem in Graphs....Pages 39-58
A Grasp for Job Shop Scheduling....Pages 59-79
A Reactive Grasp for Transmission Network Expansion Planning....Pages 81-100
Tabu Search for Two-Dimensional Irregular Cutting....Pages 101-128
A Study of Global Convexity for a Multiple Objective Travelling Salesman Problem....Pages 129-150
A Lower Bound Based Meta-Heuristic for the Vehicle Routing Problem....Pages 151-168
A Simulated Annealing Approach for Minimum Cost Isolated Failure Immune Networks....Pages 169-183
A Grasp Interactive Approach to the Vehicle Routing Problem with Backhauls....Pages 185-199
Parallel Cooperative Approaches for the Labor Constrained Scheduling Problem....Pages 201-225
A Scatter Search Algorithm for the Maximum Clique Problem....Pages 227-244
The Noising Methods: A Survey....Pages 245-261
Strategies for the Parallel Implementation of Metaheuristics....Pages 263-308
Accelerating Strategies in Column Generation Methods for Vehicle Routing and Crew Scheduling Problems....Pages 309-324
Grasp: An Annotated Bibliography....Pages 325-367
Recent Advances in Tabu Search....Pages 369-377
Lagrangean Tabu Search....Pages 379-397
A Gids Metaheuristic Approach to the Fleet Size and Mix Vehicle Routing Problem....Pages 399-413
Developments of Variable Neighborhood Search....Pages 415-439
Analyzing the Performance of Local Search Algorithms Using Generalized Hill Climbing Algorithms....Pages 441-467
Ant Colony Optimization: An Overview....Pages 469-492
Intensification Neighborhoods for Local Search Methods....Pages 493-508
Mathematical Analysis of Evolutionary Algorithms....Pages 509-524
Formulation and Tabu Search Algorithm for the Resource Constrained Project Scheduling Problem....Pages 525-556
Analysing the Run-Time Behaviour of Iterated Local Search for the Travelling Salesman Problem....Pages 557-588
Popmusic — Partial Optimization Metaheuristic under Special Intensification Conditions....Pages 589-611
Subcost-Guided Simulated Annealing....Pages 613-629
A Pruning Pattern List Approach to the Permutation Flowshop Scheduling Problem....Pages 631-639
....Pages 641-651