Developing prevention reliability in hub location models

被引:7
作者
Hamidi, Mohammadreza [1 ]
Gholamian, Mohammadreza [1 ]
Shahanaghi, Kamran [1 ]
机构
[1] IUST, Sch Ind Engn, Tehran 1684613114, Iran
关键词
Hub location problems; reliability engineering; network reliability; security analysis; logistics; MEDIAN PROBLEM; UNCAPACITATED SINGLE; COVERING PROBLEM; NETWORKS; CONSTRAINTS; ASSIGNMENT; FACILITIES; ALGORITHM; SEARCH;
D O I
10.1177/1748006X13519247
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
Hub location problem has been one of the most interesting areas of location problems in recent decades. Hubs are critical centers that have a significant role in networks such as logistic, distribution and transportation networks. Therefore, it is necessary to design reliable hub networks to overcome different interruptions. In this article, we have proposed a new concept in hub location problems called preventive reliable hub location problem which is based on passive defense definitions. When valuable objects are transported via networks, many intentional crimes such as attack or robbery may occur. To make transportation faster and cheaper, it is desired to use hub and spoke networks. In addition, preventive reliable hub location problem is designed to secure the network and prevent loss of values. To make the network more reliable and save all common properties, three new objects have been added to the usual hub networks: fake hub, fake allocation and fake flow. A mixed integer linear programming is used to model preventive reliable hub location problem and solved using literature data. Finally, the results are represented.
引用
收藏
页码:337 / 346
页数:10
相关论文
共 35 条
  • [11] Hubbing and routing in postal delivery systems
    Cetiner, Selim
    Sepil, Canan
    Sural, Haldun
    [J]. ANNALS OF OPERATIONS RESEARCH, 2010, 181 (01) : 109 - 124
  • [12] Single allocation hub location problem under congestion: Network owner and user perspectives
    de Camargo, R. S.
    Miranda, G.
    [J]. EXPERT SYSTEMS WITH APPLICATIONS, 2012, 39 (03) : 3385 - 3391
  • [13] Ernst A. T., 1996, Location Science, V4, P139, DOI 10.1016/S0966-8349(96)00011-3
  • [14] Uncapacitated single and multiple allocation p-hub center problems
    Ernst, Andreas T.
    Hamacher, Horst
    Jiang, Houyuan
    Krishnamoorthy, Mohan
    Woeginger, Gerhard
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2009, 36 (07) : 2230 - 2241
  • [15] Hub location problems: A review of models, classification, solution techniques, and applications
    Farahani, Reza Zanjirani
    Hekmatfar, Masoud
    Arabani, Alireza Boloori
    Nikbakhsh, Ehsan
    [J]. COMPUTERS & INDUSTRIAL ENGINEERING, 2013, 64 (04) : 1096 - 1109
  • [16] Hudak S., 2008, AUTOMATIC HONEYPOT G
  • [17] Uncapacitated single allocation p-hub maximal covering problem
    Hwang, Young Ha
    Lee, Young Hoon
    [J]. COMPUTERS & INDUSTRIAL ENGINEERING, 2012, 63 (02) : 382 - 389
  • [18] A general variable neighborhood search for solving the uncapacitated single allocation p-hub median problem
    Ilic, Aleksandar
    Urosevic, Dragan
    Brimberg, Jack
    Mladenovic, Nenad
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2010, 206 (02) : 289 - 300
  • [19] On the single-assignment p-hub center problem
    Kara, BY
    Tansel, BÇ
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2000, 125 (03) : 648 - 655
  • [20] Hub covering location problems with different coverage types
    Karimi, H.
    Bashiri, M.
    [J]. SCIENTIA IRANICA, 2011, 18 (06) : 1571 - 1578