Abstract
The Multiple Knapsack Assignment Problem (MKAP) is an extension of the Multiple Knapsack Problem, a well-known NP-hard combinatorial optimization problem. The MKAP is a hard problem even for small-sized instances. In this paper, we propose an approximate approach for the MKAP based on a biased random key genetic algorithm. Our solution approach exhibits competitive performance when compared to the best approximate approach reported in the literature.
Cite
CITATION STYLE
Lalla-Ruiz, E., & Voß, S. (2015). A biased random-key genetic algorithm for the multiple knapsack assignment problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8994, pp. 218–222). Springer Verlag. https://doi.org/10.1007/978-3-319-19084-6_19
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
