A case study of memetic algorithms for constraint optimization


There is a variety of knapsack problems in the literature. Multidimensional 0-1 Knapsack Problem (MKP) is an NP-hard combinatorial optimization problem having many application areas. Many approaches have been proposed for solving this problem. In this paper, an empirical investigation of memetic algorithms (MAs) that hybridize genetic algorithms (GAs) with… (More)
DOI: 10.1007/s00500-008-0354-4


10 Figures and Tables

Slides referencing similar topics