Skip to main content
SpringerLink
Log in

Metaheuristics:

Progress as Real Problem Solvers

  • Book
  • © 2005

Overview

Editors:
  1. Toshihide Ibaraki

    1. Kyoto University, Japan

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Koji Nonobe

    1. Kyoto University, Japan

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Mutsunori Yagiura

    1. Kyoto University, Japan

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  • Surveys some of the most recent solution approaches involving genetic algorithms, simulated annealing, tabu search, evolutionary computation, greedy randomized adaptive search procedures (GRASP), scatter search, ant system, variable neighborhood search, guided local search, iterated local search, noising methods, threshold accepting, memetic algorithms, neural networks, and other hybrid and/or variant approaches for solving hard combinatorial problems

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

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 159.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book USD 109.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 (18 chapters)

  1. Front Matter

    Pages i-xi
    Download chapter PDF

  2. Invited Paper

    1. Metaheuristic Agent Processes (MAPS)

      • Fred Glover, Gary Kochenberger
      Pages 1-28

  3. Tutorial Paper

    1. GRASP with Path-Relinking: Recent Advances and Applications

      • Mauricio G.C. Resendel, Celso C. Ribeiro
      Pages 29-63

  4. Papers on Problem Solving

    1. A Tabu Search Heuristic for a University Timetabling Problem

      • Halvard Arntzen, Arne Løkketangen
      Pages 65-85

    2. An Investigation of Automated Planograms Using a Simulated Annealing Based Hyper-Heuristic

      • Ruibin Bai, Graham Kendall
      Pages 87-108

    3. Validation and Optimization of an Elevator Simulation Model with Modern Search Heuristics

      • Thomas Bartz-Beielstein, Mike Preuss, Sandor Markon
      Pages 109-128

    4. Multi-Objective Hyper-Heuristic Approaches for Space Allocation and Timetabling

      • Edmund K. Burke, J. Dario Landa Silva, Eric Soubeiga
      Pages 129-158

    5. Theory and Practice of the Minimum Shift Design Problem

      • Luca Di Gasperol, Johannes Gärtner, Guy Kortsarz, Nysret Musliu, Andrea Schaerf, Wolfgang Slany
      Pages 159-180

    6. Local Search Algorithms for the Two-Dimensional Cutting Stock Problem with a Given Number of Different Patterns

      • Shinji Imahori, Mutsunori Yagiura, Shunji Umetani, Shinya Adachi, Toshihide Ibaraki
      Pages 181-202

    7. A Generic Object-Oriented Tabu Search Framework

      • Hoong C. Lau, Xiaomin Jia, Wee C. Wan
      Pages 203-226

    8. Bi-Objective Sequencing of Cutting Patterns

      • Ana Respicio, M. Eugénia Captivo
      Pages 227-241

    9. Metaheuristics Approach for Rule Acquisition in Flexible Shop Scheduling Problems

      • Kazutoshi Sakakibara, Hisashi Tamaki, Hajime Murao, Shinzo Kitamura
      Pages 243-258

    10. Predicting Colorectal Cancer Recurrence: A Hybrid Neural Networks-Based Approach

      • Rob Smithies, Said Salhi, Nat Queen
      Pages 259-285

    11. A Constructive Genetic Approach to Point-Feature Cartographic Label Placement

      • Missae Yamamoto, Luiz A.N. Lorena
      Pages 287-302

  5. Papers on Methodologies

    1. Parallel Strategies for Grasp with Path-Relinking

      • Renata M. Aiex, Mauricio G.C. Resende
      Pages 303-333

    2. Speeding Up Local Search Neighborhood Evaluation for A Multi-Dimensional Knapsack Problem

      • Ross J.W. James
      Pages 335-350

    3. Computationally Difficult Instances for the Uncapacitated Facility Location Problem

      • Yuri Kochetov, Dmitry Ivanenko
      Pages 351-367

    4. Consistent Neighbourhood in a Tabu Search

      • Michel Vasquez, Audrey Dupont, Djamal Habet
      Pages 369-388

    5. Constraint Oriented Neighbourhoods — A New Search Strategy in Metaheuristics

      • Ana Viana, Jorge P. Sousa, Manuel A. Matos
      Pages 389-414
Back to top

Keywords

About this book

Metaheuristics: Progress as Real Problem Solvers is a peer-reviewed volume of eighteen current, cutting-edge papers by leading researchers in the field. Included are an invited paper by F. Glover and G. Kochenberger, which discusses the concept of Metaheuristic agent processes, and a tutorial paper by M.G.C. Resende and C.C. Ribeiro discussing GRASP with path-relinking. Other papers discuss problem-solving approaches to timetabling, automated planograms, elevators, space allocation, shift design, cutting stock, flexible shop scheduling, colorectal cancer and cartography. A final group of methodology papers clarify various aspects of Metaheuristics from the computational view point.

Editors and Affiliations

  • Kyoto University, Japan

    Toshihide Ibaraki, Koji Nonobe, Mutsunori Yagiura

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation