Meta-Heuristics

1. Front Matter

   Pages i-xii

   PDF

2. Tabu Search

   1. Front Matter

      Pages 1-1

      PDF

   2. Tabu Search Algorithms and Lower Bounds for the Resource-Constrained Project Scheduling Problem

      • Tonius Baar, Peter Brucker, Sigrid Knust

      Pages 1-18

   3. Metaheuristic for the Vehicle Routing Problem with Time Windows

      • José Brandão

      Pages 19-36

   4. New Heuristic Algorithms for the Crew Scheduling Problem

      • Luis Cavique, César Rego, Isabel Themido

      Pages 37-47

   5. Enhanced Continuous Tabu Search: An Algorithm for Optimizing Multiminima Functions

      • Rachid Chelouah, Patrick Siarry

      Pages 49-61

   6. Local Search in Constraint Programming: Experiments with Tabu Search on the Vehicle Routing Problem

      • Bruno De Backer, Vincent Furnon

      Pages 63-76

   7. Tabu Search for Graph Coloring, T-Colorings and Set T-Colorings

      • Raphaël Dorne, Jin-Kao Hao

      Pages 77-92

   8. Tabu Search with Critical Event Memory: An Enhanced Application for Binary Quadratic Programs

      • Fred Glover, Gary Kochenberger, Bahram Alidaee, Mohammed Amini

      Pages 93-109

   9. Actuator Selection for the Control of Multi-Frequency Noise in Aircraft Interiors

      • Rex K. Kincaid, Sharon L. Padula

      Pages 111-124

   10. Neighborhood Search Algorithm for the Guillotine Non-Oriented Two-Dimensional Bin Packing Problem

       • Andrea Lodi, Silvano Martello, Daniele Vigo

       Pages 125-139

   11. Candidate List and Exploration Strategies for Solving 0/1 Mip Problems Using a Pivot Neighborhood

       • Arne Løkketangen, Fred Glover

       Pages 141-154

   12. Global and Local Moves in Tabu Search: A Real-Life Mail Collecting Application

       • Redouane Mechti, Stephane Poujade, Catherine Roucairol, Bernard Lemarié

       Pages 155-174

   13. Flow Line Scheduling by Tabu Search

       • Eugeniusz Nowicki, Czesław Smutnicki

       Pages 175-189

3. Combined and Hybrid Approaches

   1. Front Matter

      Pages 191-191

      PDF

   2. Using Lower Bounds in Minimum Span Frequency Assignment

      • Stuart M. Allen, Steve Hurley, Derek H. Smith, Stefan U. Thiel

      Pages 191-204

   3. A Hybrid Heuristic for Multiobjective Knapsack Problems

      • Foued Ben Abdelaziz, Saoussen Krichen, Jouhaina Chaouachi

      Pages 205-212

   4. Hybrid Genetic Tabu Search for a Cyclic Scheduling Problem

      • Peter Greistorfer

      Pages 213-229

4. Genetic and Evolutionary Algorithms

   1. Front Matter

      Pages 231-231

      PDF

   2. Adaptive Genetic Algorithms: A Methodology for Dynamic Autoconfiguration of Genetic Search Algorithms

      • Ulrich Derigs, Martin Kabath, Markus Zils

      Pages 231-248

Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimizations comprises a carefully refereed selection of extended versions of the best papers presented at the Second Meta-Heuristics Conference (MIC 97). The selected articles describe the most recent developments in theory and applications of meta-heuristics, heuristics for specific problems, and comparative case studies. The book is divided into six parts, grouped mainly by the techniques considered. The extensive first part with twelve papers covers tabu search and its application to a great variety of well-known combinatorial optimization problems (including the resource-constrained project scheduling problem and vehicle routing problems). In the second part we find one paper where tabu search and simulated annealing are investigated comparatively and two papers which consider hybrid methods combining tabu search with genetic algorithms. The third part has four papers on genetic and evolutionary algorithms. Part four arrives at a new paradigm within meta-heuristics. The fifth part studies the behavior of parallel local search algorithms mainly from a tabu search perspective. The final part examines a great variety of additional meta-heuristics topics, including neural networks and variable neighbourhood search as well as guided local search. Furthermore, the integration of meta-heuristics with the branch-and-bound paradigm is investigated.

• Constraint satisfaction
• actuator
• algorithm
• algorithms
• combinatorial optimization
• evolutionary algorithm
• genetic algorithms
• global optimization
• heuristics
• metaheuristic
• model
• optimization
• programming
• scheduling

• Technical University of Braunschweig, Germany

  Stefan Voß

• University of Bologna, Italy

  Silvano Martello

• University of Kent, UK

  Ibrahim H. Osman

• University of Versailles, France

  Catherine Roucairol

Policies and ethics