Essays and Surveys in Metaheuristics

  • Celso C. Ribeiro
  • Pierre Hansen

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

Table of contents

  1. Front Matter
    Pages i-xi
  2. Emile Aarts, Jan Korst
    Pages 1-37
  3. Marcelo P. Bastos, Celso C. Ribeiro
    Pages 39-58
  4. S. Binato, W. J. Hery, D. M. Loewenstern, M. G. C. Resende
    Pages 59-79
  5. Silvio Binato, Gerson Couto Oliveira
    Pages 81-100
  6. Jacek Btażewicz, Adrian Moret Salvador, Rafat Walkowiak
    Pages 101-128
  7. Pedro Castro Borges, Michael Pilegaard Hansen
    Pages 129-150
  8. Cristina C. B. Cavalcante, Victor F. Cavalcante, Celso C. Ribeiro, Cid C. de Souza
    Pages 201-225
  9. Luís Cavique, César Rego, Isabel Themido
    Pages 227-244
  10. Irène Charon, Olivier Hudry
    Pages 245-261
  11. Van-Dat Cung, Simone L. Martins, Celso C. Ribeiro, Catherine Roucairol
    Pages 263-308
  12. Guy Desaulniers, Jacques Desrosiers, Marius M. Solomon
    Pages 309-324
  13. Paola Festa, Mauricio G.C. Resende
    Pages 325-367
  14. Michel Gendreau
    Pages 369-377
  15. Tore Grünert
    Pages 379-397
  16. Pierre Hansen, Nenad Mladenović
    Pages 415-439
  17. Vittorio Maniezzo, Antonella Carbonaro
    Pages 469-492
  18. Flávio Montenegro, Nelson Maculan, Gérard Plateau, Patrick Boucher
    Pages 509-524
  19. H. Mühlenbein, Th. Mahnig
    Pages 525-556
  20. Mike Wright
    Pages 631-639

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.


Analysis algorithms evolutionary algorithm genetic algorithms heuristics metaheuristic optimization scheduling

Authors and affiliations

  • Celso C. Ribeiro
    • 1
  • Pierre Hansen
    • 2
  1. 1.Catholic University of Rio de JaneiroBrazil
  2. 2.École des Hautes Études CommercialesCanada

Bibliographic information

  • DOI
  • Copyright Information Kluwer Academic Publishers 2002
  • Publisher Name Springer, Boston, MA
  • eBook Packages Springer Book Archive
  • Print ISBN 978-1-4613-5588-5
  • Online ISBN 978-1-4615-1507-4
  • Series Print ISSN 1387-666X
  • Buy this book on publisher's site