Backtracking search algorithm for multi-objective design optimisation (Q6108490)

Summary: 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.