Accéder directement au contenu Accéder directement à la navigation
Article dans une revue

Design and evaluation of a parallel neighbor algorithm for the disjunctively constrained knapsack problem

Abstract : We investigate the use of a parallel computing model for solving the disjunctively constrained knapsack problem. This parallel approach is based on a multi-neighborhood search. In this approach, search threads asynchronously exchange information about the best solutions and use the information to guide the search. The performance of the proposed method was evaluated on the set of the standard benchmark instances. We show encouraging results and compare them to the state-of-the-art solutions. Copyright (c) 2016 John Wiley & Sons, Ltd.
Type de document :
Article dans une revue
Liste complète des métadonnées

https://hal-u-picardie.archives-ouvertes.fr/hal-03619646
Contributeur : Louise DESSAIVRE Connectez-vous pour contacter le contributeur
Soumis le : vendredi 25 mars 2022 - 11:32:46
Dernière modification le : vendredi 5 août 2022 - 11:25:00

Identifiants

Collections

Citation

Zhe Quan, Lei Wu. Design and evaluation of a parallel neighbor algorithm for the disjunctively constrained knapsack problem. Concurrency and Computation: Practice and Experience, Wiley, 2017, 29 (20), pp.e3848. ⟨10.1002/cpe.3848⟩. ⟨hal-03619646⟩

Partager

Métriques

Consultations de la notice

7