{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T11:25:53Z","timestamp":1774351553150,"version":"3.50.1"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2019,11,7]],"date-time":"2019-11-07T00:00:00Z","timestamp":1573084800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,11,7]],"date-time":"2019-11-07T00:00:00Z","timestamp":1573084800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["71771011"],"award-info":[{"award-number":["71771011"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2020,2]]},"DOI":"10.1007\/s00500-019-04476-4","type":"journal-article","created":{"date-parts":[[2019,11,7]],"date-time":"2019-11-07T11:05:54Z","timestamp":1573124754000},"page":"2781-2791","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Chance constrained programming models for uncertain hub covering location problems"],"prefix":"10.1007","volume":"24","author":[{"given":"Junbin","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3875-2518","authenticated-orcid":false,"given":"Zhongfeng","family":"Qin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,11,7]]},"reference":[{"issue":"12","key":"4476_CR1","doi-asserted-by":"publisher","first-page":"3088","DOI":"10.1016\/j.cor.2008.11.023","volume":"36","author":"H Calik","year":"2009","unstructured":"Calik H, Alumur SA, Kara BY, Karasan OE (2009) A tabu-search based heuristic for the hub covering problem over incomplete hub networks. Comput Oper Res 36(12):3088\u20133096","journal-title":"Comput Oper Res"},{"issue":"2","key":"4476_CR2","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1016\/0377-2217(94)90318-2","volume":"72","author":"JF Campbell","year":"1994","unstructured":"Campbell JF (1994) Integer programming formulations of discrete hub location problems. Eur J Oper Res 72(2):387\u2013405","journal-title":"Eur J Oper Res"},{"issue":"5","key":"4476_CR3","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1016\/j.orl.2014.06.002","volume":"42","author":"M Castelli","year":"2014","unstructured":"Castelli M, Vanneschi L (2014) Genetic algorithm with variable neighborhood search for the optimal allocation of goods in shop shelves. Oper Res Lett 42(5):355\u2013360","journal-title":"Oper Res Lett"},{"key":"4476_CR4","unstructured":"Chanta S, Sangsawang O (2018) A single allocation p-hub maximal covering model for optimizing railway station location. In: International conference on intelligent computing & optimization. Springer, Cham, pp 522\u2013530"},{"key":"4476_CR5","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1016\/j.omega.2017.01.011","volume":"74","author":"I Correia","year":"2018","unstructured":"Correia I, Nickel S, Saldanha-da-Gama F (2018) A stochastic multi-period capacitated multiple allocation hub location problem: Formulation and inequalities. Omega 74:122\u2013134","journal-title":"Omega"},{"key":"4476_CR6","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1016\/j.cor.2015.11.010","volume":"78","author":"O Dib","year":"2017","unstructured":"Dib O, Manier MA, Moalic L, Caminada A (2017) Combining VNS with genetic algorithm to solve the one-to-one routing issue in road networks. Comput Oper Res 78:420\u2013430","journal-title":"Comput Oper Res"},{"key":"4476_CR7","first-page":"133","volume-title":"Lecture Notes in Management and Industrial Engineering","author":"Andreas T. Ernst","year":"2017","unstructured":"Ernst AT, Jiang H, Krishanmoorthy M, Baatar D (2018) Reformulations and computational results for the uncapacitated single allocation hub covering problem. Data and decision sciences in action. Springer, Cham, pp 133\u2013148"},{"key":"4476_CR8","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1016\/j.cie.2016.09.017","volume":"102","author":"Y Gao","year":"2016","unstructured":"Gao Y, Qin Z (2016) A chance constrained programming approach for uncertain p-hub center location problem. Comput Ind Eng 102:10\u201320","journal-title":"Comput Ind Eng"},{"issue":"2","key":"4476_CR9","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1016\/j.cie.2012.03.014","volume":"63","author":"YH Hwang","year":"2012","unstructured":"Hwang YH, Lee YH (2012) Uncapacitated single allocation p-hub maximal covering problem. Comput Ind Eng 63(2):382\u2013389","journal-title":"Comput Ind Eng"},{"issue":"1\u20132","key":"4476_CR10","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/s10479-017-2508-1","volume":"259","author":"O Jankovic","year":"2017","unstructured":"Jankovic O, Miskovic S, Stanimirovic Z, Todosijevic R (2017) Novel formulations and VNS-based heuristics for single and multiple allocation p-hub maximal covering problems. Ann Oper Res 259(1\u20132):191\u2013216","journal-title":"Ann Oper Res"},{"issue":"1","key":"4476_CR11","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1057\/palgrave.jors.2601473","volume":"54","author":"BY Kara","year":"2003","unstructured":"Kara BY, Tansel BC (2003) The single-assignment hub covering problem: Models and linearizations. J Oper Res Soc 54(1):59\u201364","journal-title":"J Oper Res Soc"},{"issue":"10","key":"4476_CR12","doi-asserted-by":"publisher","first-page":"1349","DOI":"10.1057\/jors.2008.92","volume":"60","author":"BY Kara","year":"2009","unstructured":"Kara BY, Alumur S (2009) A hub covering network design problem for cargo applications in Turkey. J Oper Res Soc 60(10):1349\u20131359","journal-title":"J Oper Res Soc"},{"key":"4476_CR13","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/j.cie.2017.12.020","volume":"116","author":"H Karimi","year":"2018","unstructured":"Karimi H (2018) The capacitated hub covering location-routing problem for simultaneous pickup and delivery systems. Comput Ind Eng 116:47\u201358","journal-title":"Comput Ind Eng"},{"key":"4476_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-73165-8_5","volume-title":"Uncertainty theory","author":"B Liu","year":"2007","unstructured":"Liu B (2007) Uncertainty theory. Springer, Berlin"},{"key":"4476_CR15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-89484-1","volume-title":"Theory and practice of uncertain programming","author":"B Liu","year":"2009","unstructured":"Liu B (2009) Theory and practice of uncertain programming. Springer, Berlin"},{"issue":"7","key":"4476_CR16","doi-asserted-by":"publisher","first-page":"973","DOI":"10.1057\/jors.2012.122","volume":"64","author":"TJ Lowe","year":"2013","unstructured":"Lowe TJ, Sim T (2013) The hub covering flow problem. J Oper Res Soc 64(7):973\u2013981","journal-title":"J Oper Res Soc"},{"issue":"24","key":"4476_CR17","doi-asserted-by":"publisher","first-page":"10053","DOI":"10.1016\/j.apm.2013.05.063","volume":"37","author":"M Mohammadi","year":"2013","unstructured":"Mohammadi M, Jolai F, Tavakkoli-Moghaddam R (2013) Solving a new stochastic multi-mode p-hub covering location problem considering risk by a novel multi-objective algorithm. Appl Math Model 37(24):10053\u201310073","journal-title":"Appl Math Model"},{"key":"4476_CR18","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1016\/j.omega.2015.01.009","volume":"54","author":"M Peker","year":"2015","unstructured":"Peker M, Kara BY (2015) The p-hub maximal covering problem and extensions for gradual decay functions. Omega 54:158\u2013172","journal-title":"Omega"},{"issue":"3","key":"4476_CR19","doi-asserted-by":"publisher","first-page":"705","DOI":"10.1007\/s10845-014-0990-8","volume":"28","author":"Z Qin","year":"2017","unstructured":"Qin Z, Gao Y (2017) Uncapacitated p-hub location problem with fixed costs and uncertain flows. J Intell Manuf 28(3):705\u2013716","journal-title":"J Intell Manuf"},{"issue":"3","key":"4476_CR20","doi-asserted-by":"publisher","first-page":"954","DOI":"10.1016\/j.ejor.2017.03.066","volume":"262","author":"MR Silva","year":"2017","unstructured":"Silva MR, Cunha CB (2017) A tabu search heuristic for the uncapacitated single allocation p-hub maximal covering problem. Eur J Oper Res 262(3):954\u2013965","journal-title":"Eur J Oper Res"},{"issue":"1","key":"4476_CR21","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1002\/net.20139","volume":"49","author":"PZ Tan","year":"2007","unstructured":"Tan PZ, Kara BY (2007) A hub covering model for cargo delivery systems. Networks 49(1):28\u201339","journal-title":"Networks"},{"issue":"3","key":"4476_CR22","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1016\/j.ejor.2011.01.014","volume":"211","author":"H Yaman","year":"2011","unstructured":"Yaman H (2011) Allocation strategies in hub networks. Eur J Oper Res 211(3):442\u2013451","journal-title":"Eur J Oper Res"},{"issue":"12","key":"4476_CR23","doi-asserted-by":"publisher","first-page":"4424","DOI":"10.1016\/j.apm.2009.03.018","volume":"33","author":"TH Yang","year":"2009","unstructured":"Yang TH (2009) Stochastic air freight hub location and flight routes planning. Appl Math Model 33(12):4424\u20134430","journal-title":"Appl Math Model"},{"key":"4476_CR24","doi-asserted-by":"publisher","first-page":"2624","DOI":"10.1016\/j.asoc.2012.11.024","volume":"13","author":"K Yang","year":"2013","unstructured":"Yang K, Liu Y, Yang G (2013) Solving fuzzy p-hub center problem by genetic algorithm incorporating local search. Appl Soft Comput 13:2624\u20132632","journal-title":"Appl Soft Comput"},{"issue":"3","key":"4476_CR25","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/s10700-018-9298-z","volume":"18","author":"X Yang","year":"2019","unstructured":"Yang X, Liu B (2019) Uncertain time series analysis with imprecise observations. Fuzzy Optim Decis Making 18(3):263\u2013278","journal-title":"Fuzzy Optim Decis Making"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-019-04476-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-019-04476-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-019-04476-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,6]],"date-time":"2020-11-06T00:19:26Z","timestamp":1604621966000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-019-04476-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,7]]},"references-count":25,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2020,2]]}},"alternative-id":["4476"],"URL":"https:\/\/doi.org\/10.1007\/s00500-019-04476-4","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,11,7]]},"assertion":[{"value":"7 November 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of interest"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}