Improvement of genetic algorithms with decomposition procedure for large-scale multiobjective multidimensional 0-1 knapsak problems incorporating fuzzy goals

摘要

For a 0-1 knapsak problem, if it is small in size, a strict optimal solution can be obtained by the branch-and- bound method or dynamic programming. As the size of the problem grows larger, however, it rapidly becomes harder to find a strict optimal solution to it based on these methods because of the exponential increase of computational load. As a result, various approximate algorithms have been Proposed to obtain approximate optimal solutions.