Rezoug, AbdellahBoughaci, DalilaBadr-El-Den, Mohamed2016-06-092016-06-09201517th Portuguese Conference on Artificial Intelligence (EPIA) Location: Univ Coimbra, Coimbra, PORTUGAL Date: SEP 08-11, 2015978-3-319-23485-4; 978-3-319-23484-70302-9743https://dspace.univ-boumerdes.dz/handle/123456789/2924In this paper, we propose a memetic algorithm for the Multidimensional Knapsack Problem (MKP). First, we propose to combine a genetic algorithm with a stochastic local search (GA-SLS), then with a simulated annealing (GA-SA). The two proposed versions of our approach (GA-SLS and GA-SA) are implemented and evaluated on benchmarks to measure their performance. The experiments show that both GA-SLS and GA-SA are able to find competitive results compared to other well-known hybrid GA based approaches.enMultidimensional knapsack problemStochastic local searchGenetic algorithmSimulated annealingLocal searchMemetic algorithmOPTIMIZATIONMemetic Algorithm for Solving the 0-1 Multidimensional Knapsack ProblemDataset