Reliability-dependent combined network design and routing optimization

D. Papadimitriou, B. Fortz
{"title":"Reliability-dependent combined network design and routing optimization","authors":"D. Papadimitriou, B. Fortz","doi":"10.1109/RNDM.2014.7014928","DOIUrl":null,"url":null,"abstract":"The capacitated Fixed-Charge Network Design (FCND) problem deals with the simultaneous optimization of capacity installation and routing of traffic, where a fixed cost is paid for opening a link and a linear routing cost is paid for sending traffic flow on a link. The routing decision must be performed such that flows remain bounded by the installed capacities. This problem appears as a particular case of the combined network design and traffic flow routing problem with time-dependent demands as developed in this paper. This general problem can be formulated as a multi-period mixed integer optimization problem. A compact formulation based on the aggregation of flows by destination and an extended formulation, where flows are decomposed by origin-destination pairs while keeping the requirement of destination-based routing, have been proposed in [1] and [2], respectively. As these computational improvements enable to progressively overcome the limit of solving such problem when the network size and number of periods increases, we propose an extended model that accounts for different patterns of failures affecting installed arcs over time. The latter lead to consider time-variable link maintenance cost function as part of our generalized formulation. We also analyze the quality of the results for the proposed formulation with different link maintenance cost functions with the objective to derive the best arc replacement strategy.","PeriodicalId":299072,"journal":{"name":"2014 6th International Workshop on Reliable Networks Design and Modeling (RNDM)","volume":"84 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 6th International Workshop on Reliable Networks Design and Modeling (RNDM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/RNDM.2014.7014928","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

Abstract

The capacitated Fixed-Charge Network Design (FCND) problem deals with the simultaneous optimization of capacity installation and routing of traffic, where a fixed cost is paid for opening a link and a linear routing cost is paid for sending traffic flow on a link. The routing decision must be performed such that flows remain bounded by the installed capacities. This problem appears as a particular case of the combined network design and traffic flow routing problem with time-dependent demands as developed in this paper. This general problem can be formulated as a multi-period mixed integer optimization problem. A compact formulation based on the aggregation of flows by destination and an extended formulation, where flows are decomposed by origin-destination pairs while keeping the requirement of destination-based routing, have been proposed in [1] and [2], respectively. As these computational improvements enable to progressively overcome the limit of solving such problem when the network size and number of periods increases, we propose an extended model that accounts for different patterns of failures affecting installed arcs over time. The latter lead to consider time-variable link maintenance cost function as part of our generalized formulation. We also analyze the quality of the results for the proposed formulation with different link maintenance cost functions with the objective to derive the best arc replacement strategy.
基于可靠性的组合网络设计与路由优化
容量固定收费网络设计(FCND)问题涉及容量安装和流量路由的同时优化问题,其中开通一条链路需要支付固定成本,在一条链路上发送流量需要支付线性路由成本。必须执行路由决策,使流仍然受已安装容量的限制。该问题是本文提出的具有时变需求的网络设计与交通流路由问题的一个特例。该一般问题可表述为一个多周期混合整数优化问题。文献[1]和文献[2]分别提出了一种基于目的地聚合流的紧凑公式和一种扩展公式,在保持基于目的地路由需求的情况下,将流按始发目的地对进行分解。随着网络规模和周期数量的增加,这些计算改进能够逐步克服解决此类问题的限制,我们提出了一个扩展模型,该模型考虑了随时间推移影响安装电弧的不同故障模式。后者导致考虑时变环节维护成本函数作为我们的广义公式的一部分。我们还分析了不同维护成本函数下所提出的公式的结果质量,以得出最佳的电弧替换策略。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信