Features
- Cover Type: Paperback with 410 pages
- Published by: Wiley-IEEE Computer Society Pr
- Edition: 1st Edition January 27, 2000
- Written in: English
- ISBN 10 Number: 0769501001
- ISBN 13 Number: 978-0769501000
-
Book Dimensions:
9 x 6.1 x 1 inches
- Weighs: 1.2 pounds
Product Description
Iterative Computer Algorithms with Applications in Engineering describes in-depth the five main iterative algorithms for solving hard combinatorial optimization problems: Simulated Annealing, Genetic Algorithms, Tabu Search, Simulated Evolution, and Stochastic Evolution. The authors present various iterative techniques and illustrate how they can be applied to solve several NP-hard problems.
For each algorithm, the authors present the procedures of the algorithm, parameter selection criteria, convergence property analysis, and parallelization. There are also several real-world examples that illustrate various aspects of the algorithms. The book includes an introduction to fuzzy logic and its application in the formulation of multi-objective optimization problems, a discussion on hybrid techniques that combine features of heuristics, a survey of recent research work, and examples that illustrate required mathematical concepts.
The unique features of this book are: An integrated and up-to-date description of iterative non-deterministic algorithms; Detailed descriptions of Simulated Evolution and Stochastic Evolution; A level of treatment suitable for first year graduate student and practicing engineers; Parallelization aspects and particular parallel implementations; A brief survey of recent research work; Graded exercises and an annotated bibliography in each chapter
Book Info
Describes, in-depth the five main iterative algorithms for solving hard combinatorial optimization problems: Simulated Annealing, Genetic Algorithms, Tabu Search, Simulated Evolution, and Stochastic Evolution. Softcover. DLC: Combinatorial optimization--Data processing.
Reader ReviewsThe book covers various optimization techniques in Engineering but not all.However,the analysis of each algorithm is great with flowcharts and mathematical equations accompanying each subject. There are many books for Iterative computer algorithms but this one combines all the necessary information to help you develop and test your own algorithm.