{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,26]],"date-time":"2025-10-26T15:02:06Z","timestamp":1761490926007,"version":"3.41.2"},"reference-count":37,"publisher":"Emerald","issue":"3","license":[{"start":{"date-parts":[[2020,1,13]],"date-time":"2020-01-13T00:00:00Z","timestamp":1578873600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.emerald.com\/insight\/site-policies"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IMDS"],"published-print":{"date-parts":[[2020,1,13]]},"abstract":"<jats:sec>\n<jats:title content-type=\"abstract-subheading\">Purpose<\/jats:title>\n<jats:p>Motivated by a problem in the context of DiDi Travel, the biggest taxi hailing platform in China, the purpose of this paper is to propose a novel facility location problem, specifically, the single source capacitated facility location problem with regional demand and time constraints, to help improve overall transportation efficiency and cost.<\/jats:p>\n<\/jats:sec>\n<jats:sec>\n<jats:title content-type=\"abstract-subheading\">Design\/methodology\/approach<\/jats:title>\n<jats:p>This study develops a mathematical programming model, considering regional demand and time constraints. A novel two-stage neighborhood search heuristic algorithm is proposed and applied to solve instances based on data sets published by DiDi Travel.<\/jats:p>\n<\/jats:sec>\n<jats:sec>\n<jats:title content-type=\"abstract-subheading\">Findings<\/jats:title>\n<jats:p>The results of this study show that the model is adequate since new characteristics of demand can be deduced from large vehicle trajectory data sets. The proposed algorithm is effective and efficient on small and medium as well as large instances. The research also solves and presents a real instance in the urban area of Chengdu, China, with up to 30 facilities and demand deduced from 16m taxi trajectory data records covering around 16,000 drivers.<\/jats:p>\n<\/jats:sec>\n<jats:sec>\n<jats:title content-type=\"abstract-subheading\">Research limitations\/implications<\/jats:title>\n<jats:p>This study examines an offline and single-period case of the problem. It does not consider multi-period or online cases with uncertainties, where decision makers need to dynamically remove out-of-service stations and add other stations to the selected group.<\/jats:p>\n<\/jats:sec>\n<jats:sec>\n<jats:title content-type=\"abstract-subheading\">Originality\/value<\/jats:title>\n<jats:p>Prior studies have been quite limited. They have not yet considered demand in the form of vehicle trajectory data in facility location problems. This study takes into account new characteristics of demand, regional and time constrained, and proposes a new variant and its solution approach.<\/jats:p>\n<\/jats:sec>","DOI":"10.1108\/imds-07-2019-0380","type":"journal-article","created":{"date-parts":[[2020,1,15]],"date-time":"2020-01-15T05:09:06Z","timestamp":1579064946000},"page":"526-546","source":"Crossref","is-referenced-by-count":5,"title":["A novel facility location problem for taxi hailing platforms"],"prefix":"10.1108","volume":"120","author":[{"given":"Hong","family":"Ma","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ni","family":"Shen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jing","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mingrong","family":"Deng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"140","reference":[{"issue":"6","key":"key2020032509574143100_ref001","doi-asserted-by":"crossref","first-page":"749","DOI":"10.1287\/mnsc.1030.0193","article-title":"A multi-exchange heuristic for the single-source capacitated facility location problem","volume":"50","year":"2004","journal-title":"Management Science"},{"issue":"2\u20133","key":"key2020032509574143100_ref002","first-page":"243","article-title":"A framework for statistical clustering with constant time approximation algorithms for K-median and K-means clustering","volume":"66","year":"2007","journal-title":"Machine Learning"},{"key":"key2020032509574143100_ref003","first-page":"1","article-title":"On covering location problems on networks with edge demand","volume":"74","year":"2015","journal-title":"Computers and Operation Research"},{"issue":"October","key":"key2020032509574143100_ref004","first-page":"77","article-title":"Maximal covering location problems on networks with regional demand","volume":"64","year":"2016","journal-title":"Omega (United Kingdom)"},{"volume-title":"Heuristic Methods for Location-Allocation Problems","year":"1964","key":"key2020032509574143100_ref005"},{"volume-title":"Network and Discrete Location Models, Algorithms and Applications","year":"1995","key":"key2020032509574143100_ref006"},{"issue":"October","key":"key2020032509574143100_ref007","first-page":"237","article-title":"Heuristics for a continuous multi-facility location problem with demand regions","volume":"62","year":"2015","journal-title":"Computers and Operations Research"},{"issue":"January","key":"key2020032509574143100_ref008","first-page":"44","article-title":"Charging infrastructure planning for promoting battery electric vehicles: an activity-based approach using multiday travel data","volume":"38","year":"2014","journal-title":"Transportation Research Part c Emerging Technologies"},{"volume-title":"Facility Location Concepts, Models, Algorithms and Case Studies","year":"2009","key":"key2020032509574143100_ref009"},{"issue":"2","key":"key2020032509574143100_ref010","doi-asserted-by":"crossref","first-page":"438","DOI":"10.1016\/j.ejor.2014.04.007","article-title":"A heuristic for BILP problems: the single source capacitated facility location problem","volume":"238","year":"2014","journal-title":"European Journal of Operational Research"},{"issue":"November","key":"key2020032509574143100_ref011","first-page":"221","article-title":"The capacitated multi-facility weber problem with polyhedral barriers: efficient heuristic methods","volume":"113","year":"2017","journal-title":"Computers & Industrial Engineering"},{"issue":"February","key":"key2020032509574143100_ref012","first-page":"169","article-title":"An iterated tabu search heuristic for the single source capacitated facility location problem","volume":"27","year":"2015","journal-title":"Applied Soft Computing Journal"},{"issue":"3","key":"key2020032509574143100_ref013","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1111\/j.1538-4632.1990.tb00210.x","article-title":"A flow\u2010capturing location\u2010allocation model","volume":"22","year":"2010","journal-title":"Geographical Analysis, Geographical Analysis"},{"issue":"3","key":"key2020032509574143100_ref014","doi-asserted-by":"crossref","first-page":"544","DOI":"10.1016\/S0377-2217(98)00008-3","article-title":"An exact algorithm for the capacitated facility location problems with single sourcing","volume":"113","year":"1999","journal-title":"European Journal of Operational Research"},{"issue":"July","key":"key2020032509574143100_ref015","first-page":"269","article-title":"Deviation-flow refueling location problem with capacitated facilities: model and algorithm","volume":"54","year":"2017","journal-title":"Transportation Research Part D: Transport and Environment"},{"issue":"May","key":"key2020032509574143100_ref016","first-page":"170","article-title":"Infrastructure development for alternative fuel vehicles on a highway road system","volume":"77","year":"2015","journal-title":"Transportation Research Part E: Logistics and Transportation Review"},{"issue":"1","key":"key2020032509574143100_ref017","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1016\/j.ejor.2017.04.004","article-title":"The continuous single source location problem with capacity and zone-dependent fixed cost: models and solution approaches","volume":"263","year":"2017","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"key2020032509574143100_ref018","doi-asserted-by":"crossref","first-page":"1275","DOI":"10.1007\/s10589-010-9392-9","article-title":"A Barzilai-Borwein-based heuristic algorithm for locating multiple facilities with regional demand","volume":"51","year":"2012","journal-title":"Computational Optimization and Applications"},{"issue":"7","key":"key2020032509574143100_ref019","doi-asserted-by":"crossref","first-page":"881","DOI":"10.1109\/TPAMI.2002.1017616","article-title":"An efficient k-means clustering algorithm: analysis and implementation","volume":"24","year":"2002","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"issue":"2","key":"key2020032509574143100_ref020","doi-asserted-by":"crossref","first-page":"408","DOI":"10.1016\/S0377-2217(99)00300-8","article-title":"A Lagrangean relax-and-cut approach for the two-stage capacitated facility location problem","volume":"126","year":"2000","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"key2020032509574143100_ref021","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/j.seps.2004.03.001","article-title":"The flow-refueling location problem for alternative-fuel vehicles","volume":"39","year":"2005","journal-title":"Socio-Economic Planning Sciences"},{"issue":"December","key":"key2020032509574143100_ref022","first-page":"124","article-title":"The p-center flow-refueling facility location problem","volume":"118","year":"2018","journal-title":"Transportation Research Part B: Methodological"},{"issue":"2","key":"key2020032509574143100_ref023","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1016\/j.ijpe.2008.11.009","article-title":"Stochastic single-source capacitated facility location model with service level requirements","volume":"117","year":"2009","journal-title":"International Journal of Production Economics"},{"issue":"7","key":"key2020032509574143100_ref024","doi-asserted-by":"crossref","first-page":"1465","DOI":"10.1016\/j.cor.2011.08.018","article-title":"Single-source capacitated multi-facility weber problem \u2013 an iterative two phase heuristic algorithm","volume":"39","year":"2012","journal-title":"Computers and Operations Research"},{"issue":"2","key":"key2020032509574143100_ref025","doi-asserted-by":"crossref","first-page":"432","DOI":"10.1016\/j.ejor.2018.01.040","article-title":"Multi-period stochastic covering location problems: modeling framework and solution approach","volume":"268","year":"2018","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"key2020032509574143100_ref026","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1016\/j.ejor.2016.08.020","article-title":"Evasive flow capture: a multi-period stochastic facility location problem with independent demand","volume":"257","year":"2017","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"key2020032509574143100_ref027","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/j.cor.2009.04.001","article-title":"A continuous analysis framework for the solution of location\u2013allocation problems with dense demand","volume":"37","year":"2010","journal-title":"Computers & Operations Research"},{"issue":"3","key":"key2020032509574143100_ref028","doi-asserted-by":"crossref","first-page":"791","DOI":"10.1016\/j.ejor.2017.10.019","article-title":"Multi-level facility location problems","volume":"267","year":"2018","journal-title":"European Journal of Operational Research"},{"volume-title":"Modern Heuristic Techniques for Combinatorial Problems","year":"1993","key":"key2020032509574143100_ref029"},{"issue":"3","key":"key2020032509574143100_ref030","doi-asserted-by":"crossref","first-page":"470","DOI":"10.1287\/ijoc.1100.0414","article-title":"The reliable facility location problem: formulations, heuristics, and approximation algorithms","volume":"23","year":"2011","journal-title":"INFORMS Journal on Computing"},{"key":"key2020032509574143100_ref031","unstructured":"ShenZhen Daily (2006), \u201cTaxi fares in ShenZhen to remain unchanged\u201d, March 31, available at: www.china.org.cn\/government\/local_governments\/2006-03\/31\/content_1164140.html"},{"issue":"3","key":"key2020032509574143100_ref032","first-page":"400","article-title":"Reliability models for facility location: the expected failure cost case","volume":"39","year":"2013","journal-title":"Transportation Science"},{"issue":"3","key":"key2020032509574143100_ref034","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1016\/j.ejor.2012.03.047","article-title":"A cut-and-solve based algorithm for the single-source capacitated facility location problem","volume":"221","year":"2012","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"key2020032509574143100_ref033","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1016\/j.ejor.2018.11.062","article-title":"An effective hybrid approach to the two-stage capacitated facility location problem","volume":"275","year":"2019","journal-title":"European Journal of Operational Research"},{"year":"2018","key":"key2020032509574143100_ref035","article-title":"DiDi completes 7.43 bln rides in 2017"},{"issue":"6","key":"key2020032509574143100_ref036","doi-asserted-by":"crossref","first-page":"1099","DOI":"10.1016\/j.tre.2007.09.001","article-title":"Combining Lagrangian heuristic and ant colony system to solve the single source capacitated facility location problem","volume":"44","year":"2008","journal-title":"Transportation Research Part E: Logistics and Transportation Review"},{"issue":"1","key":"key2020032509574143100_ref037","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/j.ejor.2017.10.012","article-title":"An efficient heuristic algorithm for the alternative-fuel station location problem","volume":"269","year":"2018","journal-title":"European Journal of Operational Research"}],"container-title":["Industrial Management &amp; Data Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/IMDS-07-2019-0380\/full\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/IMDS-07-2019-0380\/full\/html","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,24]],"date-time":"2025-07-24T21:52:47Z","timestamp":1753393967000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.emerald.com\/imds\/article\/120\/3\/526-546\/186970"}},"subtitle":["A two-stage neighborhood search heuristic approach"],"short-title":[],"issued":{"date-parts":[[2020,1,13]]},"references-count":37,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,1,13]]}},"alternative-id":["10.1108\/IMDS-07-2019-0380"],"URL":"https:\/\/doi.org\/10.1108\/imds-07-2019-0380","relation":{},"ISSN":["0263-5577"],"issn-type":[{"type":"print","value":"0263-5577"}],"subject":[],"published":{"date-parts":[[2020,1,13]]}}}