𝔖 Scriptorium
✦   LIBER   ✦

πŸ“

Metaheuristic Optimization via Memory and Evolution. Tabu Search and Scatter Search

✍ Scribed by Cesar Rego, Bahram Alidaee


Publisher
Springer
Year
2010
Tongue
English
Leaves
471
Series
Operations Research Computer Science Interfaces Series
Edition
1st Edition.
Category
Library

⬇  Acquire This Volume

No coin nor oath required. For personal study only.

✦ Synopsis


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.


πŸ“œ SIMILAR VOLUMES


Metaheuristic Optimization via Memory an
✍ CΓ©sar Rego, Pedro LeΓ£o (auth.), Professor Ramesh Sharda, Prof. Dr. Stefan Voß, C πŸ“‚ Library πŸ“… 2005 πŸ› Springer US 🌐 English

<p><P>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

Metaheuristic Optimization via Memory an
✍ Cesar Rego and Bahrain Alidaee πŸ“‚ Library πŸ“… 2005 🌐 English

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 Scatte

Metaheuristics for Hard Optimization: Si
✍ Johann DrΓ©o, Professor Patrick Siarry, Alain PΓ©trowski, Professor Eric Taillard πŸ“‚ Library πŸ“… 2006 πŸ› Springer-Verlag Berlin Heidelberg 🌐 English

<p><P>Metaheuristics for Hard Optimization comprises of three parts. The first part is devoted to the detailed presentation of the four most widely known metaheuristics:</P><P>β€’ the simulated annealing method,</P><P>β€’ tabu search,</P><P>β€’ the evolutionary algorithms,</P><P>β€’ ant colony algorithms.</

Search and Optimization by Metaheuristic
✍ Ke-Lin Du, M. N. S. Swamy (auth.) πŸ“‚ Library πŸ“… 2016 πŸ› BirkhΓ€user Basel 🌐 English

<p>This textbook provides a comprehensive introduction to nature-inspired metaheuristic methods for search and optimization, including the latest trends in evolutionary algorithms and other forms of natural computing. Over 100 different types of these methods are discussed in detail. The authors emp