The multiobjective multidimensional knapsack problem: a survey and a new approach |
| |
Authors: | Thibaut Lust Jacques Teghem |
| |
Affiliation: | Laboratory of Mathematics and Operational Research, Faculté Polytechnique de Mons, University of Mons, , Belgium |
| |
Abstract: | The knapsack problem (KP) and its multidimensional version (MKP) are basic problems in combinatorial optimization. In this paper, we consider their multiobjective extension (MOKP and MOMKP), for which the aim is to obtain or approximate the set of efficient solutions. In the first step, we classify and briefly describe the existing works that are essentially based on the use of metaheuristics. In the second step, we propose the adaptation of the two‐phase Pareto local search (2PPLS) to the resolution of the MOMKP. With this aim, we use a very large scale neighborhood in the second phase of the method, that is the PLS. We compare our results with state‐of‐the‐art results and show that the results we obtained were never reached before by heuristics for biobjective instances. Finally, we consider the extension to three‐objective instances. |
| |
Keywords: | multiple objective programming knapsack problems metaheuristics local search |
|
|