Metaheuristic algorithms for inverse problems
by Xin-She Yang
International Journal of Innovative Computing and Applications (IJICA), Vol. 5, No. 2, 2013

Abstract: Many inverse problems in engineering can be considered as constrained optimisation, as the aim of inversion is to find the best parameter estimates so as to minimise the differences between the predicted results and the observations while satisfying all known constraints. Such optimisation problems can thus be solved by efficient optimisation techniques. As the number of degrees of freedom is usually very large, metaheuristic algorithms such as Cuckoo Search are particularly suitable for inverse problems, because metaheuristics are very efficient for solving non-linear global optimisation problems. In this paper, we will take a unified approach to inversion and optimisation and introduce a few nature-inspired metaheuristics, including genetic algorithms, differential evolution, firefly algorithm, Cuckoo Search, particle swarm optimisation and their applications in solving inverse problems.

Online publication date: Thu, 31-Jul-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Innovative Computing and Applications (IJICA):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com