Hub Location with Protection Under Interhub Link Failures

布线(电子设计自动化) 计算机科学 路径(计算) 集合(抽象数据类型) 运筹学 链接(几何体) 商品 数学优化 计算机网络 经济 数学 市场经济 程序设计语言
作者
Víctor Blanco,Elena Fernández,Yolanda Hinojosa
出处
期刊:Informs Journal on Computing 卷期号:35 (5): 966-985 被引量:3
标识
DOI:10.1287/ijoc.2023.1296
摘要

This paper introduces the hub location problem under interhub link failures, a hub location problem in which activated interhub links may fail with a given probability. Two different optimization models are studied, which construct hub backbone networks protected under interhub link disruptions by imposing that, for each commodity, an additional routing path exists besides its original routing path. Both models consider the minimization of the fixed costs of the activated hubs and interhub links plus the expected value of the routing costs of the original and alternative paths. The first model builds explicitly the alternative routing paths, whereas the second model guarantees that, for each commodity, at least one alternative path exists using a large set of connectivity constraints although the alternative paths are not built explicitly. The results of extensive computational testing allow us to analyze the performance of the two proposed models and to evaluate the extra cost required to design a robust backbone network under interhub link failures. The obtained results support the validity of the proposal. History: Accepted by David Alderson, Area Editor for Network Optimization: Algorithms & Application. Funding: The authors of this research acknowledge financial support by the Spanish Ministerio de Ciencia y Tecnología, Agencia Estatal de Investigación and Fondos Europeos de Desarrollo Regional (FEDER) via projects PID2020-114594GB-C21 and MTM2019-105824GB-I00. The authors also acknowledge partial support from projects FEDER-US-1256951, Junta de Andalucía P18-FR-422, P18-FR-2369, B-FQM-322-UGR20 (COXMOS), and NetmeetData: Ayudas Fundación BBVA a equipos de investigación científica 2019. The first author was partially supported by the IMAG-Maria de Maeztu grant [CEX2020-001105-M/AEI/10.13039/501100011033] and UE-NextGenerationEU (ayudas de movilidad para la recualificación del profesorado universitario). Supplemental Material: The online supplement is available at https://doi.org/10.1287/ijoc.2023.1296 .
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
更新
PDF的下载单位、IP信息已删除 (2025-6-4)

科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
烟花发布了新的文献求助10
刚刚
1秒前
1秒前
ZhengSyHoe发布了新的文献求助10
1秒前
ruyunlong完成签到,获得积分10
2秒前
醉熏的筝完成签到,获得积分10
2秒前
Yuuuu发布了新的文献求助10
2秒前
2秒前
共享精神应助夜雨声烦采纳,获得10
3秒前
move完成签到 ,获得积分10
3秒前
自觉的碧空完成签到,获得积分10
4秒前
纯情女大发布了新的文献求助10
5秒前
6秒前
QMCL完成签到,获得积分0
6秒前
香蕉觅云应助ruyunlong采纳,获得10
6秒前
present发布了新的文献求助10
6秒前
VV完成签到,获得积分10
6秒前
iccce完成签到,获得积分10
7秒前
7秒前
7秒前
CipherSage应助11111采纳,获得10
9秒前
烟花完成签到,获得积分10
9秒前
CodeCraft应助LuoYR@SZU采纳,获得10
9秒前
xixima完成签到,获得积分20
9秒前
9秒前
C3ASER完成签到,获得积分10
10秒前
林凡发布了新的文献求助10
10秒前
plus发布了新的文献求助30
11秒前
11秒前
MANGMANG完成签到,获得积分10
11秒前
今后应助小鱼采纳,获得30
11秒前
11秒前
Weirdo完成签到,获得积分10
11秒前
MchemG应助小海豹采纳,获得10
11秒前
11秒前
烂漫的煎饼完成签到 ,获得积分10
11秒前
IvanMcRae完成签到,获得积分10
12秒前
完美世界应助iccce采纳,获得10
12秒前
123发布了新的文献求助10
13秒前
CH关闭了CH文献求助
13秒前
高分求助中
The Mother of All Tableaux Order, Equivalence, and Geometry in the Large-scale Structure of Optimality Theory 2400
Ophthalmic Equipment Market by Devices(surgical: vitreorentinal,IOLs,OVDs,contact lens,RGP lens,backflush,diagnostic&monitoring:OCT,actorefractor,keratometer,tonometer,ophthalmoscpe,OVD), End User,Buying Criteria-Global Forecast to2029 2000
Optimal Transport: A Comprehensive Introduction to Modeling, Analysis, Simulation, Applications 800
Official Methods of Analysis of AOAC INTERNATIONAL 600
ACSM’s Guidelines for Exercise Testing and Prescription, 12th edition 588
Treatise on Geochemistry 500
T/CIET 1202-2025 可吸收再生氧化纤维素止血材料 500
热门求助领域 (近24小时)
化学 材料科学 医学 生物 工程类 有机化学 生物化学 物理 内科学 纳米技术 计算机科学 化学工程 复合材料 遗传学 基因 物理化学 催化作用 冶金 细胞生物学 免疫学
热门帖子
关注 科研通微信公众号,转发送积分 3954947
求助须知:如何正确求助?哪些是违规求助? 3501093
关于积分的说明 11101851
捐赠科研通 3231470
什么是DOI,文献DOI怎么找? 1786438
邀请新用户注册赠送积分活动 870058
科研通“疑难数据库(出版商)”最低求助积分说明 801798