Local search-based heuristics for the multiobjective multidimensional knapsack problem

10Citations
Citations of this article
23Readers
Mendeley users who have this article in their library.

Abstract

In real optimization problems it is generally desirable to optimize more than one performance criterion (or objective) at the same time. The goal of the multiobjective combinatorial optimization (MOCO) is to optimize simultaneously r > 1 objectives. As in the single-objective case, the use of heuristic/metaheuristic techniques seems to be the most promising approach to MOCO problems because of their efficiency, generality and relative simplicity of implementation. In this work, we develop algorithms based on Greedy Randomized Adaptive Search Procedure (GRASP) and Iterated Local Search (ILS) metaheuristics for the multiobjective knapsack problem. Computational experiments on benchmark instances show that the proposed algorithms are very robust and outperform other heuristics in terms of solution quality and running times.

Cite

CITATION STYLE

APA

Vianna, D. S., & de Fátima Dianin Vianna, M. (2013). Local search-based heuristics for the multiobjective multidimensional knapsack problem. Producao, 23(3), 478–487. https://doi.org/10.1590/S0103-65132012005000081

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free