.png){kind=icon}
返回
A tabu search algorithm for self-healing ring network design
.png){kind=icon}
OA
AI
DOI：10.1016/S0377-2217(02)00826-3.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We consider the problem of designing self-healing rings in order to protect the transmission of telecommunication demands in a zonal network. This problem stems from a real application with operational constraints such as dual homing and hop limit per ring. A modeling approach taking into account ring interactions is proposed as well as a tabu search heuristic for solving it. Computational results for a comprehensive set of real and randomly generated instances are presented. (C) 2003 Elsevier B.V. All rights reserved.
Keyword:
telecommunications
network design
survivability
self-healing rings
tabu search
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
.png){kind=icon}
查看更多内容