Memetic Algorithm for Solving the 0-1 Multidimensional Knapsack Problem
| dc.contributor.author | Rezoug, Abdellah | |
| dc.contributor.author | Boughaci, Dalila | |
| dc.contributor.author | Badr-El-Den, Mohamed | |
| dc.date.accessioned | 2016-06-09T10:19:09Z | |
| dc.date.available | 2016-06-09T10:19:09Z | |
| dc.date.issued | 2015 | |
| dc.description.abstract | In 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. | en_US |
| dc.identifier.citation | 17th Portuguese Conference on Artificial Intelligence (EPIA) Location: Univ Coimbra, Coimbra, PORTUGAL Date: SEP 08-11, 2015 | en_US |
| dc.identifier.isbn | 978-3-319-23485-4; 978-3-319-23484-7 | |
| dc.identifier.issn | 0302-9743 | |
| dc.identifier.uri | https://dspace.univ-boumerdes.dz/handle/123456789/2924 | |
| dc.language.iso | en | en_US |
| dc.publisher | SPRINGER | en_US |
| dc.relation.ispartofseries | PROGRESS IN ARTIFICIAL INTELLIGENCE , Lecture Notes in Artificial Intelligence;Vol. 9273 pp. 298-304 | |
| dc.subject | Multidimensional knapsack problem | en_US |
| dc.subject | Stochastic local search | en_US |
| dc.subject | Genetic algorithm | en_US |
| dc.subject | Simulated annealing | en_US |
| dc.subject | Local search | en_US |
| dc.subject | Memetic algorithm | en_US |
| dc.subject | OPTIMIZATION | en_US |
| dc.title | Memetic Algorithm for Solving the 0-1 Multidimensional Knapsack Problem | en_US |
| dc.type | Dataset | en_US |