Cooperative parallel adaptive neighbourhood search for the disjunctively constrained knapsack problem. Issue 9 (2nd September 2017)

• Record Type: Journal Article
• Authors: Quan, Zhe; Wu, Lei
• Is Part Of: Engineering optimization. Volume 49:Issue 9(2017)
• Page Start: 1541
• Page End: 1557
• Publication Date: 2017-09-02
• Subjects: Parallel computing -- knapsack -- conflict graph -- metaheuristic -- cooperative; Engineering design -- Periodicals; Mathematical optimization -- Periodicals; 620.0042
• DOI: 10.1080/0305215X.2016.1257854
• Languages: English
• ISSNs: 0305-215X

Abstract

ABSTRACT: This article investigates the use of parallel computing for solving the disjunctively constrained knapsack problem. The proposed parallel computing model can be viewed as a cooperative algorithm based on a multi-neighbourhood search. The cooperation system is composed of a team manager and a crowd of team members. The team members aim at applying their own search strategies to explore the solution space. The team manager collects the solutions from the members and shares the best one with them. The performance of the proposed method is evaluated on a group of benchmark data sets. The results obtained are compared to those reached by the best methods from the literature. The results show that the proposed method is able to provide the best solutions in most cases. In order to highlight the robustness of the proposed parallel computing model, a new set of large-scale instances is introduced. Encouraging results have been obtained.