.png){kind=icon}
.png){kind=icon}
返回
Scatter search for network design problem
.png){kind=icon}
PRE
AI
DOI：10.1007/s10479-005-2451-4.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
A fixed charge capacitated multicommodity network design problem on undirected networks is addressed. At the present time, there exists no algorithm that can solve large instances, common in several applications, in a reasonable period of time. This paper presents an efficient procedure using a scatter search framework. Computational experiments on a large set of randomly generated problems show that this procedure is capable of finding good solutions to large-scale problems within a reasonable amount of time.
Keyword:
network design
metaheuristics
scatter search
GRASP