科研之友
微信
新浪微博
Facebook
分享链接
摘要
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.
- 出版日期2017-10-25
- 单位中国人民解放军国防科学技术大学; 湖南大学
