Design and evaluation of a parallel neighbor algorithm for the disjunctively constrained knapsack problem. (12th May 2016)

• Record Type: Journal Article
• Authors: Quan, Zhe; Wu, Lei
• Other Names: Li Gang guestEditor.; Niu Wenjia guestEditor.; Batten Lynn guestEditor.; Liu Jiqiang guestEditor.; Li Kenli guestEditor.; Wang Lipo guestEditor.; Liu Yong guestEditor.
• Is Part Of: Concurrency and computation. Volume 29:Number 20(2017)
• Page Start: n/a
• Page End: n/a
• Publication Date: 2016-05-12
• Subjects: parallel computing -- knapsack -- metaheuristic; Parallel processing (Electronic computers) -- Periodicals; Parallel computers -- Periodicals; 004.35
• DOI: 10.1002/cpe.3848
• Languages: English
• ISSNs: 1532-0626

Abstract

Summary: 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 © 2016 John Wiley & Sons, Ltd.