Accéder directement au contenu Accéder directement à la navigation
Communication dans un congrès

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

Abstract : 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.
Type de document :
Communication dans un congrès
Liste complète des métadonnées

https://hal-u-picardie.archives-ouvertes.fr/hal-03617887
Contributeur : Louise Dessaivre Connectez-vous pour contacter le contributeur
Soumis le : mercredi 23 mars 2022 - 18:08:07
Dernière modification le : jeudi 24 mars 2022 - 03:00:21

Identifiants

  • HAL Id : hal-03617887, version 1

Collections

Citation

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⟩

Partager

Métriques

Consultations de la notice

7