Algorithmic improvements on dynamic programming for the bi-objective {0,1} knapsack problem - LAMSADE (Laboratoire d'Analyse et de Modélisation des Systèmes pour l'Aide à la Décision) Accéder directement au contenu
Article Dans Une Revue Computational Optimization and Applications Année : 2013

Algorithmic improvements on dynamic programming for the bi-objective {0,1} knapsack problem

Résumé

This paper presents several methodological and algorithmic improvements over a state-of-the-art dynamic programming algorithm for solving the bi-objective {0,1} knapsack problem. The variants proposed make use of new definitions of lower and upper bounds, which allow a large number of states to be discarded. The computation of these bounds are based on the application of dichotomic search, definition of new bound sets, and bi-objective simplex algorithms to solve the relaxed problem. Although these new techniques are not of a common application for dynamic programming, we show that the best variants tested in this work can lead to an average improvement of 10 to 30 % in CPU-time and significant less memory usage than the original approach in a wide benchmark set of instances, even for the most difficult ones in the literature.
Fichier principal
Vignette du fichier
cisuc2011.pdf (305.19 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-01505666 , version 1 (11-04-2017)

Identifiants

Citer

José Figueira, Luis Paquete, Marco Simoes, Daniel Vanderpooten. Algorithmic improvements on dynamic programming for the bi-objective {0,1} knapsack problem. Computational Optimization and Applications, 2013, 56 (1), ⟨10.1007/s10589-013-9551-x⟩. ⟨hal-01505666⟩
56 Consultations
533 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More