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.

Texte du rabat

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.

Résumé
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.

Contenu
1 Selected Topics in Simulated Annealing.- 2 Reactive Tabu Search with Path-Relinking for the Steiner Problem in Graphs.- 3 A GRASP for Job Shop Scheduling.- 4 A Reactive GRASP for Transmission Network Expansion Planning.- 5 Tabu Search for Two-Dimensional Irregular Cutting.- 6 A Study of Global Convexity for a Multiple Objective Travelling Sales- man Problem.- 7 A Lower Bound Based Meta-Heuristic for the Vehicle Routing Problem.- 8 A Simulated Annealing Approach for Minimum Cost Isolated Failure Immune Networks.- 9 A GRASP Interactive Approach to the Vehicle Routing Problem with Backhauls.- 10 Parallel Cooperative Approaches for the Labor Constrained Scheduling Problem.- 11 A Scatter Search Algorithm for the Maximum Clique Problem.- 12 The Noising Methods: A Survey.- 13 Strategies for the Parallel Implementation of Metaheuristics.- 14 Accelerating Strategies in Column Generation Methods for Vehicle Routing and Crew Scheduling Problems.- 15 GRASP: An Annotated Bibliography.- 16 Recent Advances in Tabu Search.- 17 Lagrangean Tabu Search.- 18 A GIDS Metaheuristic Approach to the Fleet Size and Mix Vehicle Routing Problem.- 19 Developments of Variable Neighborhood Search.- 20 Analyzing the Performance of Local Search Algorithms Using Generalized Hill Climbing Algorithms.- 21 Ant Colony Optimization: An Overview.- 22 Intensification Neighborhoods for Local Search Methods.- 23 New Heuristics for the Euclidean Steiner Problem in Rn.- 24 Mathematical Analysis of Evolutionary Algorithms.- 25 Formulation and Tabu Search Algorithm for the Resource Constrained Project Scheduling Problem.- 26 Analysing the Run-Time Behaviour of Iterated Local Search for the Travelling Salesman Problem.- 27 POPMUSIC Partial Optimization Metaheuristic under Special Intensification Conditions.- 28Subcost-Guided Simulated Annealing.- 29 A Pruning Pattern List Approach to the Permutation Flowshop Scheduling Problem.