A Survey of Hub Location Problems

被引：13
|
作者：
Hsieh, Sun-Yuan [1 ]
Kao, Shih-Shun [1 ]
机构：
[1] Natl Cheng Kung Univ, Dept Comp Sci & Informat Engn, Tainan 701, Taiwan
来源：
JOURNAL OF INTERCONNECTION NETWORKS | 2019年 / 19卷 / 01期
关键词：
Location; network design; COVERING PROBLEM; FORMULATIONS; HEURISTICS; ALGORITHMS; SEARCH; MODELS;
D O I：
10.1142/S021926591940005X
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
Hub location problems originated in telecommunications and transportation systems. They combine various aspects of network issues, including location problems, network design problems and routing problems. The main theme of these problems is to route the services via a subset of hubs, rather than route each service with direct links between demand nodes. Therefore, solutions for hub location problems typically use sets of hubs to reroute the flow of the services and attempt to reduce the costs of building the service links. In this paper, we present a survey of hub location problems.
引用
收藏
页数：14
相关论文
共 50 条
  • [41] The hub location's method for solving optimal control problems
    Salimi, Mitra
    Borzabadi, Akbar H.
    Mehne, Hamed H.
    Heydari, Aghileh
    EVOLUTIONARY INTELLIGENCE, 2021, 14 (04) : 1671 - 1690
  • [42] Advances in hub location problems: a literature review and research agenda
    Sharma, Ankit
    Jakhar, Suresh Kumar
    Vlachos, Ilias
    Kumar, Satish
    INTERNATIONAL JOURNAL OF PRODUCTIVITY AND PERFORMANCE MANAGEMENT, 2025, 74 (01) : 24 - 55
  • [43] The hub location’s method for solving optimal control problems
    Mitra Salimi
    Akbar H. Borzabadi
    Hamed H. Mehne
    Aghileh Heydari
    Evolutionary Intelligence, 2021, 14 : 1671 - 1690
  • [44] Solving Single Allocation Hub Location Problems on Euclidean Data
    Meier, J. Fabian
    Clausen, Uwe
    TRANSPORTATION SCIENCE, 2018, 52 (05) : 1141 - 1155
  • [45] Adapting polyhedral properties from facility to hub location problems
    Hamacher, HW
    Labbé, M
    Nickel, S
    Sonneborn, T
    DISCRETE APPLIED MATHEMATICS, 2004, 145 (01) : 104 - 116
  • [46] A branch and cut algorithm for hub location problems with single assignment
    Martine Labbé
    Hande Yaman
    Eric Gourdin
    Mathematical Programming, 2005, 102 : 371 - 405
  • [47] Bicriteria p-Hub Location Problems and Evolutionary Algorithms
    Koksalan, Murat
    Soylu, Banu
    INFORMS JOURNAL ON COMPUTING, 2010, 22 (04) : 528 - 542
  • [48] A branch and cut algorithm for hub location problems with single assignment
    Labbé, M
    Yaman, H
    Gourdin, E
    MATHEMATICAL PROGRAMMING, 2005, 102 (02) : 371 - 405
  • [49] Reliable p-Hub Location Problems in Telecommunication Networks
    Kim, Hyun
    O'Kelly, Morton E.
    GEOGRAPHICAL ANALYSIS, 2009, 41 (03) : 283 - 306
  • [50] A Benders Decomposition for Hub Location Problems Arising in Public Transport
    Gelareh, Shahin
    Nickel, Stefan
    OPERATIONS RESEARCH PROCEEDINGS 2007, 2008, : 129 - +
12345