The multiobjective multidimensional knapsack problem: a survey and a new approach

Details The multiobjective multidimensional knapsack problem: a survey and a new approach The multiobjective multidimensional knapsack problem: a survey and a new approach

2010-07-23

arxiv.org/abs/1007.4063v1

Computer Science

Discrete Mathematics

Scientific paper

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 to approximate the set of efficient solutions. In a first step, we classify and describe briefly the existing works, that are essentially based on the use of metaheuristics. In a 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 (VLSN) in the second phase of the method, that is the Pareto local search. We compare our results to state-of-the-art results and we show that we obtain results never reached before by heuristics, for the biobjective instances. Finally we consider the extension to three-objective instances.

Affiliated with

Also associated with

No associations

Rating

The multiobjective multidimensional knapsack problem: a survey and a new approach does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The multiobjective multidimensional knapsack problem: a survey and a new approach, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The multiobjective multidimensional knapsack problem: a survey and a new approach will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-138613