Cantitate/Preț
Produs
Total produse
Vezi coșul
Metaheuristic Optimization via Memory and Evolution: Tabu Search and Scatter Search de Cesar Rego

Metaheuristic Optimization via Memory and Evolution: Tabu Search and Scatter Search: Operations Research/Computer Science Interfaces Series, cartea 30

Editat de Cesar Rego, Bahram Alidaee
en Limba Engleză Paperback – 8 dec 2010
Tabu Search (TS) and, more recently, Scatter Search (SS) have proved highly effective in solving a wide range of optimization problems, and have had a variety of applications in industry, science, and government. The goal of Metaheuristic Optimization via Memory and Evolution: Tabu Search and Scatter Search is to report original research on algorithms and applications of tabu search, scatter search or both, as well as variations and extensions having "adaptive memory programming" as a primary focus. Individual chapters identify useful new implementations or new ways to integrate and apply the principles of TS and SS, or that prove new theoretical results, or describe the successful application of these methods to real world problems.
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (1) 88359 lei  6-8 săpt.
  Springer Us – 8 dec 2010 88359 lei  6-8 săpt.
Hardback (1) 64779 lei  6-8 săpt.
  Springer Us – 11 ian 2005 64779 lei  6-8 săpt.

Din seria Operations Research/Computer Science Interfaces Series

Preț: 88359 lei

Preț vechi: 107754 lei
-18% Nou

Puncte Express: 1325
Preț estimativ în valută:
16915€ • 17396$ • 14033£

Carte tipărită la comandă

Livrare economică 19 februarie-05 martie

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9781441954831
ISBN-10: 144195483X
Pagini: 466
Ilustrații: XIV, 466 p. 69 illus.
Dimensiuni: 155 x 235 x 25 mm
Greutate: 0.67 kg
Ediția:Softcover reprint of hardcover 1st ed. 2005
Editura: Springer Us
Colecția Springer
Seria Operations Research/Computer Science Interfaces Series

Locul publicării:New York, NY, United States

Public țintă

Research

Cuprins

Advances for New Model and Solution Approaches.- A Scatter Search Tutorial for Graph-Based Permutation Problems.- A Multistart Scatter Search Heuristic for Smooth NLP and MINLP Problems.- Scatter Search Methods for the Covering Tour Problem.- Solution of the SONET Ring Assignment Problem with Capacity Constraints.- Advances for Solving Classical Problems.- A Very Fast Tabu Search Algorithm for Job Shop Problem.- Tabu Search Heuristics for the Vehicle Routing Problem.- Some New Ideas in TS for Job Shop Scheduling.- A Tabu Search Heuristic for the Uncapacitated Facility Location Problem.- Adaptive Memory Search Guidance for Satisfiability Problems.- Experimental Evaluations.- Lessons from Applying and Experimenting with Scatter Search.- Tabu Search for Mixed Integer Programming.- Scatter Search vs. Genetic Algorithms.- Review of Recent Developments.- Parallel Computation, Co-operation, Tabu Search.- Using Group Theory to Construct and Characterize Metaheuristic Search Neighborhoods.- Logistics Management.- New Procedural Designs.- On the Integration of Metaheuristic Strategies in Constraint Programming.- General Purpose Metrics for Solution Variety.- Controlled Pool Maintenance for Metaheuristics.- Adaptive Memory Projection Methods for Integer Programming.- RAMP: A New Metaheuristic Framework for Combinatorial Optimization.

Textul de pe ultima copertă

Tabu Search (TS) and, more recently, Scatter Search (SS) have proved highly effective in solving a wide range of optimization problems, and have had a variety of applications in industry, science, and government. The goal of METAHEURISTIC OPTIMIZATION VIA MEMORY AND EVOLUTION: Tabu Search and Scatter Search is to report original research on algorithms and applications of tabu search, scatter search or both, as well as variations and extensions having "adaptive memory programming" as a primary focus. Individual chapters identify useful new implementations or new ways to integrate and apply the principles of TS and SS, or that prove new theoretical results, or describe the successful application of these methods to real world problems.
From the preface:
…Where Are We Headed?
The chapters of this book provide a series of landmarks along the way as we investigate and seek to better understand the elements of tabu search and scatter search that account for their successes in an astonishingly varied range of applications. The contributions of the chapters are diverse in scope, and are not uniform in the degree that they plumb or take advantage of fundamental principles underlying TS and SS. Collectively, however, they offer a useful glimpse of issues that deserve to be set in sharper perspective, and that move us farther along the way toward dealing with problems whose size and complexity pose key challenges to the optimization methods of tomorrow...
Fred Glover
University of Colorado

Caracteristici

Unique in its treatment of the new linkage technology in Adaptive Memory Programming (AMP), which allows researchers to link major heuristic strategies together and the linked combination provides a wider and more problem-solving power