• Title: Ant Colony Optimization - Techniques and Applications
• Author(s) Helio J.C. Barbosa
• Publisher: IN-TECH (February 20, 2013); eBook (Creative Commons Licensed)
• License(s): Attribution 3.0 Unported (CC BY 3.0)
• Hardcover: 203 pages
• eBook: PDF Files, and an zipped PDF, 6.77 MB
• Language: English
• ISBN-10: N/A
• ISBN-13: 978-953-51-1001-9
• Share This:  

Book Description

Ant Colony Optimization (ACO) is the best example of how studies aimed at understanding and modeling the behavior of ants and other social insects can provide inspiration for the development of computational algorithms for the solution of difficult mathematical problems.

Introduced by Marco Dorigo in his PhD thesis (1992) and initially applied to the travelling salesman problem, the ACO field has experienced a tremendous growth, standing today as an important nature-inspired stochastic metaheuristic for hard optimization problems.

This book presents state-of-the-art ACO methods and is divided into two parts: (I) Techniques, which includes parallel implementations, and (II) Applications, where recent contributions of ACO to diverse fields, such as traffic congestion and control, structural optimization, manufacturing, and genomics are presented.

• N/A

• Amazon

• Optimization, and Approximation
• Algorithms and Data Structures
• Computational and Algorithmic Mathematics
• Computational Complexity

• Ant Colony Optimization - Techniques and Applications (Helio Barbosa)
• PDF Format
• The Ant Colony Optimization Meta-Heuristic (Marco Dorigo, et al.)

• Essentials of Metaheuristics (Sean Luke)

  This book is an open set of lecture notes on metaheuristics algorithms. The algorithmic family includes genetic algorithms, hill-climbing, simulated annealing, ant colony optimization, particle swarm optimization, and so on.

• Traveling Salesman Problem, Theory and Applications

  This book is a collection of current research in the application of evolutionary algorithms and other optimal algorithms to solving the Travelling Salesman Problem (TSP). Most importantly, it presents both theoretical as well as practical applications of TSP,

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

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

• Tabu Search (Wassim Jaziri)

  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.