A Memetic Algorithm Based on Probability Learning for Solving the Multidimensional Knapsack Problem

The multidimensional knapsack problem (MKP) is a well-known combinatorial optimization problem with many real-life applications. In this article, a memetic algorithm based on probability learning (MA/PL) is proposed to solve MKP. The main highlights of this article are two-fold: 1) problem-dependent heuristics for MKP and 2) a novel framework of MA/PL. For the problem-dependent heuristics, we firs...