期刊
JOURNAL OF HEURISTICS
卷 8, 期 6, 页码 601-627出版社
SPRINGER
DOI: 10.1023/A:1020325926188
关键词
service network design; parallel tabu search; cooperative search
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据