Cooperative parallel decomposition guided VNS for solving weighted csp

Abstract

Tree decomposition introduced by Robertson and Seymour aims to decompose a problem into clusters constituting an acyclic graph. Recently, Fontaine et al. [8] introduced DGVNS (Decomposition Guided VNS) that uses the graph of clusters provided by a tree decomposition to manage the exploration of large neighborhoods. However, for large scale problems, the performance of DGVNS may decrease significantly due to the large number of clusters to be considered sequentially. To overcome this shortcoming we propose CPDGVNS (Cooperative Parallel DGVNS) in which the clusters are explored in parallel through an asynchronous master-slave architecture. Experiments performed on real life instances show the appropriateness and the efficiency of our approach. © Springer International Publishing Switzerland 2014.