Cooperative Parallel Tabu Search for Capacitated Network Design

We present a cooperative parallel tabu search method for the fixed charge, capacitated, multicommodity network design problem. Several communication strategies are analyzed and compared. The resulting parallel procedure displays excellent performances in terms of solution quality and solution times. The experiments show that parallel implementations find better solutions than sequential ones. They also show that, when properly designed and implemented, cooperative search outperforms independent search strategies, at least on the class of problems of interest here. Key Words: service network design, parallel tabu search, cooperative search

• Type: Journal
• Year: 2002
• Where: HEURISTICS
• Authors: Teodor Gabriel Crainic, Michel Gendreau
• Keywords: Cooperative Parallel Tabu, Cooperative Search, HEURISTICS 2002, Parallel Tabu Search