04781nam a22005175i 4500 978-0-387-23667-4 DE-He213 20260521091828.0 cr nn 008mamaa 100301s2005 xxu| s |||| 0|eng d 9780387236674 99780387236674 10.1007/b102147 doi CICY 519.6 23 Sharda, Ramesh. editor. Metaheuristic Optimization via Memory and Evolution [recurso electrónico] : Tabu Search and Scatter Search / edited by Ramesh Sharda, Stefan Voß, César Rego, Bahram Alidaee. Boston, MA : Springer US, 2005. XIV, 466 p. 69 illus. online resource. text txt rdacontent computer c rdamedia recurso en línea cr rdacarrier text file PDF rda Operations Research/Computer Science Interfaces Series, 1387-666X ; 30 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. 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 MATHEMATICS. MATHEMATICAL OPTIMIZATION. OPERATIONS RESEARCH. ENGINEERING MATHEMATICS. MATHEMATICS. OPERATIONS RESEARCH, MATHEMATICAL PROGRAMMING. OPTIMIZATION. OPERATIONS RESEARCH/DECISION THEORY. APPL.MATHEMATICS/COMPUTATIONAL METHODS OF ENGINEERING. Voß, Stefan. editor. Rego, César. editor. Alidaee, Bahram. editor. SpringerLink (Online service) Springer eBooks Printed edition: 9781402081347 Operations Research/Computer Science Interfaces Series, 1387-666X ; 30 http://dx.doi.org/10.1007/b102147 Ver el texto completo en las instalaciones del CICY ddc ER 32182 32182 0 0 ddc 0 0 LE CICY CICY EL 2025-07-10 0 519.6 2025-07-10 08:39:29 2025-07-10 ER