Hybrid Ant Colony Optimization Technique:TSP a case study

This hallmark text presents both theoretical and practical foundations of Ant Colony Optimization (ACO) along with its applications. The research orientation in the book provides possible modifications and enhancements of conventional ACO and the superiority of Hybrid approaches. An efficient Hybrid Technique "Nested Hybrid ACO" deals with a complex and popular combinatorial optimization problem, Travelling Salesman Problem(TSP). The comparison with state-of-the-art algorithms for solving TSP proves the superiority of the hybrid approaches, which is very much useful to the research community. The strength of this book is easy explanation, exhaustive literature survey,supported simulation results with analysis,rich comparative study and future research direction.

Autorentext

The author received B.E(Comp. Tech.)from Nagpur University, M.Tech.(Comp. Sc.) and Ph.D(Engineering) from the B.I.T Mesra, Ranchi,India where he is currently working as Asst. Prof. in Dept. of CSE. His research interests include soft computing, grid computing and artificial intelligence. He is author of number of research papers in Computer Science