A NEW FIREST OPTIMIZATION ALGORITHM FOR THE MULTIDIMENSIONAL KNAPSACK PROBLEM

In this paper a newly proposed metaheuristic algorithm named Forest Optimization Algorithm (FOA) is used to find the best answer for the multidimensional knapsack problem (MKP) using low number of iterations and low computational effort. FOA searches for solutions in continuous spaces but MKP is a binary problem. This algorithm has two searching methods including local seeding of trees and global seeding of them. Numerical testing results using benchmark instances are provided and compared with previously powerful low-iteration based algorithms like GA, CRGA and SRGA. The results show that our implementation is more effective than other algorithms in all of the benchmark functions.

کلیدواژه ها:

Multidimensional knapsack problem ، Forest optimization algorithm ، Random key ، low- iteration