On beam search for multicriteria combinatorial optimization problems

Authors:
Aníbal Ponte;Luís Paquete;José R. Figueira
Affiliations:
ESTSETÚBAL, Polytechnic Institute of Setúbal, Portugal,CISUC, Department of Informatics Engineering, University of Coimbra, Portugal;CISUC, Department of Informatics Engineering, University of Coimbra, Portugal;CEG-IST, Instituto Superior Técnico, Portugal,LORIA Laboratory, Nancy, France
Venue:
CPAIOR'12 Proceedings of the 9th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Year:
2012

Citing 12
Cited 1

Knapsack problems: algorithms and computer implementations

Knapsack problems: algorithms and computer implementations
On Finding the Maxima of a Set of Vectors

Journal of the ACM (JACM)
Introduction to algorithms

Introduction to algorithms
Tabu Search Based Procedure for Solving the 0-1 MultiObjective Knapsack Problem: The Two Objectives Case

Journal of Heuristics
Two-phases Method and Branch and Bound Procedures to Solve the Bi–objective Knapsack Problem

Journal of Global Optimization
On the approximability of trade-offs and optimal access of Web sources

FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Solving bicriteria 0-1 knapsack problems using a labeling algorithm

Computers and Operations Research
Approximating Multiobjective Knapsack Problems

Management Science
Bound sets for biobjective combinatorial optimization problems

Computers and Operations Research
Solving efficiently the 0-1 multi-objective knapsack problem

Computers and Operations Research
In-Place Algorithms for Computing (Layers of) Maxima

Algorithmica - Including a Special Section on Genetic and Evolutionary Computation; Guest Editors: Benjamin Doerr, Frank Neumann and Ingo Wegener
Performance assessment of multiobjective optimizers: an analysis and review

IEEE Transactions on Evolutionary Computation

A note on the ε-indicator subset selection

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this article, the beam search approach is extended to multicriteria combinatorial optimization, with particular emphasis on its application to bicriteria {0,1} knapsack problems. The beam search uses several definitions of upper bounds of knapsack solutions as well as a new selection procedure based on ε -indicator that allows to discard uninteresting solutions. An in-depth experimental analysis on a wide benchmark set of instances suggests that this approach can achieve very good solution quality in a small fraction of time needed to solve the problem to optimality by state-of-the-art algorithms.