Advances in Bio-inspired Computing for Combinatorial Optimization Problems

Camelia-Mihaela Pintea

ISBN 10: 3642401783 / ISBN 13: 9783642401787

Editore: Springer Berlin Heidelberg Aug 2013, 2013

Riguardo questo articolo

This item is printed on demand - it takes 3-4 days longer - Neuware -'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. 200 pp. Englisch. Codice articolo 9783642401787

Dati bibliografici

Titolo: Advances in Bio-inspired Computing for ...

Casa editrice: Springer Berlin Heidelberg Aug 2013

Data di pubblicazione: 2013

Legatura: Buch

Condizione: Neu

Descrizione articolo

Riassunto:

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

Contenuti:

Part I Biological Computing and Optimization.- Part II Ant Algorithms.- Part III Bio-inspired Multi-Agent Systems.- Part IV Applications with Bio-inspired Algorithms.- Part V Conclusions and Remarks.