A Hybrid Swarm Optimization-Based Algorithm for the Set-Union Knapsack Problem - Université de Picardie Jules Verne Accéder directement au contenu
Communication Dans Un Congrès Année : 2020

A Hybrid Swarm Optimization-Based Algorithm for the Set-Union Knapsack Problem

I Dahmani
  • Fonction : Auteur
M. Ferroum
  • Fonction : Auteur
S. Sadeghsa
  • Fonction : Auteur
  • PersonId : 1227208
  • IdRef : 267668465

Résumé

In this paper, we propose a hybrid particle swarm optimization-based algorithm for approximately solving the set-union knapsack problem. Knapsack problem arises in several applications such as manufacturing systems, transportation and supply chain management. This study reinforce the basic swarm optimization method with a local search procedure for the setunion knapsack problem. The proposed approach is evaluated on a benchmark instances available in the literature. The bounds achieved by the proposed approach are compared to those provided by the best methods available in the literature. Encouraging results have been provided.
Fichier non déposé

Dates et versions

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

Identifiants

  • HAL Id : hal-03617887 , version 1

Citer

I Dahmani, M. Ferroum, Mhand Hifi, S. Sadeghsa. A Hybrid Swarm Optimization-Based Algorithm for the Set-Union Knapsack Problem. 2020 7TH INTERNATIONAL CONFERENCE ON CONTROL, DECISION AND INFORMATION TECHNOLOGIES (CODIT'20), VOL 1, Jun 2020, Prague, Czech Republic. pp.1162-1167. ⟨hal-03617887⟩

Collections

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

Partager

Gmail Mastodon Facebook X LinkedIn More