{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T06:50:58Z","timestamp":1777704658112,"version":"3.51.4"},"reference-count":30,"publisher":"SAGE Publications","issue":"5","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IFS"],"published-print":{"date-parts":[[2021,4,22]]},"abstract":"<jats:p>The hub maximal covering location problem aims to find the best locations for hubs so as to maximize the total flows covered by predetermined number of hubs. Generally, this problem is defined in the framework of binary coverage. However, there are many real-life cases in which the binary coverage assumption may yield unexpected decisions. Thus, the partial coverage is considered by stipulating that the coverage of an origin-destination pair is determined by a non-increasing decay function. Moreover, as this problem contains strategic decisions in long range, the precise information about the parameters such as travel times may not be obtained in advance. Therefore, we present uncertain hub maximal covering location models with partial coverage in which the travel times are depicted as uncertain variables. Specifically, the partial coverage parameter is introduced in uncertain environment and the expected value of partial coverage parameter is further derived and simplified with specific decay functions. Expected value model and chance constrained programming model are respectively proposed and transformed to their deterministic equivalent forms. Finally, a greedy variable neighborhood search heuristic is presented and the efficiency of the proposed models is evaluated through computational experiments.<\/jats:p>","DOI":"10.3233\/jifs-202635","type":"journal-article","created":{"date-parts":[[2021,3,9]],"date-time":"2021-03-09T12:50:19Z","timestamp":1615294219000},"page":"9987-10002","source":"Crossref","is-referenced-by-count":4,"title":["Modelling and analysis of uncertain hub maximal covering location problem in the presence of partial coverage"],"prefix":"10.1177","volume":"40","author":[{"given":"Junbin","family":"Wang","sequence":"first","affiliation":[{"name":"School of Economics and Management, Beihang University, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhongfeng","family":"Qin","sequence":"additional","affiliation":[{"name":"School of Economics and Management, Beihang University, Beijing, China"},{"name":"Key Laboratory of Complex System Analysis, Management and Decision (Beihang University), Ministry of Education, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","reference":[{"issue":"2","key":"10.3233\/JIFS-202635_ref1","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/j.ejor.2010.02.022","article-title":"A general variable neighborhood search for solving the uncapacitated single allocation p-hub median problem","volume":"206","author":"Aleksandar","year":"2010","journal-title":"European Journal of Operational Research"},{"key":"10.3233\/JIFS-202635_ref2","doi-asserted-by":"crossref","first-page":"1349","DOI":"10.1057\/jors.2008.92","article-title":"A hub covering network design problem for cargo applications in Turkey","volume":"60","author":"Alumur","year":"2009","journal-title":"Journal of the Operational Research Society"},{"issue":"6","key":"10.3233\/JIFS-202635_ref3","doi-asserted-by":"crossref","first-page":"931","DOI":"10.1080\/01605682.2018.1471376","article-title":"The multiple gradual cover location problem","volume":"70","author":"Berman","year":"2019","journal-title":"Journal of the Operational Research Society"},{"issue":"6","key":"10.3233\/JIFS-202635_ref4","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1016\/S0305-0548(01)00079-X","article-title":"The generalized maximal covering location problem","volume":"29","author":"Berman","year":"2002","journal-title":"Computers & Operations Research"},{"issue":"3","key":"10.3233\/JIFS-202635_ref5","doi-asserted-by":"crossref","first-page":"474","DOI":"10.1016\/S0377-2217(02)00604-5","article-title":"The gradual covering decay location problem on a network","volume":"151","author":"Berman","year":"2003","journal-title":"European Journal of Operational Research"},{"key":"10.3233\/JIFS-202635_ref6","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1016\/0377-2217(94)90318-2","article-title":"Integer programming formulations of discrete hub location problems","volume":"72","author":"Campbell","year":"1994","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"10.3233\/JIFS-202635_ref7","doi-asserted-by":"crossref","first-page":"827","DOI":"10.1007\/s12351-017-0357-y","article-title":"A bi-level maximal covering location problem","volume":"20","author":"Casas-Ramirez","year":"2020","journal-title":"Operational Research"},{"key":"10.3233\/JIFS-202635_ref8","first-page":"632","article-title":"Uncertain programming model for uncertain minimum weight vertex covering problem,625\u2013","volume":"28","author":"Chen","year":"2018","journal-title":"Journal of Intelligent Manufacturing"},{"issue":"1","key":"10.3233\/JIFS-202635_ref9","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/BF01939922","article-title":"Generalized coverage models and public facility location","volume":"53","author":"Church","year":"1983","journal-title":"Papers in Regional Science"},{"key":"10.3233\/JIFS-202635_ref11","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1016\/j.omega.2017.01.011","article-title":"A stochastic multi-period capacitated multiple allocation hub location problem: Formulation and inequalities","volume":"74","author":"Correia","year":"2017","journal-title":"Omega"},{"issue":"46","key":"10.3233\/JIFS-202635_ref12","doi-asserted-by":"crossref","first-page":"903","DOI":"10.1007\/s00291-013-0350-7","article-title":"The maximin gradual cover location problem","volume":"36","author":"Drezner","year":"2014","journal-title":"OR Spectrum"},{"issue":"3","key":"10.3233\/JIFS-202635_ref13","doi-asserted-by":"crossref","first-page":"819","DOI":"10.1007\/s11067-018-9429-7","article-title":"Cooperative Cover of Uniform Demand","volume":"19","author":"Drezner","year":"2019","journal-title":"Networks & Spatial Economics"},{"key":"10.3233\/JIFS-202635_ref14","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1016\/j.cie.2016.09.017","article-title":"A chance constrained programming approach for uncertain p-hub center location problem","volume":"102","author":"Gao","year":"2016","journal-title":"Computers & Industrial Engineering"},{"issue":"1-2","key":"10.3233\/JIFS-202635_ref15","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/s10479-017-2508-1","article-title":"Novel formulations and VNS-based heuristics for single and multiple allocation p-hub maximal covering problems","volume":"259","author":"Jankovic","year":"2017","journal-title":"Annals of Operations Research"},{"key":"10.3233\/JIFS-202635_ref16","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1111\/j.1538-4632.2009.00755.x","article-title":"Reliable p-Hub Location Problems in Telecommunication Networks","volume":"41","author":"Kim","year":"2009","journal-title":"Geographical Analysis"},{"key":"10.3233\/JIFS-202635_ref17","doi-asserted-by":"crossref","first-page":"106577","DOI":"10.1016\/j.cie.2020.106577","article-title":"Gradual covering location problem with multi-type facilities considering customer preferences","volume":"147","author":"Kucukaydin","year":"2020","journal-title":"Computers & Industrial Engineering"},{"key":"10.3233\/JIFS-202635_ref18","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1016\/j.tre.2018.03.007","article-title":"Hub network design problem with profit optimization for time-definite LTL freight transportation","volume":"114","author":"Lin","year":"2018","journal-title":"Transportation Research Part E: Logistics and Transportation Review"},{"key":"10.3233\/JIFS-202635_ref19","unstructured":"Liu B. , Uncertainty theory, 2nd ed., Berlin, 2007, Springer."},{"key":"10.3233\/JIFS-202635_ref20","unstructured":"Liu B. , Uncertainty theory: A branch of mathematics for modeling human uncertainty. Berlin, 2010, Springer."},{"key":"10.3233\/JIFS-202635_ref21","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1007\/s00500-012-0930-5","article-title":"Extreme value theorems of uncertain process with application to insurance risk model","volume":"17","author":"Liu","year":"2013","journal-title":"Soft Computing"},{"key":"10.3233\/JIFS-202635_ref22","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/j.cie.2014.09.029","article-title":"Uncertain multilevel programming: Algorithm and applications","volume":"89","author":"Liu","year":"2015","journal-title":"Computers & Industrial Engineering"},{"key":"10.3233\/JIFS-202635_ref23","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1016\/j.omega.2015.01.009","article-title":"The p-hub maximal covering problem and extensions for gradual decay functions","volume":"54","author":"Peker","year":"2015","journal-title":"Omega"},{"issue":"3","key":"10.3233\/JIFS-202635_ref24","doi-asserted-by":"crossref","first-page":"705","DOI":"10.1007\/s10845-014-0990-8","article-title":"Uncapacitated p-hub location problem with fixed costs and uncertain flows","volume":"28","author":"Qin","year":"2017","journal-title":"Journal of Intelligent Manufacturing"},{"key":"10.3233\/JIFS-202635_ref25","doi-asserted-by":"crossref","first-page":"3166","DOI":"10.1016\/j.cor.2008.11.020","article-title":"The stochastic p-hub center problem with service-level constraints","volume":"36","author":"Sim","year":"2009","journal-title":"Computers & Operations Research"},{"issue":"3","key":"10.3233\/JIFS-202635_ref26","first-page":"954","article-title":"Chance constrained programming models for uncertain hub covering location problems","volume":"262","author":"Wang","year":"2020","journal-title":"Soft Computing"},{"key":"10.3233\/JIFS-202635_ref27","doi-asserted-by":"crossref","first-page":"785","DOI":"10.1016\/j.apm.2017.02.031","article-title":"Multi-objective competitive location problem with distance-based attractiveness and its best non-dominated solution","volume":"47","author":"Wang","year":"2017","journal-title":"Applied Mathematical Modelling"},{"key":"10.3233\/JIFS-202635_ref28","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/j.compeleceng.2018.07.013","article-title":"Multi-objective competitive location problem with distance-based attractiveness for two facilities","volume":"71","author":"Wang","year":"2018","journal-title":"Computers & Electrical Engineering"},{"key":"10.3233\/JIFS-202635_ref29","doi-asserted-by":"crossref","first-page":"4424","DOI":"10.1016\/j.apm.2009.03.018","article-title":"Stochastic air freight hub location and flight routes planning","volume":"33","author":"Yang","year":"2009","journal-title":"Applied Mathematical Modelling"},{"issue":"2","key":"10.3233\/JIFS-202635_ref30","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1109\/TFUZZ.2017.2666846","article-title":"Uncertain statistical inference models with imprecise observations","volume":"26","author":"Yao","year":"2017","journal-title":"IEEE Transactions on Fuzzy Systems"},{"issue":"3","key":"10.3233\/JIFS-202635_ref31","doi-asserted-by":"crossref","first-page":"825","DOI":"10.3233\/IFS-120688","article-title":"An numerical method for solving uncertain differential equations","volume":"25","author":"Yao","year":"2013","journal-title":"Journal of Intelligent & Fuzzy Systems"}],"container-title":["Journal of Intelligent &amp; Fuzzy Systems"],"original-title":[],"link":[{"URL":"https:\/\/content.iospress.com\/download?id=10.3233\/JIFS-202635","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T09:41:43Z","timestamp":1777455703000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/full\/10.3233\/JIFS-202635"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,4,22]]},"references-count":30,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.3233\/jifs-202635","relation":{},"ISSN":["1064-1246","1875-8967"],"issn-type":[{"value":"1064-1246","type":"print"},{"value":"1875-8967","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,4,22]]}}}