<p><P>Combinatorial optimisation is a ubiquitous discipline whose usefulness spans vast applications domains. The intrinsic complexity of most combinatorial optimisation problems makes classical methods unaffordable in many cases. To acquire practical solutions to these problems requires the use of
Advances in Bio-inspired Computing for Combinatorial Optimization Problems
โ Scribed by Camelia-Mihaela Pintea (auth.)
- Publisher
- Springer-Verlag Berlin Heidelberg
- Year
- 2014
- Tongue
- English
- Leaves
- 188
- Series
- Intelligent Systems Reference Library 57
- Edition
- 1
- Category
- Library
No coin nor oath required. For personal study only.
โฆ Synopsis
"Advances in Bio-inspired Combinatorial Optimization Problems" illustrates several recent bio-inspired efficient algorithms for solving NP-hard problems.
Theoretical bio-inspired concepts and models, in particular for agents, ants and virtual robots are described. Large-scale optimization problems, for example: the Generalized Traveling Salesman Problem and the Railway Traveling Salesman Problem, are solved and their results are discussed.
Some of the main concepts and models described in this book are: inner rule to guide ant search - a recent model in ant optimization, heterogeneous sensitive ants; virtual sensitive robots; ant-based techniques for static and dynamic routing problems; stigmergic collaborative agents and learning sensitive agents.
This monograph is useful for researchers, students and all people interested in the recent natural computing frameworks. The reader is presumed to have knowledge of combinatorial optimization, graph theory, algorithms and programming. The book should furthermore allow readers to acquire ideas, concepts and models to use and develop new software for solving complex real-life problems.
โฆ Table of Contents
Front Matter....Pages 1-8
Front Matter....Pages 1-1
Bio-inspired Computing....Pages 3-19
Combinatorial Optimization....Pages 21-28
Front Matter....Pages 29-29
Introduction....Pages 31-55
Local Guided Ant Search....Pages 57-80
Sensitivity: A Metaheuristic Model....Pages 81-104
Front Matter....Pages 105-105
Stigmergic Collaborative Agents....Pages 107-122
Front Matter....Pages 123-123
Ant-Based Algorithms for Dynamic Problems....Pages 125-141
Agent-Based Algorithms for Diverse Problems....Pages 143-161
Front Matter....Pages 163-163
Conclusions and the Results Impact....Pages 165-170
Back Matter....Pages 171-188
โฆ Subjects
Computational Intelligence; Artificial Intelligence (incl. Robotics); Operation Research/Decision Theory
๐ SIMILAR VOLUMES
<p><span>Combinatorial optimisation is a ubiquitous discipline whose usefulness spans vast applications domains. The intrinsic complexity of most combinatorial optimisation problems makes classical methods unaffordable in many cases. To acquire practical solutions to these problems requires the use
<p><span>This book provides a literature review of techniques used to pass from continuous to combinatorial space, before discussing a detailed example with individual steps of how cuckoo search (CS) can be adapted to solve combinatorial optimization problems. It demonstrates the application of CS t
<p><span>A new era of complexity science is emerging, in which nature- and bio-inspired principles are being applied to provide solutions. At the same time, the complexity of systems is increasing due to such models like the Internet of Things (IoT) and fog computing. Will complexity science, applyi
<p><span>This book presents novel and original metaheuristics developed to solve the cost-balanced traveling salesman problem. This problem was taken into account for the Metaheuristics Competition proposed in MESS 2018, Metaheuristics Summer School, and the top 4 methodologies ranked are included i