Cooperative Parallel Tabu Search for Capacitated Network Design

  • Authors:
  • Teodor Gabriel Crainic;Michel Gendreau

  • Affiliations:
  • Centre de recherche sur les transports, Université/ de Montré/al, Canada&semi/ Dé/partement de management et technologie, Université/ du Qué/bec à/ Montré/al, Canada;Centre de recherche sur les transports&semi/ Dé/partement d'informatique et de recherche opé/rationnelle, Université/ de Montré/al, Canada

  • Venue:
  • Journal of Heuristics
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.