Multi-objective Flower Algorithm for Optimization
This is an incremental improvement for engineering optimization problems.
The authors tackled multi-objective optimization problems in engineering by extending the flower pollination algorithm, showing it can accurately find Pareto fronts for test functions and quickly converge on a bi-objective disc brake design problem.
Flower pollination algorithm is a new nature-inspired algorithm, based on the characteristics of flowering plants. In this paper, we extend this flower algorithm to solve multi-objective optimization problems in engineering. By using the weighted sum method with random weights, we show that the proposed multi-objective flower algorithm can accurately find the Pareto fronts for a set of test functions. We then solve a bi-objective disc brake design problem, which indeed converges quickly.