A strawberry optimization algorithm for the multi-objective knapsack problem (preliminary version)

Yamato Mizobe, Akihiro Fujiwara


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 consider multi-objective knapsack problem, which is one of well-known multi-objective optimization problems, and propose an optimization algorithm based on a strawberry algorithm(SBA). The experimental results show that the proposed algorithm obtains a better set of Pareto solutions than the existing algorithm.


multi-objective optimization; knapsack problem; strawberry algorithm

Full Text:



  • There are currently no refbacks.