Book Description
This book explores the meta-heuristics approach called tabusearch, which is dramatically changing our ability to solve a hostof problems that stretch over the realms of resource planning,telecommunications, VLSI design, financial analysis, scheduling, spaceplanning, energy distribution, molecular engineering, logistics,pattern classification, flexible manufacturing, waste management,mineral exploration, biomedical analysis, environmental conservationand scores of other problems. The major ideas of tabu search arepresented with examples that show their relevance to multipleapplications. Numerous illustrations and diagrams are used to clarifyprinciples that deserve emphasis, and that have not always been wellunderstood or applied. The book's goal is to provide `hands-on'knowledge and insight alike, rather than to focus exclusively eitheron computational recipes or on abstract themes. This book is designedto be useful and accessible to researchers and practitioners inmanagement science, industrial engineering, economics, and computerscience. It can appropriately be used as a textbook in a masterscourse or in a doctoral seminar. Because of its emphasis on presentingideas through illustrations and diagrams, and on identifyingassociated practical applications, it can also be used as asupplementary text in upper division undergraduate courses. Finally, there are many more applications of tabu search than canpossibly be covered in a single book, and new ones are emerging everyday. The book's goal is to provide a grounding in the essential ideasof tabu search that will allow readers to create successfulapplications of their own. Along with the essential ideas,understanding of advanced issues is provided, enabling researchers togo beyond today's developments and create the methods of tomorrow. ... Read more

Customer Reviews (2)

Might be good for a reference...
Probably the most bloated book I've ever encountered. It seems like this isn't targeted for computer science students. It was completely impossible to read it without falling asleep, because the book could go on and on for pages without presenting anything new except that 1+1=2.

The best source for learning about tabu search would be to read a basic book about (combinatorial) optimization just to teach the vocabulary (like an exact neighborhood etc.). After that, just head to springerlink and download a few articles from the Lectures in Computer Science-series or use some other source for papers relating to applications of tabu search to various optimization problems.

This book is quite good for a reference though.

Great book but too expensive
It's good to read the book that the writer and inventor of theory are the same person.Glover and Laguna conduct this book in a self-comprehensive book.I've never found any good resource of Tabu Search as great as thisbook.Only drawback is the price... too expensive for student.I onlyread it in the library though. I'm glad to know they have the paperbackedition but I'm not sure about the quality of printing. Lastly, get itwhenver you can afford it!.It's worth your money every characters. ... Read more

Book Description

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.

Book Description
Sydney Barham is forced to retire on a small pension to his isolated house in the country. The improvements he effects there make him wish he had someone to leave it to, someone who would give the garden continuity and so afford him a kind of immortality. But a physical condition makes it impossible for him to father a child naturally. When he meets Amanda, a lively divorcée with children of her own, he thinks of marrying her and adopting the children. But it proves a turbulent affair. Then a change in his circumstances, information he gleans from a geneticist, and the dubious lawyer he comes into contact with in America all point him to another direction. With more to leave, his desire for an heir becomes almost obsessive, but the secret measures he takes affect the lives of all those around him and fuel the folklore of the village. ... Read more

Product Description
Why did the first Christians hide Mary Magdalene's true identity? Why did they diminish the crucial role that she must have had in the foundations of the new religion? With research of rare documents that had been hidden for centuries, Juan Arias, a writer and journalist with extensive studies in theology, philology, philosophy, psychology, and semiotics, offers in this polemic book a well-documented hypothesis: Jesus and Mary Magdalene lived a passionate love story. Description in Spanish: María Magdalena fue la mujer escogida por Jesús de Nazaret como primera destinataria de sus revelaciones y los secretos de su sabiduría, y el entorno de Jesús no entendió por qué confió a ella secretos que escondía a sus discípulos más cercanos. Según los evangelio, Jesús resucitado apareció ante ella en primer lugar y, como mensajera, la envió a comunicar la importante noticia a Pedro y los demás apóstoles, escondidos y atemorizados tras la crucifixión. ... Read more

Book Description
This digital document is a journal article from International Journal of Production Economics, published by Elsevier in 2006. The article is delivered in HTML format and is available in your Amazon.com Media Library immediately after purchase. You can view it with any web browser.

Description:
Algorithms to solve Facility Location Problems (FLP) optimally suffer from combinatorial explosion and resources required to solve such problems repeatedly as required in practical applications become prohibitive. In these cases heuristic methods are the only viable alternative. We compare the relative performance of Tabu Search (TS), Simulated Annealing (SA) and Genetic Algorithms (GA) on various types of FLP under time-limited, solution-limited, and unrestricted conditions. The results indicate that TS shows very good performance in most cases. The performance of SA and GA are more partial to problem type and the criterion used. Thus, in general we may conclude that TS should be tried first to the extent that it always yields as good or better results and is easy to develop and implement. ... Read more

