pith. sign in

arxiv: 1211.6658 · v1 · pith:YKRTPNDGnew · submitted 2012-11-28 · 🧮 math.OC · cs.NE

Nature-Inspired Mateheuristic Algorithms: Success and New Challenges

classification 🧮 math.OC cs.NE
keywords algorithmstheoreticalthereanalysisframeworkimportantmathematicalmetaheuristics
0
0 comments X
read the original abstract

Despite the increasing popularity of metaheuristics, many crucially important questions remain unanswered. There are two important issues: theoretical framework and the gap between theory and applications. At the moment, the practice of metaheuristics is like heuristic itself, to some extent, by trial and error. Mathematical analysis lags far behind, apart from a few, limited, studies on convergence analysis and stability, there is no theoretical framework for analyzing metaheuristic algorithms. I believe mathematical and statistical methods using Markov chains and dynamical systems can be very useful in the future work. There is no doubt that any theoretical progress will provide potentially huge insightful into meteheuristic algorithms.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.