• Title: Essentials of Metaheuristics
• Author(s): Sean Luke
• Publisher: lulu.com; 2nd Edition (June 21, 2013); eBook (Creative Commons Licensed, Version 2.2)
• License(s): CC BY-ND 3.0 US
• Paperback: 242 pages
• eBook: PDF (263 pages)
• Language: English
• ISBN-10: 1300549629
• ISBN-13: 978-1300549628
• Share This:  

Book Description

Interested in the Genetic Algorithm? Simulated Annealing? Ant Colony Optimization? This book covers these and other metaheuristics algorithms, and is intended for undergraduate students, programmers, and non-experts. It also covers a wide range of algorithms, representations, selection and modification operators, and related topics, and includes 71 figures and 135 algorithms great and small.

Metaheuristics is a common but unfortunate name for any stochastic optimization algorithm intended to be the last resort before giving up and using random or brute-force search. Such algorithms are used for problems where you don't know how to find a good solution, but if shown a candidate solution, you can give it a grade. The algorithmic family includes genetic algorithms, hill-climbing, simulated annealing, ant colony optimization, particle swarm optimization, and so on.

This book is an open set of lecture notes on metaheuristics algorithms, intended for undergraduate students, practitioners, programmers, and other non-experts. It was developed as a series of lecture notes for an undergraduate course I taught at GMU. The chapters are designed to be printable separately if necessary. As it's lecture notes, the topics are short and light on examples and theory. It's best when complementing other texts. With time, I might remedy this.

Algorithms include: Gradient Ascent techniques, Hill-Climbing variants, Simulated Annealing, Tabu Search variants, Iterated Local Search, Evolution Strategies, the Genetic Algorithm, the Steady-State Genetic Algorithm, Differential Evolution, Particle Swarm Optimization, Genetic Programming variants, One- and Two-Population Competitive Coevolution, N-Population Cooperative Coevolution, Implicit Fitness Sharing, Deterministic Crowding, Nsga-Ii, Spea2, Grasp, Ant Colony Optimization variants, Guided Local Search, Lem, Pbil, Umda, cGa, Boa, Samuel, Zcs, Xcs, and Xcsf.

• N/A

• Amazon

• Artificial Intelligence, Machine Learning, and Logic Programming
• Operations Research (OR) and Optimization
• Algorithms and Data Structures
• Control Theory, Robust, and Automation
• Computer and Video Game Development and Programming

• Essentials of Metaheuristics (Sean Luke)
• Direct PDF
• The Mirror Site (1) - PDF

• A History of Metaheuristics (Kenneth Sorensen, et al.)

• A Field Guide to Genetic Programming (Riccardo Poli, et al)

  This book provides a complete and coherent review of the theory of Genetic Programming (GP), written by three of the most active scientists in GP. GP solves problems without the user having to know or specify the form or structure of solutions in advance.

• Genetic Algorithms in Applications (Rustem Popa)

  This well-organized book takes the reader through the new and rapidly expanding field of genetic algorithms step by step, from a discussion of numerical optimization, to a survey of current extensions to genetic algorithms and applications.

• 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.

• Evolutionary Algorithms (Eisuke Kita)

  The goal of this book is to provide effective evolutionary algorithms that have been used as an experimental framework within biological evolution and natural selection in the field of artificial life.

• 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.