Abstract
In this paper, we present a practical case of the multi objective knapsack problem which concerns the elaboration of the optimal action plan in the social and medico-social sector. We provide a description and a formal model of the problem as well as some preliminary computational results. We perform an empirical analysis of the behavior of three metaheuristic approaches: a fast and elitist multi objective genetic algorithm (NSGA-II), a Pareto Local Search (PLS) algorithm and an Indicator-Based Multi-Objective Local Search (IBMOLS).
Cite
CITATION STYLE
Chabane, B., Basseur, M., & Hao, J. K. (2015). A practical case of the multiobjective knapsack problem: Design, modelling, tests and analysis. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8994, pp. 249–255). Springer Verlag. https://doi.org/10.1007/978-3-319-19084-6_23
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
