Design Optimization Average-Based Algorithm

13 Pages Posted: 22 Nov 2019

Date Written: October 10, 2017


This article introduces a metaheuristic algorithm to solve engineering design optimization problems. The algorithm is based on the concept of diversity and independence that is aggregated in the average design of a population of designs containing information dispersed through a variety of points, and on the concept of intensification represented by the best design. The algorithm is population-based, where the population individual designs are randomly generated. The population can be normally or uniformly generated. The algorithm may start either with points randomly generated or with a designer preferred trial guess. The algorithm is validated using standard classical unconstrained and constrained engineering optimum design test problems reported in the literature. The results presented indicate that the proposed algorithm is a very simple alternative to solve this kind of problems. They compare well with the analytical solutions and/or the best results achieved so far. Two constrained problem analytical solutions not found in the literature are presented in annex.

Keywords: heuristic, randomness, population-based, optimization

JEL Classification: G17

Suggested Citation

Barradas Cardoso, Joao and Barreiros, Artur, Design Optimization Average-Based Algorithm (October 10, 2017). Available at SSRN: or

Joao Barradas Cardoso

University of Lisbon

R. Branca Edmée Marques
Dept. Plant Biology
Lisboa, 1600-276

Artur Barreiros (Contact Author)

University of Lisbon ( email )

R. Branca Edmée Marques
Dept. Plant Biology
Lisboa, 1600-276

Do you have a job opening that you would like to promote on SSRN?

Paper statistics

Abstract Views
PlumX Metrics