Journal
JOURNAL OF HEURISTICS
Volume 8, Issue 6, Pages 601-627Publisher
SPRINGER
DOI: 10.1023/A:1020325926188
Keywords
service network design; parallel tabu search; cooperative search
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available