Design and evaluation of a parallel neighbor algorithm for the disjunctively constrained knapsack problem - Université de Picardie Jules Verne Accéder directement au contenu
Article Dans Une Revue Concurrency and Computation: Practice and Experience Année : 2017

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

Résumé

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.
Fichier non déposé

Dates et versions

hal-03619646 , version 1 (25-03-2022)

Identifiants

Citer

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

Altmetric

Partager

Gmail Facebook Twitter LinkedIn More