Robust uncapacitated hub location

被引:75
|
作者
Zetina, Carlos Armando [1 ,2 ]
Contreras, Ivan [1 ,2 ]
Cordeau, Jean-Francois [2 ,3 ]
Nikbakhsh, Ehsan [4 ]
机构
[1] Concordia Univ, Montreal, PQ H3G 1M8, Canada
[2] Interuniv Res Ctr Enterprise Networks Logist & Tr, Montreal, PQ, Canada
[3] HEC Montreal, Montreal, PQ, Canada
[4] Tarbiat Modares Univ, Dept Ind Engn, Tehran, Iran
基金
加拿大自然科学与工程研究理事会; 加拿大创新基金会;
关键词
Hub location; Robust discrete optimization; Budget of uncertainty; UNIT COMMITMENT PROBLEM; NETWORK DESIGN; OPTIMIZATION PROBLEMS; SPOKE NETWORKS; UNCERTAINTY; SINGLE; FORMULATIONS; CONSTRAINTS; CONGESTION; ALGORITHMS;
D O I
10.1016/j.trb.2017.06.008
中图分类号
F [经济];
学科分类号
02 ;
摘要
In this paper we present robust counterparts for uncapacitated hub location problems in which the level of conservatism can be controlled by means of a budget of uncertainty. We study three particular cases for which the parameters are subject to interval uncertainty: demand, transportation cost, and both simultaneously. We present mixed integer programming formulations for each of these cases and a branch-and-cut algorithm to solve the latter. We present computational results to evaluate the performance of the proposed formulations when solved with a general purpose solver and study the structure of the solutions to each of the robust counterparts. We also compare the performance between solutions obtained from a commensurable stochastic model and those from our robust counterparts in both risk neutral and worst-case settings. (C) 2017 Elsevier Ltd. All rights reserved.
引用
收藏
页码:393 / 410
页数:18
相关论文
共 50 条
  • [21] GA Inspired Heuristic for Uncapacitated Single Allocation Hub Location Problem
    Filipovic, Vladimir
    Kratica, Jozef
    Tosic, Dusan
    Dugosija, Djordje
    APPLICATIONS OF SOFT COMPUTING: FROM THEORY TO PRAXIS, 2009, 58 : 149 - +
  • [22] Distributionally Robust Hub Location
    Wang, Shuming
    Chen, Zhi
    Liu, Tianqi
    TRANSPORTATION SCIENCE, 2020, 54 (05) : 1189 - 1210
  • [23] Polyhedral analysis for the uncapacitated hub location problem with modular arc capacities
    Yaman, H
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2005, 19 (02) : 501 - 522
  • [24] An efficient memetic algorithm for the uncapacitated single allocation hub location problem
    Miroslav Marić
    Zorica Stanimirović
    Predrag Stanojević
    Soft Computing, 2013, 17 : 445 - 466
  • [25] A threshold accepting algorithm for the uncapacitated single allocation hub location problem
    Ting, Ching-Jung
    Wang, Hung-Jie
    JOURNAL OF THE CHINESE INSTITUTE OF ENGINEERS, 2014, 37 (03) : 300 - 312
  • [26] The robust uncapacitated multiple allocation p-hub median problem
    Talbi, EI-Ghazali
    Todosijevic, Raca
    COMPUTERS & INDUSTRIAL ENGINEERING, 2017, 110 : 322 - 332
  • [27] Novel reliable uncapacitated p-hub location problems under uncertainty
    Nematian J.
    Nematian, Javad, 2018, IGI Global (07) : 115 - 155
  • [28] An efficient tabu search for solving the uncapacitated single allocation hub location problem
    Abyazi-Sani, Roya
    Ghanbari, Reza
    COMPUTERS & INDUSTRIAL ENGINEERING, 2016, 93 : 99 - 109
  • [29] New simple and efficient heuristics for the uncapacitated single allocation hub location problem
    Silva, Marcos Roberto
    Cunha, Claudio B.
    COMPUTERS & OPERATIONS RESEARCH, 2009, 36 (12) : 3152 - 3165
  • [30] Conditional median as a robust solution concept for uncapacitated location problems
    Włodzimierz Ogryczak
    TOP, 2010, 18 : 271 - 285