Star p-hub center problem and star p-hub median problem with bounded path lengths

被引：55
作者：
Yaman, Hande [1 ]
Elloumi, Sourour [2 ]
机构：
[1] Bilkent Univ, Dept Ind Engn, TR-06800 Ankara, Turkey
[2] ENSIIE CEDRIC, F-91025 Evry, France
来源：
COMPUTERS & OPERATIONS RESEARCH | 2012年 / 39卷 / 11期
关键词：
p-hub center; p-hub median; Star/star network; Path length constraints; Service quality; SINGLE-ALLOCATION HUB; LOCATION PROBLEM; FORMULATIONS; ALGORITHM; RELAXATIONS; NETWORKS; PROGRAM;
D O I：
10.1016/j.cor.2012.02.005
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
We consider two problems that arise in designing two-level star networks taking into account service quality considerations. Given a set of nodes with pairwise traffic demand and a central hub, we select p hubs and connect them to the central hub with direct links and then we connect each nonhub node to a hub. This results in a star/star network. In the first problem, called the Star p-hub Center Problem, we would like to minimize the length of the longest path in the resulting network. In the second problem, Star p-hub Median Problem with Bounded Path Lengths, the aim is to minimize the total routing cost subject to upper bound constraints on the path lengths. We propose formulations for these problems and report the outcomes of a computational study where we compare the performances of our formulations. (C) 2012 Elsevier Ltd. All rights reserved.
引用
收藏
页码：2725 / 2732
页数：8
相关论文
共 42 条
[21]   The single-assignment hub covering problem: Models and linearizations [J].
Kara, BY ;
Tansel, BC .
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2003, 54 (01) :59-64
[22]   On the single-assignment p-hub center problem [J].
Kara, BY ;
Tansel, BÇ .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2000, 125 (03) :648-655
[23]   ALGORITHMIC APPROACH TO NETWORK LOCATION PROBLEMS .1. P-CENTERS [J].
KARIV, O ;
HAKIMI, SL .
SIAM JOURNAL ON APPLIED MATHEMATICS, 1979, 37 (03) :513-538
[24]   THE SIMPLE PLANT LOCATION PROBLEM - SURVEY AND SYNTHESIS [J].
KRARUP, J ;
PRUZAN, PM .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1983, 12 (01) :36-81
[25]   A branch and cut algorithm for hub location problems with single assignment [J].
Labbé, M ;
Yaman, H ;
Gourdin, E .
MATHEMATICAL PROGRAMMING, 2005, 102 (02) :371-405
[26]   Projecting the flow variables for hub location problems [J].
Labbé, M ;
Yaman, H .
NETWORKS, 2004, 44 (02) :84-93
[27]  
LABBE M, 1995, HDBK OPER R, V8, P551
[28]   Solving the hub location problem in a star-star network [J].
Labbe, Martine ;
Yaman, Hande .
NETWORKS, 2008, 51 (01) :19-33
[29]   A 2-phase algorithm for solving the single allocation p-hub center problem [J].
Meyer, T. ;
Ernst, A. T. ;
Krishnamoorthy, M. .
COMPUTERS & OPERATIONS RESEARCH, 2009, 36 (12) :3143-3151
[30]  
O'Kelly M.E., 1991, Papers in Regional Science, V70, P367
12345