“…The multidimensional knapsack, as many other combinatorial optimization problems, was intensively investigated within metaheuristics at the end of the 1980s to the beginning of the 1990s (Fréville, ). These last decades, in addition to the classically used evolutionary algorithms (GA, NSGA2, and SPEA, see Lust and Teghem, ), several metaheuristics are used to solve the multidimensional knapsack problem: human learning optimization (Wang et al., ), firefly (Baykasoğlu and Ozsoydan, ), scatter search (Gomes da Silva, ), ant colony optimization (Kong et al., ), fruit fly optimization (Wang et al., ), PSO (Kong and Tian, ; Hembecker et al., ; Labed et al., ; Bansal and Deep, ; Bonyadi and Michalewicz, ; Chih, ), etc. In addition, based on the “no free lunch theorem” (Wolpert and Macready, ), stating that any algorithm is not better than all the others for any problem of optimization, the PSO that is easy to tune has been used as search algorithm.…”