Exact algorithms for the robust uncapacitated multiple allocation p-hub median problem
This paper addresses the robust uncapacitated multiple allocation p -hub median problem where the demand traffic between origin-destination pairs are subject to uncertainty. The employed robust optimization approach adjusts the level of conservatism by using a parameter called the budget of uncertai...
Uloženo v:
| Vydáno v: | Optimization letters Ročník 16; číslo 6; s. 1745 - 1772 |
|---|---|
| Hlavní autor: | |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Berlin/Heidelberg
Springer Berlin Heidelberg
01.07.2022
|
| Témata: | |
| ISSN: | 1862-4472, 1862-4480 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | This paper addresses the robust uncapacitated multiple allocation
p
-hub median problem where the demand traffic between origin-destination pairs are subject to uncertainty. The employed robust optimization approach adjusts the level of conservatism by using a parameter called the
budget of uncertainty
. A mixed-integer programming linear formulation is proposed for the problem and two exact solution procedures based on Benders decomposition are developed to solve large-scale instances of the problem. Extensive computational experiments are conducted to study the effect of incorporating uncertainty into the problem and to evaluate the performance of the proposed mathematical models as well as the solution algorithms. |
|---|---|
| AbstractList | This paper addresses the robust uncapacitated multiple allocation
p
-hub median problem where the demand traffic between origin-destination pairs are subject to uncertainty. The employed robust optimization approach adjusts the level of conservatism by using a parameter called the
budget of uncertainty
. A mixed-integer programming linear formulation is proposed for the problem and two exact solution procedures based on Benders decomposition are developed to solve large-scale instances of the problem. Extensive computational experiments are conducted to study the effect of incorporating uncertainty into the problem and to evaluate the performance of the proposed mathematical models as well as the solution algorithms. |
| Author | Ghaffarinasab, Nader |
| Author_xml | – sequence: 1 givenname: Nader orcidid: 0000-0003-4363-1112 surname: Ghaffarinasab fullname: Ghaffarinasab, Nader email: ngnasab@tabrizu.ac.ir organization: Department of Industrial Engineering, University of Tabriz |
| BookMark | eNp9kE1PAyEQhompiW31D3jiD6DAfrAcTVM_kiZe1CsBFtpt2GUDbKr_XmyNBw89zUwyz-SdZwFmgx8MALcE3xGM2X0kpOIYYUoQJoxzdLgAc9LUFJVlg2d_PaNXYBHjHuOaEM7n4GP9KXWC0m196NKuj9D6ANPOwODVFBOcBi1Hqbskk2lhP7nUjc5kwHktU-cHOKLdpGBv2k7mIWPO9Nfg0koXzc1vXYL3x_Xb6hltXp9eVg8bpCknCXFWt5pVpcUtYzWvbIMlrxS1vNRYl0oSaQuqtDWNqtqqUNYoZmmBeSXbwshiCZrTXR18jMFYcUyaY6UgOycIFj9-xMmPyH7E0Y84ZJT-Q8fQ9TJ8nYeKExTz8rA1Qez9FIb84jnqGwL3fcg |
| CitedBy_id | crossref_primary_10_1016_j_trb_2022_11_008 crossref_primary_10_47880_inf2802_02 crossref_primary_10_1016_j_jairtraman_2025_102794 crossref_primary_10_1016_j_cor_2024_106882 crossref_primary_10_1016_j_jairtraman_2025_102747 crossref_primary_10_1155_2024_5754231 crossref_primary_10_1371_journal_pone_0297295 crossref_primary_10_1007_s10479_024_06322_9 crossref_primary_10_1016_j_ejor_2023_07_015 |
| Cites_doi | 10.1016/j.apm.2013.02.035 10.1007/s00170-014-6330-5 10.5267/j.dsl.2019.12.001 10.1016/S0305-0548(02)00052-7 10.1007/s11590-014-0814-y 10.1016/j.apm.2019.04.056 10.1016/S0966-8349(96)00011-3 10.1007/s11067-018-9424-z 10.1016/j.ejor.2007.06.008 10.1016/j.cor.2006.07.002 10.1287/opre.1110.0965 10.1016/j.ejor.2017.11.035 10.1016/j.ejor.2012.10.051 10.1287/trsc.1080.0233 10.1016/j.trb.2011.11.006 10.1016/j.eswa.2017.10.005 10.1007/s11590-014-0798-7 10.1016/j.ejor.2011.02.018 10.1016/j.ejor.2020.09.039 10.1007/s10107-003-0396-4 10.1016/j.cie.2017.06.017 10.1287/trsc.1120.0410 10.1002/net.20139 10.1016/j.cor.2017.08.001 10.1016/j.tre.2014.08.003 10.1016/j.cor.2018.04.021 10.1504/EJIE.2015.068648 10.1287/trsc.2020.1003 10.1016/j.tre.2011.04.009 10.1016/j.cor.2008.11.020 10.1016/j.trb.2017.06.008 10.1016/j.ejor.2017.11.058 10.1016/S0377-2217(87)80007-3 10.1287/trsc.2014.0576 10.1007/s11590-006-0030-5 10.1016/j.trb.2016.01.010 10.1007/BF01386316 |
| ContentType | Journal Article |
| Copyright | The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2021 |
| Copyright_xml | – notice: The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2021 |
| DBID | AAYXX CITATION |
| DOI | 10.1007/s11590-021-01799-w |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Mathematics |
| EISSN | 1862-4480 |
| EndPage | 1772 |
| ExternalDocumentID | 10_1007_s11590_021_01799_w |
| GroupedDBID | -5D -5G -BR -EM -Y2 -~C .VR 06D 0R~ 0VY 123 1N0 203 2J2 2JN 2JY 2KG 2KM 2LR 2VQ 2~H 30V 4.4 406 408 409 40D 40E 5VS 67Z 6NX 8TC 8UJ 95- 95. 95~ 96X AAAVM AABHQ AACDK AAHNG AAIAL AAJBT AAJKR AANZL AARHV AARTL AASML AATNV AATVU AAUYE AAWCG AAYIU AAYQN AAYTO AAYZH ABAKF ABBXA ABDZT ABECU ABFTV ABHQN ABJNI ABJOX ABKCH ABMNI ABMQK ABNWP ABQBU ABSXP ABTEG ABTHY ABTKH ABTMW ABULA ABWNU ABXPI ACAOD ACBXY ACDTI ACGFS ACHSB ACHXU ACKNC ACMDZ ACMLO ACOKC ACOMO ACPIV ACSNA ACZOJ ADHHG ADHIR ADINQ ADKNI ADKPE ADRFC ADTPH ADURQ ADYFF ADZKW AEBTG AEFQL AEGAL AEGNC AEJHL AEJRE AEMSY AENEX AEOHA AEPYU AESKC AETLH AEVLU AEXYK AFBBN AFGCZ AFLOW AFQWF AFWTZ AFZKB AGAYW AGDGC AGJBK AGMZJ AGQEE AGQMX AGRTI AGWIL AGWZB AGYKE AHAVH AHBYD AHKAY AHSBF AHYZX AIAKS AIGIU AIIXL AILAN AITGF AJBLW AJRNO AJZVZ ALMA_UNASSIGNED_HOLDINGS ALWAN AMKLP AMXSW AMYLF AMYQR AOCGG ARMRJ AXYYD AYJHY B-. BA0 BAPOH BDATZ BGNMA BSONS CAG COF CS3 CSCUP DDRTE DNIVK DPUIP DU5 EBLON EBS EIOEI EJD ESBYG FERAY FFXSO FIGPU FINBP FNLPD FRRFC FSGXE FWDCC GGCAI GGRSB GJIRD GNWQR GQ6 GQ7 GQ8 GXS H13 HF~ HG5 HG6 HLICF HMJXF HQYDN HRMNR HZ~ IJ- IKXTQ IWAJR IXC IXD IXE IZIGR IZQ I~X I~Z J-C J0Z J9A JBSCW JCJTX JZLTJ KDC KOV LLZTM M4Y MA- N9A NPVJJ NQJWS NU0 O9- O93 O9J OAM P2P P9M PF0 PT4 QOS R89 R9I ROL RPX RSV S16 S1Z S27 S3B SAP SDH SHX SISQX SJYHP SMT SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE SZN T13 TSG TSK TSV TUC U2A UG4 UOJIU UTJUX UZXMN VC2 VFIZW W23 W48 WK8 YLTOR Z45 Z7R Z7Y Z83 Z88 ZMTXR ~A9 AAPKM AAYXX ABBRH ABDBE ABFSG ABRTQ ACSTC AEZWR AFDZB AFHIU AFOHR AHPBZ AHWEU AIXLP ATHPR AYFIA CITATION |
| ID | FETCH-LOGICAL-c291t-976dc754f0d77695f80a95b2f94c0c4ba1af32bcfe8b5d53bfeb7f23095ad3ea3 |
| IEDL.DBID | RSV |
| ISICitedReferencesCount | 11 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000692617900001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 1862-4472 |
| IngestDate | Tue Nov 18 22:04:09 EST 2025 Sat Nov 29 02:44:12 EST 2025 Fri Feb 21 02:49:21 EST 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 6 |
| Keywords | Robust optimization Benders decomposition Hub location Demand uncertainty |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c291t-976dc754f0d77695f80a95b2f94c0c4ba1af32bcfe8b5d53bfeb7f23095ad3ea3 |
| ORCID | 0000-0003-4363-1112 |
| PageCount | 28 |
| ParticipantIDs | crossref_citationtrail_10_1007_s11590_021_01799_w crossref_primary_10_1007_s11590_021_01799_w springer_journals_10_1007_s11590_021_01799_w |
| PublicationCentury | 2000 |
| PublicationDate | 2022-07-01 |
| PublicationDateYYYYMMDD | 2022-07-01 |
| PublicationDate_xml | – month: 07 year: 2022 text: 2022-07-01 day: 01 |
| PublicationDecade | 2020 |
| PublicationPlace | Berlin/Heidelberg |
| PublicationPlace_xml | – name: Berlin/Heidelberg |
| PublicationTitle | Optimization letters |
| PublicationTitleAbbrev | Optim Lett |
| PublicationYear | 2022 |
| Publisher | Springer Berlin Heidelberg |
| Publisher_xml | – name: Springer Berlin Heidelberg |
| References | Contreras, Cordeau, Laporte (CR8) 2011; 59 Marianov, Serra (CR29) 2003; 30 Taherkhani, Alumur, Hosseini (CR35) 2020; 54 Ghaffari-Nasab, Ghazanfari, Saboury, Fathollah (CR24) 2015; 9 Ghaffari-Nasab, Ghazanfari, Teimoury (CR25) 2015; 76 Huang, Zheng (CR28) 2015; 9 Benders (CR4) 1962; 4 Campbell, O’Kelly (CR6) 2012; 46 Ghaffarinasab, Motallebzadeh (CR23) 2018; 267 Gelareh, Nickel (CR18) 2011; 47 Contreras, Cordeau, Laporte (CR9) 2011; 212 Alumur, Campbell, Contreras, Kara, Marianov, O’Kelly (CR3) 2021; 291 Meraklı, Yaman (CR30) 2016; 86 Zetina, Contreras, Cordeau, Nikbakhsh (CR39) 2017; 106 Ghaffarinasab (CR20) 2020; 9 de Sá, Contreras, Cordeau, de Camargo, de Miranda (CR14) 2015; 49 Talbi, Todosijević (CR36) 2017; 110 Ghaffarinasab, Zare Andaryan, Ebadi Torkayesh (CR26) 2020; 15 Squires, Hoffman (CR34) 2015; 9 Haouari, Mrad, Sherali (CR27) 2007; 1 Ghaffarinasab, Atayi (CR21) 2018; 267 Ghaffarinasab (CR19) 2018; 97 Tan, Kara (CR37) 2007; 49 de Sá, de Camargo, de Miranda (CR13) 2013; 226 Yin, Chen, Song, Liu (CR38) 2019; 74 de Sá, Morabito, de Camargo (CR15) 2018; 89 Chaharsooghi, Momayezi, Ghaffarinasab (CR7) 2017; 8 de Camargo, Miranda, Luna (CR10) 2008; 35 Bertsimas, Sim (CR5) 2003; 98 de Sá, Morabito, de Camargo (CR16) 2018; 93 Ernst, Krishnamoorthy (CR17) 1996; 4 Ghaffarinasab, Kara (CR22) 2019; 19 O’Kelly (CR31) 1987; 32 Alumur, Kara (CR1) 2008; 190 Alumur, Nickel, da Gama (CR2) 2012; 46 Shahabi, Unnikrishnan (CR32) 2014; 70 de Camargo, de Miranda, Løkketangen (CR12) 2013; 37 Sim, Lowe, Thomas (CR33) 2009; 36 de Camargo, Miranda, Luna (CR11) 2009; 43 S Alumur (1799_CR1) 2008; 190 RS de Camargo (1799_CR12) 2013; 37 EM de Sá (1799_CR16) 2018; 93 F Yin (1799_CR38) 2019; 74 JF Benders (1799_CR4) 1962; 4 SA Alumur (1799_CR3) 2021; 291 S Chaharsooghi (1799_CR7) 2017; 8 RS de Camargo (1799_CR11) 2009; 43 JF Campbell (1799_CR6) 2012; 46 S Gelareh (1799_CR18) 2011; 47 M Meraklı (1799_CR30) 2016; 86 N Ghaffari-Nasab (1799_CR24) 2015; 9 AT Ernst (1799_CR17) 1996; 4 PZ Tan (1799_CR37) 2007; 49 N Ghaffarinasab (1799_CR20) 2020; 9 N Ghaffari-Nasab (1799_CR25) 2015; 76 I Contreras (1799_CR8) 2011; 59 EM de Sá (1799_CR15) 2018; 89 N Ghaffarinasab (1799_CR22) 2019; 19 EM de Sá (1799_CR13) 2013; 226 T Sim (1799_CR33) 2009; 36 N Ghaffarinasab (1799_CR23) 2018; 267 RS de Camargo (1799_CR10) 2008; 35 CA Zetina (1799_CR39) 2017; 106 M Haouari (1799_CR27) 2007; 1 Z Huang (1799_CR28) 2015; 9 EM de Sá (1799_CR14) 2015; 49 ME O’Kelly (1799_CR31) 1987; 32 N Ghaffarinasab (1799_CR26) 2020; 15 M Shahabi (1799_CR32) 2014; 70 SA Alumur (1799_CR2) 2012; 46 G Taherkhani (1799_CR35) 2020; 54 I Contreras (1799_CR9) 2011; 212 N Ghaffarinasab (1799_CR21) 2018; 267 RR Squires (1799_CR34) 2015; 9 N Ghaffarinasab (1799_CR19) 2018; 97 EG Talbi (1799_CR36) 2017; 110 D Bertsimas (1799_CR5) 2003; 98 V Marianov (1799_CR29) 2003; 30 |
| References_xml | – volume: 37 start-page: 7465 issue: 12–13 year: 2013 end-page: 7480 ident: CR12 article-title: A new formulation and an exact approach for the many-to-many hub location-routing problem publication-title: Appl. Math. Model. doi: 10.1016/j.apm.2013.02.035 – volume: 76 start-page: 1091 issue: 5–8 year: 2015 end-page: 1110 ident: CR25 article-title: Robust optimization approach to the design of hub-and-spoke networks publication-title: Int. J. Adv. Manufact. Technol. doi: 10.1007/s00170-014-6330-5 – volume: 9 start-page: 181 issue: 2 year: 2020 end-page: 192 ident: CR20 article-title: A highly efficient exact algorithm for the uncapacitated multiple allocation p-hub center problem publication-title: Decis. Sci. Lett. doi: 10.5267/j.dsl.2019.12.001 – volume: 30 start-page: 983 issue: 7 year: 2003 end-page: 1003 ident: CR29 article-title: Location models for airline hubs behaving as m/d/c queues publication-title: Comput. Oper. Res. doi: 10.1016/S0305-0548(02)00052-7 – volume: 9 start-page: 1675 issue: 8 year: 2015 end-page: 1688 ident: CR34 article-title: A military maintenance planning and scheduling problem publication-title: Optim. Lett. doi: 10.1007/s11590-014-0814-y – volume: 74 start-page: 668 year: 2019 end-page: 693 ident: CR38 article-title: A new distributionally robust -hub median problem with uncertain carbon emissions and its tractable approximation method publication-title: Appl. Math. Model. doi: 10.1016/j.apm.2019.04.056 – volume: 4 start-page: 139 issue: 3 year: 1996 end-page: 154 ident: CR17 article-title: Efficient algorithms for the uncapacitated single allocation -hub median problem publication-title: Locat. Sci. doi: 10.1016/S0966-8349(96)00011-3 – volume: 19 start-page: 83 issue: 1 year: 2019 end-page: 108 ident: CR22 article-title: Benders decomposition algorithms for two variants of the single allocation hub location problem publication-title: Netw. Spat. Econ. doi: 10.1007/s11067-018-9424-z – volume: 190 start-page: 1 issue: 1 year: 2008 end-page: 21 ident: CR1 article-title: Network hub location problems: the state of the art publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2007.06.008 – volume: 35 start-page: 1047 issue: 4 year: 2008 end-page: 1064 ident: CR10 article-title: Benders decomposition for the uncapacitated multiple allocation hub location problem publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2006.07.002 – volume: 59 start-page: 1477 issue: 6 year: 2011 end-page: 1490 ident: CR8 article-title: Benders decomposition for large-scale uncapacitated hub location publication-title: Oper. Res. doi: 10.1287/opre.1110.0965 – volume: 267 start-page: 23 issue: 1 year: 2018 end-page: 39 ident: CR21 article-title: An implicit enumeration algorithm for the hub interdiction median problem with fortification publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2017.11.035 – volume: 226 start-page: 185 issue: 2 year: 2013 end-page: 202 ident: CR13 article-title: An improved benders decomposition algorithm for the tree of hubs location problem publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2012.10.051 – volume: 43 start-page: 86 issue: 1 year: 2009 end-page: 97 ident: CR11 article-title: Benders decomposition for hub location problems with economies of scale publication-title: Transp. Sci. doi: 10.1287/trsc.1080.0233 – volume: 46 start-page: 529 issue: 4 year: 2012 end-page: 543 ident: CR2 article-title: Hub location under uncertainty publication-title: Transp. Res. Part B Methodol. doi: 10.1016/j.trb.2011.11.006 – volume: 93 start-page: 50 year: 2018 end-page: 61 ident: CR16 article-title: Efficient benders decomposition algorithms for the robust multiple allocation incomplete hub location problem with service time requirements publication-title: Expert Syst. Appl. doi: 10.1016/j.eswa.2017.10.005 – volume: 9 start-page: 1553 issue: 8 year: 2015 end-page: 1568 ident: CR28 article-title: Decomposition-based exact algorithms for risk-constrained traveling salesman problems with discrete random arc costs publication-title: Optim. Lett. doi: 10.1007/s11590-014-0798-7 – volume: 212 start-page: 518 issue: 3 year: 2011 end-page: 528 ident: CR9 article-title: Stochastic uncapacitated hub location problem publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2011.02.018 – volume: 291 start-page: 1 issue: 1 year: 2021 end-page: 17 ident: CR3 article-title: Perspectives on modeling hub location problems publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2020.09.039 – volume: 98 start-page: 49 issue: 1–3 year: 2003 end-page: 71 ident: CR5 article-title: Robust discrete optimization and network flows publication-title: Math. Program. doi: 10.1007/s10107-003-0396-4 – volume: 110 start-page: 322 year: 2017 end-page: 332 ident: CR36 article-title: The robust uncapacitated multiple allocation -hub median problem publication-title: Comput. Ind. Eng. doi: 10.1016/j.cie.2017.06.017 – volume: 46 start-page: 153 issue: 2 year: 2012 end-page: 169 ident: CR6 article-title: Twenty-five years of hub location research publication-title: Transp. Sci. doi: 10.1287/trsc.1120.0410 – volume: 49 start-page: 28 issue: 1 year: 2007 end-page: 39 ident: CR37 article-title: A hub covering model for cargo delivery systems publication-title: Networks doi: 10.1002/net.20139 – volume: 89 start-page: 31 year: 2018 end-page: 50 ident: CR15 article-title: Benders decomposition applied to a robust multiple allocation incomplete hub location problem publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2017.08.001 – volume: 15 start-page: 184 issue: 3 year: 2020 end-page: 195 ident: CR26 article-title: Robust single allocation p-hub median problem under hose and hybrid demand uncertainties: models and algorithms publication-title: Int. J. Manag. Sci. Eng. Manag. – volume: 70 start-page: 356 year: 2014 end-page: 373 ident: CR32 article-title: Robust hub network design problem publication-title: Transp. Res. Part E Log. Transp. Rev. doi: 10.1016/j.tre.2014.08.003 – volume: 8 start-page: 191 issue: 2 year: 2017 end-page: 202 ident: CR7 article-title: An adaptive large neighborhood search heuristic for solving the reliable multiple allocation hub location problem under hub disruptions publication-title: Int. J. Ind. Eng. Comput. – volume: 97 start-page: 31 year: 2018 end-page: 47 ident: CR19 article-title: An efficient matheuristic for the robust multiple allocation p-hub median problem under polyhedral demand uncertainty publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2018.04.021 – volume: 9 start-page: 147 issue: 2 year: 2015 end-page: 170 ident: CR24 article-title: The single allocation hub location problem: a robust optimisation approach publication-title: Eur. J. Ind. Eng. doi: 10.1504/EJIE.2015.068648 – volume: 54 start-page: 1446 issue: 6 year: 2020 end-page: 1470 ident: CR35 article-title: Benders decomposition for the profit maximizing capacitated hub location problem with multiple demand classes publication-title: Transp. Sci. doi: 10.1287/trsc.2020.1003 – volume: 47 start-page: 1092 issue: 6 year: 2011 end-page: 1111 ident: CR18 article-title: Hub location problems in transportation networks publication-title: Transp. Res. Part E doi: 10.1016/j.tre.2011.04.009 – volume: 36 start-page: 3166 issue: 12 year: 2009 end-page: 3177 ident: CR33 article-title: The stochastic p-hub center problem with service-level constraints publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2008.11.020 – volume: 106 start-page: 393 issue: Supplement C year: 2017 end-page: 410 ident: CR39 article-title: Robust uncapacitated hub location publication-title: Transp. Res. Part B Methodol. doi: 10.1016/j.trb.2017.06.008 – volume: 267 start-page: 496 issue: 2 year: 2018 end-page: 512 ident: CR23 article-title: Hub interdiction problem variants: models and metaheuristic solution algorithms publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2017.11.058 – volume: 32 start-page: 393 issue: 3 year: 1987 end-page: 404 ident: CR31 article-title: A quadratic integer program for the location of interacting hub facilities publication-title: Eur. J. Oper. Res. doi: 10.1016/S0377-2217(87)80007-3 – volume: 49 start-page: 500 issue: 3 year: 2015 end-page: 518 ident: CR14 article-title: The hub line location problem publication-title: Transp. Sci. doi: 10.1287/trsc.2014.0576 – volume: 1 start-page: 341 issue: 4 year: 2007 end-page: 354 ident: CR27 article-title: Optimum synthesis of discrete capacitated networks with multi-terminal commodity flow requirements publication-title: Optim. Lett. doi: 10.1007/s11590-006-0030-5 – volume: 86 start-page: 66 year: 2016 end-page: 85 ident: CR30 article-title: Robust intermodal hub location under polyhedral demand uncertainty publication-title: Transp. Res. Part B Methodol. doi: 10.1016/j.trb.2016.01.010 – volume: 4 start-page: 238 issue: 1 year: 1962 end-page: 252 ident: CR4 article-title: Partitioning procedures for solving mixedvariables programming problems publication-title: Numer. Math. doi: 10.1007/BF01386316 – volume: 30 start-page: 983 issue: 7 year: 2003 ident: 1799_CR29 publication-title: Comput. Oper. Res. doi: 10.1016/S0305-0548(02)00052-7 – volume: 54 start-page: 1446 issue: 6 year: 2020 ident: 1799_CR35 publication-title: Transp. Sci. doi: 10.1287/trsc.2020.1003 – volume: 76 start-page: 1091 issue: 5–8 year: 2015 ident: 1799_CR25 publication-title: Int. J. Adv. Manufact. Technol. doi: 10.1007/s00170-014-6330-5 – volume: 9 start-page: 1553 issue: 8 year: 2015 ident: 1799_CR28 publication-title: Optim. Lett. doi: 10.1007/s11590-014-0798-7 – volume: 46 start-page: 153 issue: 2 year: 2012 ident: 1799_CR6 publication-title: Transp. Sci. doi: 10.1287/trsc.1120.0410 – volume: 59 start-page: 1477 issue: 6 year: 2011 ident: 1799_CR8 publication-title: Oper. Res. doi: 10.1287/opre.1110.0965 – volume: 36 start-page: 3166 issue: 12 year: 2009 ident: 1799_CR33 publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2008.11.020 – volume: 4 start-page: 238 issue: 1 year: 1962 ident: 1799_CR4 publication-title: Numer. Math. doi: 10.1007/BF01386316 – volume: 4 start-page: 139 issue: 3 year: 1996 ident: 1799_CR17 publication-title: Locat. Sci. doi: 10.1016/S0966-8349(96)00011-3 – volume: 70 start-page: 356 year: 2014 ident: 1799_CR32 publication-title: Transp. Res. Part E Log. Transp. Rev. doi: 10.1016/j.tre.2014.08.003 – volume: 43 start-page: 86 issue: 1 year: 2009 ident: 1799_CR11 publication-title: Transp. Sci. doi: 10.1287/trsc.1080.0233 – volume: 267 start-page: 496 issue: 2 year: 2018 ident: 1799_CR23 publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2017.11.058 – volume: 46 start-page: 529 issue: 4 year: 2012 ident: 1799_CR2 publication-title: Transp. Res. Part B Methodol. doi: 10.1016/j.trb.2011.11.006 – volume: 9 start-page: 181 issue: 2 year: 2020 ident: 1799_CR20 publication-title: Decis. Sci. Lett. doi: 10.5267/j.dsl.2019.12.001 – volume: 9 start-page: 147 issue: 2 year: 2015 ident: 1799_CR24 publication-title: Eur. J. Ind. Eng. doi: 10.1504/EJIE.2015.068648 – volume: 35 start-page: 1047 issue: 4 year: 2008 ident: 1799_CR10 publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2006.07.002 – volume: 106 start-page: 393 issue: Supplement C year: 2017 ident: 1799_CR39 publication-title: Transp. Res. Part B Methodol. doi: 10.1016/j.trb.2017.06.008 – volume: 226 start-page: 185 issue: 2 year: 2013 ident: 1799_CR13 publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2012.10.051 – volume: 74 start-page: 668 year: 2019 ident: 1799_CR38 publication-title: Appl. Math. Model. doi: 10.1016/j.apm.2019.04.056 – volume: 47 start-page: 1092 issue: 6 year: 2011 ident: 1799_CR18 publication-title: Transp. Res. Part E doi: 10.1016/j.tre.2011.04.009 – volume: 98 start-page: 49 issue: 1–3 year: 2003 ident: 1799_CR5 publication-title: Math. Program. doi: 10.1007/s10107-003-0396-4 – volume: 86 start-page: 66 year: 2016 ident: 1799_CR30 publication-title: Transp. Res. Part B Methodol. doi: 10.1016/j.trb.2016.01.010 – volume: 49 start-page: 28 issue: 1 year: 2007 ident: 1799_CR37 publication-title: Networks doi: 10.1002/net.20139 – volume: 89 start-page: 31 year: 2018 ident: 1799_CR15 publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2017.08.001 – volume: 190 start-page: 1 issue: 1 year: 2008 ident: 1799_CR1 publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2007.06.008 – volume: 110 start-page: 322 year: 2017 ident: 1799_CR36 publication-title: Comput. Ind. Eng. doi: 10.1016/j.cie.2017.06.017 – volume: 9 start-page: 1675 issue: 8 year: 2015 ident: 1799_CR34 publication-title: Optim. Lett. doi: 10.1007/s11590-014-0814-y – volume: 8 start-page: 191 issue: 2 year: 2017 ident: 1799_CR7 publication-title: Int. J. Ind. Eng. Comput. – volume: 49 start-page: 500 issue: 3 year: 2015 ident: 1799_CR14 publication-title: Transp. Sci. doi: 10.1287/trsc.2014.0576 – volume: 93 start-page: 50 year: 2018 ident: 1799_CR16 publication-title: Expert Syst. Appl. doi: 10.1016/j.eswa.2017.10.005 – volume: 32 start-page: 393 issue: 3 year: 1987 ident: 1799_CR31 publication-title: Eur. J. Oper. Res. doi: 10.1016/S0377-2217(87)80007-3 – volume: 212 start-page: 518 issue: 3 year: 2011 ident: 1799_CR9 publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2011.02.018 – volume: 37 start-page: 7465 issue: 12–13 year: 2013 ident: 1799_CR12 publication-title: Appl. Math. Model. doi: 10.1016/j.apm.2013.02.035 – volume: 1 start-page: 341 issue: 4 year: 2007 ident: 1799_CR27 publication-title: Optim. Lett. doi: 10.1007/s11590-006-0030-5 – volume: 15 start-page: 184 issue: 3 year: 2020 ident: 1799_CR26 publication-title: Int. J. Manag. Sci. Eng. Manag. – volume: 19 start-page: 83 issue: 1 year: 2019 ident: 1799_CR22 publication-title: Netw. Spat. Econ. doi: 10.1007/s11067-018-9424-z – volume: 291 start-page: 1 issue: 1 year: 2021 ident: 1799_CR3 publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2020.09.039 – volume: 97 start-page: 31 year: 2018 ident: 1799_CR19 publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2018.04.021 – volume: 267 start-page: 23 issue: 1 year: 2018 ident: 1799_CR21 publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2017.11.035 |
| SSID | ssj0061199 |
| Score | 2.3204937 |
| Snippet | This paper addresses the robust uncapacitated multiple allocation
p
-hub median problem where the demand traffic between origin-destination pairs are subject... |
| SourceID | crossref springer |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 1745 |
| SubjectTerms | Computational Intelligence Mathematics Mathematics and Statistics Numerical and Computational Physics Operations Research/Decision Theory Optimization Original Paper Simulation |
| Title | Exact algorithms for the robust uncapacitated multiple allocation p-hub median problem |
| URI | https://link.springer.com/article/10.1007/s11590-021-01799-w |
| Volume | 16 |
| WOSCitedRecordID | wos000692617900001&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: PRVAVX databaseName: Springer Standard Collection customDbUrl: eissn: 1862-4480 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0061199 issn: 1862-4472 databaseCode: RSV dateStart: 20070101 isFulltext: true titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22 providerName: Springer Nature |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LSwMxEA5aPejBt1hf5OBNA_vIbjZHkRYvFvFRelvytIXalu7W-vOd7KO1IIIeA7PLMpnMN9mZbwahK18rrThccqhnNAGEMMRRSghNLJiQHwsb2mLYBOt0kl6PP1aksKyudq9TkoWnXpLdAHk94koKnBVxMl9HGwB3iRvY8PTcrf1v7JdTI_3E8YEoCyqqzM_vWIWj1VxoATHt3f993B7aqUJKfFvawD5aM6MDtP2t0SCsHhbdWbND1G19CpVjMXwbTwd5_z3DELliEMDTsZxlOQasAwxVjn5mNK5rDrHL0Zd_-PCE9GcSF7QTWJRDaY7Qa7v1cndPqvkKRAXczwlEIlqxiFpPMxbzyCae4JEMLKfKU1QKH3YqkMqaREY6CqU1klm4s_BI6NCI8Bg1RuOROUEY1KwCKyH4pTFlVnFJtRDgC6iMTUhZE_m1mlNVNR93MzCG6bJtstNgChpMCw2m8ya6XjwzKVtv_Cp9U-9MWh3D7Bfx07-Jn6GtwPEeijrdc9TIpzNzgTbVRz7IppeF_X0BY1DXVQ |
| linkProvider | Springer Nature |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1ZSwMxEA5eoD54i7d58E0De2SPPIq0VKxFtJa-LTltobbS3ao_38ke1YIU9DEwuyyTyXyTnflmELpwlVSSwSWHOloRQAhNLKWE0NiACbkhN77Jh01ErVbc7bKHkhSWVtXuVUoy99TfZDdAXofYkgJrRYx8LKJlCohlO-Y_PnUq_xu6xdRIN7Z8IBp5JVXm93fMwtFsLjSHmPrm_z5uC22UISW-LmxgGy3o4Q5a_9FoEFb30-6s6S7q1D65zDAfvIzG_az3mmKIXDEI4PFITNIMA9YBhkpLP9MKVzWH2Oboiz98-I30JgLntBNYFENp9tBzvda-aZByvgKRHnMzApGIklFAjaOiKGSBiR3OAuEZRqUjqeAu7JQnpNGxCFTgC6NFZODOwgKufM39fbQ0HA31AcKgZukZAcEvDWlkJBNUcQ6-gIpQ-zQ6RG6l5kSWzcftDIxB8t022WowAQ0muQaTj0N0OX3mrWi9MVf6qtqZpDyG6Rzxo7-Jn6PVRvu-mTRvW3fHaM2zHIi8ZvcELWXjiT5FK_I966fjs9wWvwCEr9o5 |
| linkToPdf | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1ZSwMxEA5aRfTBW7zNg28a3CN75FHUoqiloBbflpy2oG3pbq0_38ketgUpiI-B2WWZTDIzO_N9g9Cpq6SSDJIc6mhFwENoYiElhMYGTMgNufFNPmwiajTi11fWnEDx593uVUmywDRYlqZudtFX5mIMfAMv7BDbXmAtipHRPFqgtpHe5utPreouDt1igqQbW2wQjbwSNvP7O6Zd03RdNHc39bX_f-g6Wi1DTXxZ2MYGmtPdTbQyQUAIq8cf1tZ0C7VuvrjMMH9_6w06WfsjxRDRYhDAg54YphkGHwi-VVpYmla46kXEtnZf_PnDfdIeCpzDUWBRDKvZRi_1m-erW1LOXSDSY25GIEJRMgqocVQUhSwwscNZIDzDqHQkFdyFHfSENDoWgQp8YbSIDOQyLODK19zfQbVur6t3EQaVS88ICIppSCMjmaCKc7gjqAi1T6M95FYqT2RJSm5nY7wnYzplq8EENJjkGkxGe-js55l-QckxU_q82qWkPJ7pDPH9v4mfoKXmdT15uGvcH6Blz0Ij8lbeQ1TLBkN9hBblZ9ZJB8e5WX4DEdTjHQ |
| 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=Exact+algorithms+for+the+robust+uncapacitated+multiple+allocation+p-hub+median+problem&rft.jtitle=Optimization+letters&rft.au=Ghaffarinasab%2C+Nader&rft.date=2022-07-01&rft.pub=Springer+Berlin+Heidelberg&rft.issn=1862-4472&rft.eissn=1862-4480&rft.volume=16&rft.issue=6&rft.spage=1745&rft.epage=1772&rft_id=info:doi/10.1007%2Fs11590-021-01799-w&rft.externalDocID=10_1007_s11590_021_01799_w |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1862-4472&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1862-4472&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1862-4472&client=summon |