A two-stage hybrid method for the multi-scenarios max-min knapsack problem - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue International Journal of Intelligent Engineering Informatics Année : 2018

A two-stage hybrid method for the multi-scenarios max-min knapsack problem

, (1)
1

Résumé

In this paper, we propose a two-stage hybrid method in order to solve approximately the multi-scenarios max-min knapsack problem. The proposed method is based upon three complementary stages: 1) the building stage; 2) the combination stage; 3) the two-stage rebuild stage. First, the building stage serves to provide a starting feasible solution by using a greedy procedure; each item is randomly chosen for reaching a starting population of solutions. Second, the combination stage tries to provide each new solution by combining subsets of (starting) solutions. Third, the rebuild stage tries to make intensification in order to improve the solutions at hand. The proposed method is evaluated on a set of benchmark instances taken from the literature. The obtained results are compared to those reached by the best algorithms available in the literature. The results show that the proposed method provides better solutions than those already published.
Fichier non déposé

Dates et versions

hal-03617896 , version 1 (23-03-2022)

Identifiants

Citer

Thekra Aldouri, Mhand Hifi. A two-stage hybrid method for the multi-scenarios max-min knapsack problem. International Journal of Intelligent Engineering Informatics, 2018, 6 (1-2, SI), pp.99-114. ⟨10.1504/IJIEI.2018.091011⟩. ⟨hal-03617896⟩

Collections

U-PICARDIE EPROAD
17 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook Twitter LinkedIn More