Product Description
This is a AIR FORCE INST OF TECH WRIGHT-PATTERSON AFB OH SCHOOL OF ENGINEERING report procured by the Pentagon and made available for public release. It has been reproduced in the best form available to the Pentagon. It is not spiral-bound, but rather assembled with Velobinding in a soft, white linen cover. The Storming Media report number is A641423. The abstract provided by the Pentagon follows: The purpose of this thesis is to provide Air Combat Command a method for determining the number of predator unmanned aerial vehicles (UAVs) required to cover a pre-selected target. Extending previous research that employs reactive TABU search methods for deterministic vehicle routing problems, this thesis incorporates wind effects that can significantly alter the travel times for any given scenario. Additionally, it accounts for possible attrition by introducing minimum risk route and expected number of target covered to the objective function. The results of the TABU search and subsequent Monte-Carlo simulation: gives the number of predator's required to cover a target set, identifies 'robust' routes, and suggests routes that increase expected number of targets covered while reducing losses. ... Read more

Product Description
This is a AIR FORCE INST OF TECH WRIGHT-PATTERSON AFB OH SCHOOL OF ENGINEERING AND MANAGEMENT report procured by the Pentagon and made available for public release. It has been reproduced in the best form available to the Pentagon. It is not spiral-bound, but rather assembled with Velobinding in a soft, white linen cover. The Storming Media report number is A754204. The abstract provided by the Pentagon follows: The application of Group Theory to Tabu Search is a new and exciting field of research. This dissertation applies and extends some of Colletti's (1999) seminal work in group theory and metaheuristics in order to solve the theater distribution vehicle routing and scheduling problem (TDVRSP). This research produced a robust, efficient, effective and flexible generalized theater distribution model that prescribes the routing and scheduling of multi- modal theater transportation assets to provide economically efficient time definite delivery of cargo to customers. In doing so, advances are provided in the field of group theoretic tabu search and its application to difficult combinatorial optimization problems, e.g., the multiple trip multiple services vehicle routing and scheduling problem with hubs and other defining constraints. ... Read more

Product Description
This is a AIR FORCE INST OF TECH WRIGHT-PATTERSONAFB OH SCHOOL OFENGINEERING report procured by the Pentagon and made available for public release. It has been reproduced in the best form available to the Pentagon. It is not spiral-bound, but rather assembled with Velobinding in a soft, white linen cover. The Storming Media report number is A123873. The abstract provided by the Pentagon follows: The traveling salesman problem (TSP) is a combinatorial optimizationproblem that is mathematically modeled as a binary integer program. The TSP is a very important problem for the operations research academician and practitioner. This research demonstrates a Group Theoretic Tabu Search (GTTS) Java algorithmfor the TSP. The tabu search metaheuristic continuously finds near-optimalsolutions to the TSP under various different implementations. Algebraic grouptheory offers a more formal mathematical setting to study the TSP providing atheoretical foundation for describing tabu search. Specifically, this thesisuses the Symmetric Group on n letters, S(n), which is the set of all n!permutations on n letters whose binary operation is permutation multiplication,to describe the TSP solution space. Thus, the TSP is studied as a permutationproblem rather than an integer program by applying the principles of grouptheory to define the tabu search move and neighborhood structure. The grouptheoretic concept of conjugation (an operation involving two group elements)simplifies the move definition as well as the intensification and diversification strategies. Conjugation in GTTS diversifies the search byallowing large rearrangement moves within a tour in a single move operation.Empirical results are presented along with the theoretical motivations for theresearch. ... Read more

Book Description
This digital document is an article from Journal of Computer Science, published by Thomson Gale on March 1, 2007. The length of the article is 2630 words. The page length shown above is based on a typical 300-word page. The article is delivered in HTML format and is available in your Amazon.com Digital Locker immediately after purchase. You can view it with any web browser.

From the author: Key words: Mono-alphabetic substitution cipher, genetic algorithm, tabu search, key search

Citation Details
Title: Genetic Algorithm and Tabu Search attack on the Mono-Alphabetic Subsitution Cipher in Adhoc networks.
Author: A. K. Verma
Publication: Journal of Computer Science (Magazine/Journal)
Date: March 1, 2007
Publisher: Thomson Gale
Volume: 3Issue: 3Page: 134(4)

Distributed by Thomson Gale ... Read more

Product Description
This is a AIR FORCE INST OF TECH WRIGHT-PATTERSONAFB OH SCHOOL OF ENGINEERING report procured by the Pentagon and made available for public release. It has been reproduced in the best form available to the Pentagon. It is not spiral-bound, but rather assembled with Velobinding in a soft, white linen cover. The Storming Media report number is A216243. The abstract provided by the Pentagon follows: An instance of the geometric knapsack problem occurs in air lift loading where a set of cargo must be chosen to pack in a given fleet of aircraft. This paper demonstrates a new heuristic to solve this problem in a reasonable amount of time with a higher quality solution then previously reported in literature. We also report a new tabu search heuristic to solve geometric knapsack problems. We then employ our novel heuristics in a Master and slave relationship, where the knapsack heuristic selects a set of cargo and the packing heuristic determines if that set is feasible. The search incorporates learning mechanisms that react to cycles and thus is robust over a large set of problem sizes. The new knapsack and packing heuristics compare favorably with the best reported efforts in the literature. Additionally, we show the JAVA language to be an effective language for implementing the heuristics. The search is then used in a real world problem of determining how much cargo can be packed with a given fleet of aircraft. ... Read more