Using bound sets in multiobjective optimization: Application to the biobjective binary knapsack problem

Charles Delort 1 Olivier Spanjaard 1
1 DECISION
LIP6 - Laboratoire d'Informatique de Paris 6
Abstract : This paper is devoted to a study of the impact of using bound sets in biobjective optimization. This notion, introduced by Villareal and Karwan [19], has been independently revisited by Ehrgott and Gandibleux [9], as well as by Sourd and Spanjaard [17]. The idea behind it is very general, and can therefore be adapted to a wide range of biobjective combinatorial problem. We focus here on the biobjective binary knapsack problem. We show that using bound sets in a two-phases approach [18] based on biobjective dynamic programming yields numerical results that outperform previous ones, both in execution times and memory requirements.
Document type :
Conference papers
Liste complète des métadonnées

Cited literature [20 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01291385
Contributor : Lip6 Publications <>
Submitted on : Friday, June 30, 2017 - 6:44:58 PM
Last modification on : Thursday, March 21, 2019 - 1:10:00 PM
Document(s) archivé(s) le : Monday, January 22, 2018 - 10:56:21 PM

File

pub_1293_1_SEA10.pdf
Files produced by the author(s)

Identifiers

Citation

Charles Delort, Olivier Spanjaard. Using bound sets in multiobjective optimization: Application to the biobjective binary knapsack problem. 9th International Symposium on Experimental Algorithms (SEA 2010), May 2010, Naples, Italy. pp.253-265, ⟨10.1007/978-3-642-13193-6_22⟩. ⟨hal-01291385⟩

Share

Metrics

Record views

193

Files downloads

90