A hybrid population-based algorithm for the bi-objective quadratic multiple knapsack problem - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Expert Systems with Applications Année : 2022

A hybrid population-based algorithm for the bi-objective quadratic multiple knapsack problem

(1) , (2) , (3)
1
2
3

Résumé

In this paper, the bi-objective quadratic multiple knapsack problem is tackled with a hybrid population-based method. The proposed method starts by computing two reference solutions, where a specialized powerful mono-objective algorithm is used. From both reference solutions, a starting population is built by using a series of perturbations around the solutions. Next, the so-called non-sorting genetic process is combined with a new drop/rebuild operator for generating a series of populations till converging toward an approximate Pareto front with high density. The performance of the hybrid population based algorithm (namely HBPA) is evaluated on a set of benchmark instances of the literature containing both medium and large-scale instances. Its provided results are compared to those achieved by the best methods available in the literature. Encouraging results have been obtained.
Fichier non déposé

Dates et versions

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

Identifiants

Citer

Meziane Aider, Oussama Gacem, Mhand Hifi. A hybrid population-based algorithm for the bi-objective quadratic multiple knapsack problem. Expert Systems with Applications, 2022, 191, ⟨10.1016/j.eswa.2021.116238⟩. ⟨hal-03617877⟩

Collections

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

Altmetric

Partager

Gmail Facebook Twitter LinkedIn More