Local search-based heuristics for the multiobjective multidimensional knapsack problem
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 heu...
Main Authors: | , |
---|---|
Format: | Article |
Language: | English |
Published: |
Associação Brasileira de Engenharia de Produção (ABEPRO)
2012-01-01
|
Series: | Production |
Subjects: | |
Online Access: | http://www.scielo.br/scielo.php?script=sci_arttext&pid=S0103-65132012005000081 |