Using bound sets in multiobjective optimization: Application to the biobjective binary knapsack problem - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2010

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

Charles Delort
  • Fonction : Auteur
  • PersonId : 977652
Olivier Spanjaard

Résumé

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.
Fichier principal
Vignette du fichier
pub_1293_1_SEA10.pdf (232.35 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01291385 , version 1 (30-06-2017)

Identifiants

Citer

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⟩
183 Consultations
250 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More