Assessment of modern metaheuristic algorithms - HS, ABC and FA - in shape and size optimisation of structures with different types of constraints
by Letícia Fleck Fadel Miguel; Leandro Fleck Fadel Miguel
International Journal of Metaheuristics (IJMHEUR), Vol. 2, No. 3, 2013

Abstract: Shape and size optimisation of structures combining different types of constraints normally causes difficult sensitivity analysis. Thus, choosing the appropriate method to solve this kind of problem is of paramount importance. There are many metaheuristic methods and new ones continue being developed. An assessment of these algorithms may help to choose one. In this paper, three recent metaheuristic algorithms, harmony search (HS), artificial bee colony (ABC) and firefly algorithm (FA), are evaluated. The effectiveness of these methods are demonstrated by solving seven benchmark structural optimisation problems. Additionally, the optimisation of a realistic transmission tower is performed, which may serve as benchmark to validate new optimisation methods. A parametric study was also carried out and the statistical results were presented. The results showed that the three algorithms reached, in a relatively low computational time, better results than most literature, emphasising their excellent ability. Comparisons among the algorithms could be established.

Online publication date: Sat, 05-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 Metaheuristics (IJMHEUR):
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