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.