Backtracking search algorithm for multi-objective design optimisation
by Ahmed Tchvagha Zeine; Abdelkhalak El Hami; Rachid Ellaia; Emmanuel Pagnacco
International Journal of Mathematical Modelling and Numerical Optimisation (IJMMNO), Vol. 8, No. 2, 2017

Abstract: In engineering, design problems are generally multi-objective with complex non-linear constraints. Therefore, the computing effort can often rise significantly with the number of objectives and constraints' evaluation. The metaheuristics algorithms are nowadays considered as powerful algorithms to deal with multi-objective optimisation problems. In this article, we develop a new backtracking search algorithm for multi-objective optimisation, called BSAMO, to solve this kind of problems. It is evaluated here through a set of benchmarks problems and two structural design applications. BSAMO's numerical results are compared with those of NSGA-II by two performance measures. They show that the proposed algorithm is able to produce a better convergence towards the Pareto front and to preserve the diversity of the solutions.

Online publication date: Wed, 13-Sep-2017

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 Mathematical Modelling and Numerical Optimisation (IJMMNO):
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