• Title Tabu Search
• Author(s) Wassim Jaziri
• Publisher: IN-TECH (January 2008); eBook (Creative Commons Licensed)
• License(s): Attribution 3.0 Unported (CC BY 3.0)
• Hardcover 278 pages
• eBook Online, PDF, 13.9 MB
• Language: English
• ISBN-10: N/A
• ISBN-13: 978-3-902613-34-9
• Share This:  

Book Description

Tabu Search is a mathematical optimization method, belonging to the class of local search techniques. The goal of this book is to report original researches on algorithms and applications of Tabu Search to real-world problems as well as recent improvements and extensions on its concepts and algorithms. It provides a grounding in the essential ideas of tabu search that will allow readers to create successful applications of their own. Along with the essential ideas, understanding of advanced issues is provided, enabling researchers to go beyond today's developments and create the methods of tomorrow.

This book explores the meta-heuristics approach called tabu search, which is dramatically changing our ability to solve a host of problems that stretch over the realms of resource planning, telecommunications, VLSI design, financial analysis, scheduling, space planning, energy distribution, molecular engineering, logistics, pattern classification, flexible manufacturing, waste management, mineral exploration, biomedical analysis, environmental conservation and scores of other problems. The major ideas of tabu search are presented with examples that show their relevance to multiple applications. Numerous illustrations and diagrams are used to clarify principles that deserve emphasis, and that have not always been well understood or applied.

The book provides `hands-on' knowledge and insight alike, rather than to focus exclusively either on computational recipes or on abstract themes. This book is designed to be useful and accessible to researchers and practitioners in management science, industrial engineering, economics, and computer science. It can appropriately be used as a textbook in a masters course or in a doctoral seminar. Because of its emphasis on presenting ideas through illustrations and diagrams, and on identifying associated practical applications, it can also be used as a supplementary text in upper division undergraduate courses. Finally, there are many more applications of tabu search than can possibly be covered in a single book, and new ones are emerging every day.

• N/A

• Amazon

• Algorithms and Data Structures
• Operations Research (OR), Linear Programming, Optimization, and Approximation
• Computational and Algorithmic Mathematics
• Computational Complexity
• Discrete Mathematics

• Tabu Search (Wassim Jaziri)
• PDF Format

• A Survey of Tabu Sear abu Search in Combinat ch in Combinatorial Optimization

• Global Optimization Algorithms - Theory and Application

  This book is devoted to global optimization algorithms, which are methods to find optimal solutions for given problems. It especially focuses on Evolutionary Computation by discussing evolutionary algorithms, genetic algorithms, Genetic Programming, etc.

• Ant Colony Optimization - Techniques and Applications

  The book first describes the translation of observed ant behavior into working optimization algorithms. The Ant Colony Optimization is then introduced and viewed in the general context of combinatorial optimization.

• Introduction to Online Convex Optimization (Elad Hazan)

  This book presents a robust machine learning approach that contains elements of mathematical optimization, game theory, and learning theory: an optimization method that learns from experience as more aspects of the problem are observed.

• Convex Optimization (Stephen Boyd, et al.)

  On recognizing convex optimization problems and then finding the most appropriate technique for solving them. It contains many worked examples in fields such as engineering, computer science, mathematics, statistics, finance, and economics.

• The Design of Approximation Algorithms (D. P. Williamson)

  This book shows how to design approximation algorithms: efficient algorithms that find provably near-optimal solutions. is organized around central algorithmic techniques for designing approximation algorithms, including greedy and local search algorithms, dynamic programming, linear and semidefinite programming, and randomization.

• Engineering Design Optimization (Joaquim R. Martins, et al)

  The philosophy of this book is to provide a detailed enough explanation and analysis of optimization methods so that readers can implement a basic working version. Practical tips are included for common issues encountered in practical engineering design optimization.