.png){kind=icon}
返回
Hub interdiction problem variants: Models and metaheuristic solution algorithms
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2017.11.058.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Hub location problem (HLP) is one of the strategic problems encountered in designing transportation and telecommunication networks. Regardless of the considered objective in design of hub networks, such as cost minimization or service level maximization, the located hubs can be subject to natural or intentional disruptions after installation. In this paper, we address the multiple allocation p-hub median, p-hub maximal covering, and p-hub center problems under intentional disruptions. In each case, the problem is considered as a Stackelberg game where the leader locates p hubs to optimize his/her objective function, whereas the follower tries to identify and interdict r hubs that their loss would diminish the network performance the most. Bilevel and single level mathematical formulations are presented to model the problem from the leader's and the follower's perspectives. Furthermore, efficient Simulated Annealing (SA) heuristics are proposed for solving the problems. Extensive computational experiments show the capability of the proposed SA algorithms to obtain the optimal solutions in short computational times. Some managerial insights are also derived based on the obtained numerical results. (C) 2017 Elsevier B.V. All rights reserved.
Keyword:
Location
Hub interdiction problems
Competitive models
Bilevel programming
Simulated annealing
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
引用论文
.png){kind=icon}
分享收藏The P-Hub maximal covering problem and extensions for gradual decay functions逐步衰减函数的p-hub最大覆盖问题和扩展
OAAI
OAAI分享收藏
查看更多内容