Theoretical Analysis of Nature-Inspired Optimization Algorithms

Many problems in optimization and computational intelligence are very challenging to solve, and some of these problems can be NP-hard, which means that there are often no efficient algorithms to tackle such hard problems. In many cases, nature-inspired metaheuristic algorithms can be a good alternative and such algorithms include genetic algorithms (GA), particle swarm optimization (PSO), ant colony optimization (ACO), cuckoo search and many others. Over the last two decades, nature-inspired optimization algorithms have become increasingly popular in solving large-scale, nonlinear, global optimization with many real-world applications. They also become an important of part of optimization and computational intelligence. This tutorial will provide a critical analysis of recent algorithms using mathematical theories such as Markov chains, dynamic systems, random walks and self-organization systems. This will provide some insight into these algorithms concerning their convergence rates and stability.

See full details here


  • Home
  • Important Dates
  • Venue
  • Call For Papers
  • Organisation committee
  • EANN Past and Future
  • Contact Us