Hub-and-spoke network design with congestion

We consider a hub-and-spoke network design problem with congestion. The model we propose extends current models by taking congestion effects into account. This is achieved through a non-linear cost term in the objective function. We first linearize the model, and then provide a Lagrangean heuristic...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Computers & operations research Ročník 32; číslo 6; s. 1615 - 1632
Hlavní autori:	Elhedhli, Samir, Hu, Frank Xiaolong
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Oxford Elsevier Ltd 01.06.2005 Elsevier Science Pergamon Press Inc
Predmet:	Applied sciences Congestion Design Exact sciences and technology Hub-and-spoke network design Integer programming Lagrangean relaxation Mathematical programming Network topologies Non-linear integer programming Nonlinear programming Operational research and scientific management Operational research. Management science Studies Hub-and-spoke network design Non-linear integer programming Lagrangean relaxation Congestion Hub Non linear programming Traffic congestion
ISSN:	0305-0548, 1873-765X, 0305-0548
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Abstract	We consider a hub-and-spoke network design problem with congestion. The model we propose extends current models by taking congestion effects into account. This is achieved through a non-linear cost term in the objective function. We first linearize the model, and then provide a Lagrangean heuristic that finds high-quality solutions within reasonable computational time. The results of the model provide new and realistic insights into the hub-and-spoke network design problem.
AbstractList	We consider a hub-and-spoke network design problem with congestion. The model we propose extends current models by taking congestion effects into account. This is achieved through a non-linear cost term in the objective function. We first linearize the model, and then provide a Lagrangean heuristic that finds high-quality solutions within reasonable computational time. The results of the model provide new and realistic insights into the hub-and-spoke network design problem. We consider a hub-and-spoke network design problem with congestion. The model we propose extends current models by taking congestion effects into account. This is achieved through a non-linear cost term in the objective function. We first linearize the model, and then provide a Lagrangean heuristic that finds high-quality solutions within reasonable computational time. The results of the model provide new and realistic insights into the hub-and-spoke network design problem. [PUBLICATION ABSTRACT]
Author	Hu, Frank Xiaolong Elhedhli, Samir
Author_xml	– sequence: 1 givenname: Samir surname: Elhedhli fullname: Elhedhli, Samir email: elhedhli@engmail.uwaterloo.ca – sequence: 2 givenname: Frank Xiaolong surname: Hu fullname: Hu, Frank Xiaolong email: x3hu@engmail.uwaterloo.ca
BackLink	http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=16429274$$DView record in Pascal Francis
BookMark	eNp9kE1LAzEQhoNUsK3-AG9F0JO7ZpLdTRZPUvwCwYuCt5DNzmrqmtRka_Hfm1pB8GAuA-F53xmeCRk575CQQ6A5UKjOFrnxIWeU8hwgTz87ZAxS8ExU5dOIjCmnZUbLQu6RSYwLmp5gMCanN6sm067N4tK_4szhsPbhddZitM9utrbDy8x494xxsN7tk91O9xEPfuaUPF5dPsxvsrv769v5xV1muORDVgOHThddW2Mri6aUIEA0dd10TLaFxFI0kjPOy7qS1KCuDHS1LphhSBsuNJ-Sk23vMvj3Vdqt3mw02PfaoV9FxWomGS3KBB79ARd-FVy6TUFdSiYEVAk6_oF0NLrvgnbGRrUM9k2HTwVVkfpEkTjYcib4GAN2vwhVG8lqoZJktZGsABT97hZ_MsYOeuNqCNr2_ybPt0lMIj8sBhWNRWewtQHNoFpv_0l_ARtelpU
CODEN	CMORAP
CitedBy_id	crossref_primary_10_1016_j_tust_2021_104086 crossref_primary_10_1016_j_ejor_2018_03_031 crossref_primary_10_1016_j_sftr_2025_101054 crossref_primary_10_1007_s40305_023_00530_z crossref_primary_10_1016_j_tre_2020_102201 crossref_primary_10_4018_ijsds_2015010102 crossref_primary_10_1155_2014_830632 crossref_primary_10_1287_trsc_1080_0233 crossref_primary_10_1016_j_tre_2020_102166 crossref_primary_10_1007_s10845_012_0717_7 crossref_primary_10_1016_j_ejor_2025_04_011 crossref_primary_10_1002_atr_5670430401 crossref_primary_10_3141_2269_03 crossref_primary_10_1007_s12063_022_00315_2 crossref_primary_10_1007_s00170_013_5602_9 crossref_primary_10_3390_math8122109 crossref_primary_10_1007_s10479_019_03421_w crossref_primary_10_1016_j_tre_2014_06_008 crossref_primary_10_1287_ijoc_1090_0335 crossref_primary_10_1016_j_engappai_2019_08_019 crossref_primary_10_1016_j_tre_2017_01_005 crossref_primary_10_1108_IJPPM_09_2023_0514 crossref_primary_10_1007_s11067_018_9385_2 crossref_primary_10_1016_j_cie_2016_09_019 crossref_primary_10_1016_j_addma_2018_03_010 crossref_primary_10_1016_j_cie_2018_09_010 crossref_primary_10_1016_j_tra_2016_06_011 crossref_primary_10_1109_TASE_2011_2142304 crossref_primary_10_1016_j_ejor_2012_10_051 crossref_primary_10_3390_su12041519 crossref_primary_10_1088_1742_6596_1836_1_012008 crossref_primary_10_1007_s10479_017_2656_3 crossref_primary_10_1016_j_tre_2024_103482 crossref_primary_10_4018_IJSDA_2019040102 crossref_primary_10_1016_j_trb_2016_11_001 crossref_primary_10_1007_s10729_023_09656_1 crossref_primary_10_1016_j_cor_2006_07_002 crossref_primary_10_1111_poms_12029 crossref_primary_10_1007_s00500_016_2398_1 crossref_primary_10_1016_j_jairtraman_2016_04_008 crossref_primary_10_1016_j_ejor_2023_01_066 crossref_primary_10_1007_s10479_017_2499_y crossref_primary_10_1007_s11067_013_9189_3 crossref_primary_10_1016_j_ergon_2015_09_007 crossref_primary_10_1016_j_cor_2021_105611 crossref_primary_10_1111_poms_12378 crossref_primary_10_1016_j_trb_2019_12_003 crossref_primary_10_1016_j_tre_2015_10_007 crossref_primary_10_1016_j_trb_2014_09_011 crossref_primary_10_1016_j_ejor_2020_09_039 crossref_primary_10_1016_j_eswa_2011_09_026 crossref_primary_10_1287_trsc_2024_0657 crossref_primary_10_1016_j_jtrangeo_2012_02_009 crossref_primary_10_1016_j_cie_2024_110113 crossref_primary_10_1111_exsy_12886 crossref_primary_10_1016_j_tre_2014_10_016 crossref_primary_10_1016_j_trpro_2020_03_191 crossref_primary_10_1016_j_cor_2022_105760 crossref_primary_10_1016_j_apm_2017_10_033 crossref_primary_10_1080_13675567_2011_553495 crossref_primary_10_1016_j_jrtpm_2024_100495 crossref_primary_10_1007_s40314_021_01650_z crossref_primary_10_1016_j_tre_2025_104285 crossref_primary_10_1016_j_engappai_2018_10_004 crossref_primary_10_1038_s41598_024_67896_9 crossref_primary_10_1111_gean_12006 crossref_primary_10_1287_ijoc_1100_0391 crossref_primary_10_1016_j_tre_2025_103995 crossref_primary_10_1016_j_cor_2008_10_004 crossref_primary_10_1016_j_ejor_2024_03_007 crossref_primary_10_1287_ijoo_2019_0031 crossref_primary_10_1016_j_ejor_2020_11_021 crossref_primary_10_1088_1755_1315_587_1_012087 crossref_primary_10_3390_su14138061 crossref_primary_10_1155_2024_5754231 crossref_primary_10_3390_en11071682 crossref_primary_10_1016_j_ocecoaman_2022_106230 crossref_primary_10_3141_2466_03 crossref_primary_10_1080_23302674_2025_2527869 crossref_primary_10_1007_s00521_016_2520_4 crossref_primary_10_1016_j_eswa_2014_02_027 crossref_primary_10_1016_j_tre_2020_102069 crossref_primary_10_1007_s10479_023_05563_4 crossref_primary_10_1016_j_ejor_2007_06_008 crossref_primary_10_1016_j_trd_2017_06_016 crossref_primary_10_1016_j_trb_2021_08_008 crossref_primary_10_1016_j_apm_2015_11_019 crossref_primary_10_1016_j_ejor_2012_03_010 crossref_primary_10_1016_j_tre_2010_05_005 crossref_primary_10_1155_2021_8711964 crossref_primary_10_1016_j_trb_2009_09_002 crossref_primary_10_1016_j_trc_2018_12_011 crossref_primary_10_1016_j_engappai_2017_03_006 crossref_primary_10_1016_j_orl_2011_06_015 crossref_primary_10_1007_s40092_018_0288_0 crossref_primary_10_1016_j_mcm_2011_06_038 crossref_primary_10_1016_j_ejor_2024_07_013 crossref_primary_10_1080_03081060_2018_1469284 crossref_primary_10_1007_s10479_021_03993_6 crossref_primary_10_1287_opre_2021_2185 crossref_primary_10_1016_j_ejor_2013_06_055 crossref_primary_10_1287_trsc_2022_0112 crossref_primary_10_1016_j_cor_2022_105959 crossref_primary_10_1016_j_eswa_2018_10_019 crossref_primary_10_1016_j_tre_2025_103972 crossref_primary_10_1080_21681015_2015_1107860 crossref_primary_10_1016_j_trb_2017_06_008 crossref_primary_10_4028_www_scientific_net_AMM_209_211_807 crossref_primary_10_1007_s10479_021_04299_3 crossref_primary_10_3390_app14156416 crossref_primary_10_1049_iet_its_2018_5289 crossref_primary_10_1016_j_trc_2015_05_012
Cites_doi	10.1016/S0377-2217(87)80007-3 10.1016/S0377-2217(96)00340-2 10.1023/A:1020707315345 10.1016/0965-8564(93)90012-A 10.1287/mnsc.41.4.713 10.1016/S0191-2615(98)00021-6 10.1016/S0377-2217(98)00395-6 10.1007/BF02060483 10.1023/A:1020715517162 10.1287/opre.44.6.923 10.1016/0377-2217(94)90245-3 10.1016/S0966-8349(96)00010-1 10.1016/S0377-2217(99)00370-7 10.1287/mnsc.47.10.1408.10258 10.3141/1662-01 10.1016/0377-2217(91)90090-I 10.1111/j.1538-4632.1986.tb00106.x 10.1016/0377-2217(94)90062-0 10.1016/S0966-8349(96)00017-4 10.1057/palgrave.jors.2601473 10.1016/S0305-0548(02)00052-7 10.1002/(SICI)1097-0037(199903)33:2<79::AID-NET1>3.0.CO;2-L 10.1016/S0167-8191(03)00042-5 10.1016/S0966-8349(96)00011-3 10.1287/mnsc.44.12.S235 10.1016/0377-2217(94)90318-2 10.1111/j.1435-5597.1986.tb00985.x 10.1287/trsc.29.3.201 10.1016/S0966-8349(98)00042-4 10.1023/A:1018994432663
ContentType	Journal Article
Copyright	2003 2005 INIST-CNRS Copyright Pergamon Press Inc. Jun 2005
Copyright_xml	– notice: 2003 – notice: 2005 INIST-CNRS – notice: Copyright Pergamon Press Inc. Jun 2005
DBID	AAYXX CITATION IQODW 7SC 8FD JQ2 L7M L~C L~D
DOI	10.1016/j.cor.2003.11.016
DatabaseName	CrossRef Pascal-Francis Computer and Information Systems Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional
DatabaseTitle	CrossRef Computer and Information Systems Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Advanced Technologies Database with Aerospace ProQuest Computer Science Collection Computer and Information Systems Abstracts Professional
DatabaseTitleList	Computer and Information Systems Abstracts Computer and Information Systems Abstracts
DeliveryMethod	fulltext_linktorsrc
Discipline	Engineering Computer Science Business Applied Sciences
EISSN	1873-765X 0305-0548
EndPage	1632
ExternalDocumentID	748244701 16429274 10_1016_j_cor_2003_11_016 S0305054803003617
Genre	Feature
GroupedDBID	--K --M -~X .DC .~1 0R~ 186 1B1 1OL 1RT 1~. 1~5 29F 4.4 457 4G. 5GY 5VS 6J9 7-5 71M 8P~ 9JN 9JO AAAKF AAAKG AABNK AACTN AAEDT AAEDW AAFJI AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AARIN AAXUO AAYFN AAYOK ABAOU ABBOA ABEFU ABFNM ABFRF ABJNI ABMAC ABMMH ABUCO ABXDB ABYKQ ACAZW ACDAQ ACGFO ACGFS ACNCT ACNNM ACRLP ACZNC ADBBV ADEZE ADGUI ADJOM ADMUD AEBSH AEFWE AEHXG AEKER AENEX AFFNX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHZHX AI. AIALX AIEXJ AIGVJ AIKHN AITUG AJBFU AJOXV AKYCK ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOMHK AOUOD APLSM ARUGR ASPBG AVARZ AVWKF AXJTR AZFZN BKOJK BKOMP BLXMC CS3 DU5 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 FDB FEDTE FGOYB FIRID FNPLU FYGXN G-Q G8K GBLVA GBOLZ HAMUX HVGLF HZ~ H~9 IHE J1W KOM LY1 M41 MHUIS MO0 MS~ O-L O9- OAUVE OZT P-8 P-9 P2P PC. PQQKQ PRBVW Q38 R2- RIG ROL RPZ RXW SDF SDG SDP SDS SES SEW SPC SPCBC SSB SSD SSO SSV SSW SSZ T5K TAE TN5 U5U UAO UPT VH1 WUQ XFK XPP ZMT ~02 ~G- 9DU AATTM AAXKI AAYWO AAYXX ABDPE ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS ~HD BNPGV IQODW SSH 7SC 8FD JQ2 L7M L~C L~D
ID	FETCH-LOGICAL-c383t-9131fa4fd9ed84b581717b99bf28d48e57b8323359680cea6c1f9a42c2e0b37a3
ISICitedReferencesCount	121
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000225907500012&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	0305-0548
IngestDate	Thu Oct 02 11:59:56 EDT 2025 Sun Nov 30 05:10:33 EST 2025 Wed Apr 02 07:22:49 EDT 2025 Sat Nov 29 03:23:30 EST 2025 Tue Nov 18 21:31:43 EST 2025 Fri Feb 23 02:33:35 EST 2024
IsPeerReviewed	true
IsScholarly	true
Issue	6
Keywords	Hub-and-spoke network design Non-linear integer programming Lagrangean relaxation Congestion Hub Non linear programming Traffic congestion
Language	English
License	https://www.elsevier.com/tdm/userlicense/1.0 CC BY 4.0
LinkModel	OpenURL
MergedId	FETCHMERGED-LOGICAL-c383t-9131fa4fd9ed84b581717b99bf28d48e57b8323359680cea6c1f9a42c2e0b37a3
Notes	SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 ObjectType-Article-2 content type line 23
PQID	195827716
PQPubID	45870
PageCount	18
ParticipantIDs	proquest_miscellaneous_29282045 proquest_journals_195827716 pascalfrancis_primary_16429274 crossref_primary_10_1016_j_cor_2003_11_016 crossref_citationtrail_10_1016_j_cor_2003_11_016 elsevier_sciencedirect_doi_10_1016_j_cor_2003_11_016
PublicationCentury	2000
PublicationDate	2005-06-01
PublicationDateYYYYMMDD	2005-06-01
PublicationDate_xml	– month: 06 year: 2005 text: 2005-06-01 day: 01
PublicationDecade	2000
PublicationPlace	Oxford
PublicationPlace_xml	– name: Oxford – name: New York
PublicationTitle	Computers & operations research
PublicationYear	2005
Publisher	Elsevier Ltd Elsevier Science Pergamon Press Inc
Publisher_xml	– name: Elsevier Ltd – name: Elsevier Science – name: Pergamon Press Inc
References	Campbell, Ernst, Krishnamoorthy (BIB30) 2002 Grove, O'Kelly (BIB31) 1986; 59 Campbell, Stiehr, Ernst, Krishnamoorthy (BIB36) 2003; 29 Klincewicz (BIB7) 1991; 53 O'Kelly (BIB5) 1987; 32 Kara, Tansel (BIB26) 2001; 47 Klincewicz (BIB17) 1996; 4 Ernst, Krishnamoorthy (BIB18) 1998; 104 Ernst, Krishnamoorthy (BIB11) 1996; 4 Pirkul, Schilling (BIB13) 1998; 44 Aykin (BIB23) 1995; 29 Aykin (BIB10) 1995; 29 Skorin-Kapov (BIB9) 1994; 73 Marianov, Serra (BIB32) 2003; 30 Gillen D, Levinson D. The full cost of air travel in the California corridor. Presented in the 78th Annual meeting of Transportation Research Board, Washington DC, Jan. 10–14, 1999. Klincewicz (BIB8) 1992; 40 Ernst, Krishnamoorthy (BIB20) 1999; 86 Campbell (BIB6) 1996; 44 Hamacher, Labbe, Nickel, Skriver (BIB29) 2002; 110 Ebery, Krishnamoorthy, Ernst, Bolanf (BIB21) 2000; 120 Ebery (BIB14) 2001; 128 O'Kelly (BIB4) 1986; 18 O'Kelly, Skorin-Kapov, Skorin-Kapov (BIB15) 1995; 41 Klincewicz (BIB3) 1998; 6 Kara, Tansel (BIB27) 2003; 54 Federal Aviation Administration. Airport Capacity and Delay (AC 150/5060-5). FAA, Washington DC, 1983. Aykin (BIB19) 1994; 79 Hamacher, Labbe, Nickel (BIB28) 1999; 33 Klincewicz (BIB25) 2002; 110 O'Kelly, Bryan (BIB24) 1998; 32 Toh, Higgins (BIB1) 1985; 24 de Palma A, Marchal F, From W. Vickrey to large-scale dynamic traffic models. Paper presented at the European Transport Conference, Loughborough University, UK, 1998. Kuby, Robert (BIB2) 1993; 27 Smith, Krishnamoorthy, Palaniswami (BIB12) 1996; 4 Campbell (BIB16) 1994; 72 Kuby, Gray (BIB22) 1993; 27 Campbell (10.1016/j.cor.2003.11.016_BIB6) 1996; 44 Ernst (10.1016/j.cor.2003.11.016_BIB20) 1999; 86 10.1016/j.cor.2003.11.016_BIB34 10.1016/j.cor.2003.11.016_BIB33 Kara (10.1016/j.cor.2003.11.016_BIB26) 2001; 47 Klincewicz (10.1016/j.cor.2003.11.016_BIB3) 1998; 6 10.1016/j.cor.2003.11.016_BIB35 Aykin (10.1016/j.cor.2003.11.016_BIB10) 1995; 29 Smith (10.1016/j.cor.2003.11.016_BIB12) 1996; 4 Marianov (10.1016/j.cor.2003.11.016_BIB32) 2003; 30 Kuby (10.1016/j.cor.2003.11.016_BIB22) 1993; 27 Klincewicz (10.1016/j.cor.2003.11.016_BIB7) 1991; 53 Kuby (10.1016/j.cor.2003.11.016_BIB2) 1993; 27 Aykin (10.1016/j.cor.2003.11.016_BIB23) 1995; 29 O'Kelly (10.1016/j.cor.2003.11.016_BIB4) 1986; 18 Kara (10.1016/j.cor.2003.11.016_BIB27) 2003; 54 Hamacher (10.1016/j.cor.2003.11.016_BIB29) 2002; 110 Pirkul (10.1016/j.cor.2003.11.016_BIB13) 1998; 44 Hamacher (10.1016/j.cor.2003.11.016_BIB28) 1999; 33 Klincewicz (10.1016/j.cor.2003.11.016_BIB25) 2002; 110 O'Kelly (10.1016/j.cor.2003.11.016_BIB15) 1995; 41 Campbell (10.1016/j.cor.2003.11.016_BIB30) 2002 Klincewicz (10.1016/j.cor.2003.11.016_BIB8) 1992; 40 Ebery (10.1016/j.cor.2003.11.016_BIB21) 2000; 120 Toh (10.1016/j.cor.2003.11.016_BIB1) 1985; 24 Campbell (10.1016/j.cor.2003.11.016_BIB16) 1994; 72 Klincewicz (10.1016/j.cor.2003.11.016_BIB17) 1996; 4 Ernst (10.1016/j.cor.2003.11.016_BIB11) 1996; 4 O'Kelly (10.1016/j.cor.2003.11.016_BIB24) 1998; 32 Campbell (10.1016/j.cor.2003.11.016_BIB36) 2003; 29 O'Kelly (10.1016/j.cor.2003.11.016_BIB5) 1987; 32 Skorin-Kapov (10.1016/j.cor.2003.11.016_BIB9) 1994; 73 Aykin (10.1016/j.cor.2003.11.016_BIB19) 1994; 79 Ernst (10.1016/j.cor.2003.11.016_BIB18) 1998; 104 Grove (10.1016/j.cor.2003.11.016_BIB31) 1986; 59 Ebery (10.1016/j.cor.2003.11.016_BIB14) 2001; 128
References_xml	– volume: 40 start-page: 283 year: 1992 end-page: 302 ident: BIB8 article-title: Avoiding local optima in the p-hub location problem using tabu search and grasp publication-title: Annals of Operations Research – volume: 54 start-page: 59 year: 2003 end-page: 64 ident: BIB27 article-title: The single-assignment hub covering problem publication-title: Journal of the Operational Research Society – volume: 24 start-page: 16 year: 1985 end-page: 27 ident: BIB1 article-title: The impact of hub-and-spoke network centralization and route monopoly on domestic airline profitability publication-title: Transportation Journal – volume: 104 start-page: 100 year: 1998 end-page: 112 ident: BIB18 article-title: Exact and heuristic algorithms for the uncapacitated multiple allocation p-hub median problem publication-title: European Journal of Operational Research – volume: 73 start-page: 502 year: 1994 end-page: 509 ident: BIB9 article-title: On tabu search for the location of interacting hub facilities publication-title: European Journal of Operational Research – volume: 128 start-page: 447 year: 2001 end-page: 458 ident: BIB14 article-title: Solving large single allocation p-hub problems with two or three hubs publication-title: European Journal of Operational Research – volume: 18 start-page: 343 year: 1986 end-page: 356 ident: BIB4 article-title: Activity levels at hub facilities in interacting networks publication-title: Geographical Analysis – volume: 29 start-page: 201 year: 1995 end-page: 221 ident: BIB10 article-title: Networking policies for hub-and-spoke systems with applications to the air transportation system publication-title: Transportation Science – volume: 32 start-page: 393 year: 1987 end-page: 404 ident: BIB5 article-title: A quadratic integer program for the location of interacting hub facilities publication-title: European Journal of Operational Research – volume: 4 start-page: 139 year: 1996 end-page: 154 ident: BIB11 article-title: Efficient algorithms for the uncapacitated single allocation p-hub median problem publication-title: Location Science – volume: 29 start-page: 201 year: 1995 end-page: 221 ident: BIB23 article-title: Networking policies for hub-and-spoke systems with applications to the air transportation system publication-title: Transportation Science – volume: 6 start-page: 307 year: 1998 end-page: 335 ident: BIB3 article-title: Hub location in backbone/tributary network design publication-title: Location Science – volume: 53 start-page: 25 year: 1991 end-page: 37 ident: BIB7 article-title: Heuristics for the p-hub location problem publication-title: European Journal of Operational Research – volume: 27 start-page: 1 year: 1993 end-page: 12 ident: BIB22 article-title: The hub network design problem with stopovers and feeders—the case of federal express publication-title: Transportation Research, Part A—Policy and Practice – volume: 44 start-page: 235 year: 1998 end-page: 242 ident: BIB13 article-title: An efficient procedure for designing single allocation hub-and-spoke networks publication-title: Management Sciences – volume: 59 start-page: 103 year: 1986 end-page: 119 ident: BIB31 article-title: Hub networks and simulated schedule delay publication-title: Papers of the Regional Science Association – volume: 120 start-page: 614 year: 2000 end-page: 631 ident: BIB21 article-title: The capacitated multiple allocation hub location problem publication-title: European Journal of Operational Research – volume: 4 start-page: 155 year: 1996 end-page: 171 ident: BIB12 article-title: Neural versus traditional approaches to the location of interacting hub facilities publication-title: Location Science – volume: 29 start-page: 555 year: 2003 end-page: 574 ident: BIB36 article-title: Solving hub arc location problems on a cluster of workstations publication-title: Parallel Computing – volume: 79 start-page: 501 year: 1994 end-page: 523 ident: BIB19 article-title: Lagrangian relaxation based approaches to capacitated hub-and-spoke network design problem publication-title: European Journal of Operational Research – volume: 27 start-page: 1 year: 1993 end-page: 12 ident: BIB2 article-title: The hub network design problem with stopovers and feeders publication-title: Transportation Research A – volume: 110 start-page: 33 year: 2002 end-page: 53 ident: BIB29 article-title: Multicriteria semi-obnoxious network location problems (MSNLP) with sum and center objectives publication-title: Annals of Operations Research – volume: 110 start-page: 107 year: 2002 end-page: 122 ident: BIB25 article-title: Enumeration and search procedures for a hub location problem with economies of scale publication-title: Annals of Operations Research – reference: Federal Aviation Administration. Airport Capacity and Delay (AC 150/5060-5). FAA, Washington DC, 1983. – reference: de Palma A, Marchal F, From W. Vickrey to large-scale dynamic traffic models. Paper presented at the European Transport Conference, Loughborough University, UK, 1998. – volume: 41 start-page: 713 year: 1995 end-page: 721 ident: BIB15 article-title: Lower bounds for the hub location problem publication-title: Management Science – volume: 72 start-page: 387 year: 1994 end-page: 405 ident: BIB16 article-title: Integer programming formulations of discrete hub location problems publication-title: European Journal of Operational Research – volume: 30 start-page: 983 year: 2003 end-page: 1003 ident: BIB32 article-title: Location models for airline hubs behaving as M/D/c queues publication-title: Computers and Operations Research – reference: Gillen D, Levinson D. The full cost of air travel in the California corridor. Presented in the 78th Annual meeting of Transportation Research Board, Washington DC, Jan. 10–14, 1999. – volume: 86 start-page: 141 year: 1999 end-page: 159 ident: BIB20 article-title: Solution algorithms for the capacitated single allocation hub location problem publication-title: Annals of Operations Research – volume: 33 start-page: 79 year: 1999 end-page: 92 ident: BIB28 article-title: Multicriteria network location problems with sum objectives publication-title: Networks – volume: 32 start-page: 605 year: 1998 end-page: 616 ident: BIB24 article-title: Hub Location with Flow Economies of Scale publication-title: Transportation Research B – volume: 44 start-page: 923 year: 1996 end-page: 935 ident: BIB6 article-title: Hub location and the p-Hub median problem publication-title: Operations Research – volume: 4 start-page: 173 year: 1996 end-page: 184 ident: BIB17 article-title: A dual algorithm for the uncapacitated hub location problem publication-title: Location Science – volume: 47 start-page: 1408 year: 2001 end-page: 1420 ident: BIB26 article-title: The latest arrival hub location problem publication-title: Management Science – start-page: 373 year: 2002 end-page: 408 ident: BIB30 article-title: Hub location problems publication-title: Facility location: applications and theory – volume: 32 start-page: 393 year: 1987 ident: 10.1016/j.cor.2003.11.016_BIB5 article-title: A quadratic integer program for the location of interacting hub facilities publication-title: European Journal of Operational Research doi: 10.1016/S0377-2217(87)80007-3 – volume: 104 start-page: 100 year: 1998 ident: 10.1016/j.cor.2003.11.016_BIB18 article-title: Exact and heuristic algorithms for the uncapacitated multiple allocation p-hub median problem publication-title: European Journal of Operational Research doi: 10.1016/S0377-2217(96)00340-2 – volume: 110 start-page: 33 year: 2002 ident: 10.1016/j.cor.2003.11.016_BIB29 article-title: Multicriteria semi-obnoxious network location problems (MSNLP) with sum and center objectives publication-title: Annals of Operations Research doi: 10.1023/A:1020707315345 – volume: 27 start-page: 1 year: 1993 ident: 10.1016/j.cor.2003.11.016_BIB22 article-title: The hub network design problem with stopovers and feeders—the case of federal express publication-title: Transportation Research, Part A—Policy and Practice doi: 10.1016/0965-8564(93)90012-A – volume: 41 start-page: 713 year: 1995 ident: 10.1016/j.cor.2003.11.016_BIB15 article-title: Lower bounds for the hub location problem publication-title: Management Science doi: 10.1287/mnsc.41.4.713 – volume: 32 start-page: 605 issue: 8 year: 1998 ident: 10.1016/j.cor.2003.11.016_BIB24 article-title: Hub Location with Flow Economies of Scale publication-title: Transportation Research B doi: 10.1016/S0191-2615(98)00021-6 – volume: 120 start-page: 614 year: 2000 ident: 10.1016/j.cor.2003.11.016_BIB21 article-title: The capacitated multiple allocation hub location problem publication-title: European Journal of Operational Research doi: 10.1016/S0377-2217(98)00395-6 – volume: 40 start-page: 283 year: 1992 ident: 10.1016/j.cor.2003.11.016_BIB8 article-title: Avoiding local optima in the p-hub location problem using tabu search and grasp publication-title: Annals of Operations Research doi: 10.1007/BF02060483 – volume: 110 start-page: 107 year: 2002 ident: 10.1016/j.cor.2003.11.016_BIB25 article-title: Enumeration and search procedures for a hub location problem with economies of scale publication-title: Annals of Operations Research doi: 10.1023/A:1020715517162 – ident: 10.1016/j.cor.2003.11.016_BIB35 – volume: 44 start-page: 923 year: 1996 ident: 10.1016/j.cor.2003.11.016_BIB6 article-title: Hub location and the p-Hub median problem publication-title: Operations Research doi: 10.1287/opre.44.6.923 – volume: 73 start-page: 502 year: 1994 ident: 10.1016/j.cor.2003.11.016_BIB9 article-title: On tabu search for the location of interacting hub facilities publication-title: European Journal of Operational Research doi: 10.1016/0377-2217(94)90245-3 – volume: 4 start-page: 173 year: 1996 ident: 10.1016/j.cor.2003.11.016_BIB17 article-title: A dual algorithm for the uncapacitated hub location problem publication-title: Location Science doi: 10.1016/S0966-8349(96)00010-1 – ident: 10.1016/j.cor.2003.11.016_BIB33 – volume: 128 start-page: 447 year: 2001 ident: 10.1016/j.cor.2003.11.016_BIB14 article-title: Solving large single allocation p-hub problems with two or three hubs publication-title: European Journal of Operational Research doi: 10.1016/S0377-2217(99)00370-7 – volume: 47 start-page: 1408 year: 2001 ident: 10.1016/j.cor.2003.11.016_BIB26 article-title: The latest arrival hub location problem publication-title: Management Science doi: 10.1287/mnsc.47.10.1408.10258 – ident: 10.1016/j.cor.2003.11.016_BIB34 doi: 10.3141/1662-01 – volume: 53 start-page: 25 year: 1991 ident: 10.1016/j.cor.2003.11.016_BIB7 article-title: Heuristics for the p-hub location problem publication-title: European Journal of Operational Research doi: 10.1016/0377-2217(91)90090-I – volume: 18 start-page: 343 year: 1986 ident: 10.1016/j.cor.2003.11.016_BIB4 article-title: Activity levels at hub facilities in interacting networks publication-title: Geographical Analysis doi: 10.1111/j.1538-4632.1986.tb00106.x – volume: 24 start-page: 16 year: 1985 ident: 10.1016/j.cor.2003.11.016_BIB1 article-title: The impact of hub-and-spoke network centralization and route monopoly on domestic airline profitability publication-title: Transportation Journal – volume: 79 start-page: 501 year: 1994 ident: 10.1016/j.cor.2003.11.016_BIB19 article-title: Lagrangian relaxation based approaches to capacitated hub-and-spoke network design problem publication-title: European Journal of Operational Research doi: 10.1016/0377-2217(94)90062-0 – volume: 4 start-page: 155 year: 1996 ident: 10.1016/j.cor.2003.11.016_BIB12 article-title: Neural versus traditional approaches to the location of interacting hub facilities publication-title: Location Science doi: 10.1016/S0966-8349(96)00017-4 – volume: 54 start-page: 59 year: 2003 ident: 10.1016/j.cor.2003.11.016_BIB27 article-title: The single-assignment hub covering problem publication-title: Journal of the Operational Research Society doi: 10.1057/palgrave.jors.2601473 – volume: 30 start-page: 983 year: 2003 ident: 10.1016/j.cor.2003.11.016_BIB32 article-title: Location models for airline hubs behaving as M/D/c queues publication-title: Computers and Operations Research doi: 10.1016/S0305-0548(02)00052-7 – volume: 27 start-page: 1 year: 1993 ident: 10.1016/j.cor.2003.11.016_BIB2 article-title: The hub network design problem with stopovers and feeders publication-title: Transportation Research A – volume: 33 start-page: 79 year: 1999 ident: 10.1016/j.cor.2003.11.016_BIB28 article-title: Multicriteria network location problems with sum objectives publication-title: Networks doi: 10.1002/(SICI)1097-0037(199903)33:2<79::AID-NET1>3.0.CO;2-L – volume: 29 start-page: 555 year: 2003 ident: 10.1016/j.cor.2003.11.016_BIB36 article-title: Solving hub arc location problems on a cluster of workstations publication-title: Parallel Computing doi: 10.1016/S0167-8191(03)00042-5 – volume: 4 start-page: 139 year: 1996 ident: 10.1016/j.cor.2003.11.016_BIB11 article-title: Efficient algorithms for the uncapacitated single allocation p-hub median problem publication-title: Location Science doi: 10.1016/S0966-8349(96)00011-3 – volume: 44 start-page: 235 issue: 12 year: 1998 ident: 10.1016/j.cor.2003.11.016_BIB13 article-title: An efficient procedure for designing single allocation hub-and-spoke networks publication-title: Management Sciences doi: 10.1287/mnsc.44.12.S235 – volume: 72 start-page: 387 year: 1994 ident: 10.1016/j.cor.2003.11.016_BIB16 article-title: Integer programming formulations of discrete hub location problems publication-title: European Journal of Operational Research doi: 10.1016/0377-2217(94)90318-2 – volume: 59 start-page: 103 year: 1986 ident: 10.1016/j.cor.2003.11.016_BIB31 article-title: Hub networks and simulated schedule delay publication-title: Papers of the Regional Science Association doi: 10.1111/j.1435-5597.1986.tb00985.x – volume: 29 start-page: 201 year: 1995 ident: 10.1016/j.cor.2003.11.016_BIB10 article-title: Networking policies for hub-and-spoke systems with applications to the air transportation system publication-title: Transportation Science doi: 10.1287/trsc.29.3.201 – volume: 6 start-page: 307 year: 1998 ident: 10.1016/j.cor.2003.11.016_BIB3 article-title: Hub location in backbone/tributary network design publication-title: Location Science doi: 10.1016/S0966-8349(98)00042-4 – volume: 86 start-page: 141 year: 1999 ident: 10.1016/j.cor.2003.11.016_BIB20 article-title: Solution algorithms for the capacitated single allocation hub location problem publication-title: Annals of Operations Research doi: 10.1023/A:1018994432663 – volume: 29 start-page: 201 year: 1995 ident: 10.1016/j.cor.2003.11.016_BIB23 article-title: Networking policies for hub-and-spoke systems with applications to the air transportation system publication-title: Transportation Science doi: 10.1287/trsc.29.3.201 – start-page: 373 year: 2002 ident: 10.1016/j.cor.2003.11.016_BIB30 article-title: Hub location problems
SSID	ssj0000721
Score	2.1602957
Snippet	We consider a hub-and-spoke network design problem with congestion. The model we propose extends current models by taking congestion effects into account. This...
SourceID	proquest pascalfrancis crossref elsevier
SourceType	Aggregation Database Index Database Enrichment Source Publisher
StartPage	1615
SubjectTerms	Applied sciences Congestion Design Exact sciences and technology Hub-and-spoke network design Integer programming Lagrangean relaxation Mathematical programming Network topologies Non-linear integer programming Nonlinear programming Operational research and scientific management Operational research. Management science Studies
Title	Hub-and-spoke network design with congestion
URI	https://dx.doi.org/10.1016/j.cor.2003.11.016 https://www.proquest.com/docview/195827716 https://www.proquest.com/docview/29282045
Volume	32
WOSCitedRecordID	wos000225907500012&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText	1
inHoldings	1
isFullTextHit
isPrint
journalDatabaseRights	– providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 customDbUrl: eissn: 1873-765X dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000721 issn: 0305-0548 databaseCode: AIEXJ dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3db9MwELdKh9AQ4qNjogxGHniiZEriJLYfJ1Q09jAhbUh9i_wVrVtJq6ad9udzju2kKzABEi9p5caJ69_57ny-D4Te44TyCCdxmAlZhmkS45AqWHhK4DJiXGZYlk2xCXJ2RicT9rXXO_WxMDczUlX09pYt_ivU0AZgm9DZv4C7fSg0wHcAHa4AO1z_CPiTtQh5pULYr17rUWXdvEeq8dRoPc3NqZJHxOcpcPUd6oYa5gu9dF5yLh9Qazcezy61urRh1ef8-3TZkYZXha9HkykHturEorcqZJ33kzV1-XCXzreoCbEyN2Y2NeaRthyTEhySPJtsstTOZLnFH41-uSFrQRlMfsnHrUnhCmCwOVuPTKbVeCtndiOFz82gzJjgE6RxTB6gnYRkjPbRzvGX8eS0k8ukicJr_4Q_4268_bZe9Dst5cmC17B2Slv05Cf53SglF8_RU7ebCI4tFbxAPV0N0CMfzDBAzzyogePhA_R4IwPlHvp4h1oCRy2BpZbAUEvQUctL9O3z-OLTSegKaIQSU7wyXhVxydNSMa1oKjIaw-ZdMCbKhKqU6owIYOgYZyynkdQ8l3HJeJrIREcCE473Ub-aV_oVCnhChRIygg5xqhjmDKaRRCJNhcnAlw9R5CeskC67vClyMiu8G-FVAXNsqp5i2HUW0DJEH9ouC5ta5b6bU49C4XRDq_MVQDL3dTu8g1j3otzUaSPpEB14CAu3iOvCJGBKCDHd37W_Ats1Z2m80vN1XUBnaio5vP63cR2g3W7VvUH91XKt36KH8mY1rZeHjnJ_AB1jpKc
linkProvider	Elsevier
openUrl	ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Hub-and-spoke+network+design+with+congestion&rft.jtitle=Computers+%26+operations+research&rft.au=Elhedhli%2C+Samir&rft.au=Hu%2C+Frank+Xiaolong&rft.date=2005-06-01&rft.pub=Elsevier+Ltd&rft.issn=0305-0548&rft.eissn=1873-765X&rft.volume=32&rft.issue=6&rft.spage=1615&rft.epage=1632&rft_id=info:doi/10.1016%2Fj.cor.2003.11.016&rft.externalDocID=S0305054803003617
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0305-0548&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0305-0548&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0305-0548&client=summon