Arrêt de service lundi 11 juillet de 12h30 à 13h : tous les sites du CCSD (HAL, EpiSciences, SciencesConf, AureHAL) seront inaccessibles (branchement réseau à modifier)
Accéder directement au contenu Accéder directement à la navigation
Communication dans un congrès

Combining GRASP and Path-Relinking for Solving the Max-Min Knapsack Problem with Multiple Scenarios

Abstract : In this paper, both greedy randomized search procedure and path-relinking are combined for tackling the max-min knapsack problem with multi-scenarios. The proposed method iterates a building phase and an improvement phase that is based upon an extended search process. The first phase yields a (starting) feasible solution for the problem by applying a greedy randomized search procedure. The second phase tries to enhance each current solution by applying the path-relinking based strategy. Finally, the proposed method is evaluated on a set of benchmark instances taken from the literature. The obtained results are compared to those reached by some best algorithms available in the literature. Encouraging results have been obtained.
Type de document :
Communication dans un congrès
Liste complète des métadonnées

https://hal-u-picardie.archives-ouvertes.fr/hal-03700573
Contributeur : Louise DESSAIVRE Connectez-vous pour contacter le contributeur
Soumis le : mardi 21 juin 2022 - 11:42:53
Dernière modification le : mercredi 22 juin 2022 - 03:06:26

Identifiants

  • HAL Id : hal-03700573, version 1

Collections

Citation

T. Al-Douri, Mhand Hifi. Combining GRASP and Path-Relinking for Solving the Max-Min Knapsack Problem with Multiple Scenarios. Proceedings of International Conference on Computers and Industrial Engineering, CIE, Oct 2017, Lisbonne, Portugal. ⟨hal-03700573⟩

Partager

Métriques

Consultations de la notice

0