Flower pollination optimization for the multi-objective knapsack problem

Abstract

A multi-objective optimization problem involves a number of objective functions to be maximized or minimized, and no single solution exists for the problem because there is no solution that simultaneously satisfies all of the objective functions. Therefore, a set of Pareto-optimal solutions, which are non-dominated solutions for the problem, is defined for the multi-objective optimization problem.

In the present paper, we propose an optimization algorithm based on flower pollination algorithm (FPA) for the multi- objective knapsack problem. The experimental results show that the proposed algorithm obtains a better set of Pareto solutions than the existing algorithm.