Skip to main content
SpringerLink
Log in

Essays and Surveys in Metaheuristics

  • Book
  • © 2002

Overview

Authors:
  1. Celso C. Ribeiro

    1. Catholic University of Rio de Janeiro, Brazil

    View author publications

    You can also search for this author in PubMed   Google Scholar

  2. Pierre Hansen

    1. École des Hautes Études Commerciales, Canada

    View author publications

    You can also search for this author in PubMed   Google Scholar

Part of the book series: Operations Research/Computer Science Interfaces Series (ORCS, volume 15)

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book USD 219.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (29 chapters)

  1. Front Matter

    Pages i-xi
    Download chapter PDF

  2. Selected Topics in Simulated Annealing

    • Emile Aarts, Jan Korst
    Pages 1-37

  3. Reactive Tabu Search with Path-Relinking for the Steiner Problem in Graphs

    • Marcelo P. Bastos, Celso C. Ribeiro
    Pages 39-58

  4. A Grasp for Job Shop Scheduling

    • S. Binato, W. J. Hery, D. M. Loewenstern, M. G. C. Resende
    Pages 59-79

  5. A Reactive Grasp for Transmission Network Expansion Planning

    • Silvio Binato, Gerson Couto Oliveira
    Pages 81-100

  6. Tabu Search for Two-Dimensional Irregular Cutting

    • Jacek Btażewicz, Adrian Moret Salvador, Rafat Walkowiak
    Pages 101-128

  7. A Study of Global Convexity for a Multiple Objective Travelling Salesman Problem

    • Pedro Castro Borges, Michael Pilegaard Hansen
    Pages 129-150

  8. A Lower Bound Based Meta-Heuristic for the Vehicle Routing Problem

    • José Brandão
    Pages 151-168

  9. A Simulated Annealing Approach for Minimum Cost Isolated Failure Immune Networks

    • Alfredo Candia, Hugo Bravo
    Pages 169-183

  10. A Grasp Interactive Approach to the Vehicle Routing Problem with Backhauls

    • Carlos Carreto, Barrie Baker
    Pages 185-199

  11. Parallel Cooperative Approaches for the Labor Constrained Scheduling Problem

    • Cristina C. B. Cavalcante, Victor F. Cavalcante, Celso C. Ribeiro, Cid C. de Souza
    Pages 201-225

  12. A Scatter Search Algorithm for the Maximum Clique Problem

    • Luís Cavique, César Rego, Isabel Themido
    Pages 227-244

  13. The Noising Methods: A Survey

    • Irène Charon, Olivier Hudry
    Pages 245-261

  14. Strategies for the Parallel Implementation of Metaheuristics

    • Van-Dat Cung, Simone L. Martins, Celso C. Ribeiro, Catherine Roucairol
    Pages 263-308

  15. Accelerating Strategies in Column Generation Methods for Vehicle Routing and Crew Scheduling Problems

    • Guy Desaulniers, Jacques Desrosiers, Marius M. Solomon
    Pages 309-324

  16. Grasp: An Annotated Bibliography

    • Paola Festa, Mauricio G.C. Resende
    Pages 325-367

  17. Recent Advances in Tabu Search

    • Michel Gendreau
    Pages 369-377

  18. Lagrangean Tabu Search

    • Tore Grünert
    Pages 379-397

  19. A Gids Metaheuristic Approach to the Fleet Size and Mix Vehicle Routing Problem

    • Anthony Fu-Wha Han, Yuh-Jen Cho
    Pages 399-413

  20. Developments of Variable Neighborhood Search

    • Pierre Hansen, Nenad Mladenović
    Pages 415-439
Back to top

Keywords

About this book

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.

Authors and Affiliations

  • Catholic University of Rio de Janeiro, Brazil

    Celso C. Ribeiro

  • École des Hautes Études Commerciales, Canada

    Pierre Hansen

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation