{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,11]],"date-time":"2025-11-11T15:46:58Z","timestamp":1762876018195,"version":"3.37.3"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2018,9,10]],"date-time":"2018-09-10T00:00:00Z","timestamp":1536537600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"China National Scientific and Technical Support Program","award":["2016YFC0801801"],"award-info":[{"award-number":["2016YFC0801801"]}]},{"DOI":"10.13039\/501100005089","name":"Beijing Municipal Natural Science Foundation","doi-asserted-by":"publisher","award":["4174090"],"award-info":[{"award-number":["4174090"]}],"id":[{"id":"10.13039\/501100005089","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Program of Beijing Excellent Talents Training for Young Scholar","award":["2016000020124G056"],"award-info":[{"award-number":["2016000020124G056"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["41430318","41272276"],"award-info":[{"award-number":["41430318","41272276"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["41572222","41602262"],"award-info":[{"award-number":["41572222","41602262"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100005089","name":"Beijing Municipal Natural Science Foundation","doi-asserted-by":"publisher","award":["8162036"],"award-info":[{"award-number":["8162036"]}],"id":[{"id":"10.13039\/501100005089","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2019,4]]},"DOI":"10.1007\/s10957-018-1386-2","type":"journal-article","created":{"date-parts":[[2018,9,10]],"date-time":"2018-09-10T15:32:36Z","timestamp":1536593556000},"page":"279-297","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Priority-Oriented Route Network Planning for Evacuation in Constrained Space Scenarios"],"prefix":"10.1007","volume":"181","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7862-3388","authenticated-orcid":false,"given":"Yi","family":"Hong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Deying","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qiang","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hua","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,9,10]]},"reference":[{"issue":"3","key":"1386_CR1","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1016\/j.tre.2011.11.003","volume":"48","author":"L \u00d6zdamar","year":"2012","unstructured":"\u00d6zdamar, L., Demir, O.: A hierarchical clustering and routing procedure for large scale disaster relief logistics planning. Transp. Res. E: Logist. Transp. Rev. 48(3), 591\u2013602 (2012)","journal-title":"Transp. Res. E: Logist. Transp. Rev."},{"key":"1386_CR2","first-page":"612","volume":"2006","author":"M Lahmar","year":"2016","unstructured":"Lahmar, M., Assavapokee, T., Ardekani, S.A.: A dynamic transportation planning support system for hurricane evacuation. Intell. Transp. Syst. Conf. 2006, 612\u2013617 (2016)","journal-title":"Intell. Transp. Syst. Conf."},{"key":"1386_CR3","volume-title":"Optimization Algorithms for Networks and Graphs","author":"J Evans","year":"1992","unstructured":"Evans, J.: Optimization Algorithms for Networks and Graphs, 2nd edn. Marcel Dekker, New York (1992)","edition":"2"},{"issue":"2","key":"1386_CR4","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/BF02592101","volume":"73","author":"BV Cherkassky","year":"1996","unstructured":"Cherkassky, B.V., Goldberg, A.V., Radzik, T.: Shortest paths algorithms: theory and experimental evaluation. Math. Program. 73(2), 129\u2013174 (1996)","journal-title":"Math. Program."},{"key":"1386_CR5","doi-asserted-by":"publisher","first-page":"1077","DOI":"10.1016\/j.ssci.2009.01.001","volume":"47","author":"SE Jalali","year":"2009","unstructured":"Jalali, S.E., Noroozi, M.: Determination of the optimal escape routes of underground mine networks in emergency cases. Saf. Sci. 47, 1077\u20131082 (2009)","journal-title":"Saf. Sci."},{"key":"1386_CR6","unstructured":"Ernesto, Q., Vieira, M., Marta, M., Braz, P.: A New Algorithm for Ranking Loopless Paths. Technical Report, Univ. de Coimbra (1997)"},{"issue":"2","key":"1386_CR7","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1137\/S0097539795290477","volume":"28","author":"D Eppstein","year":"1998","unstructured":"Eppstein, D.: Finding the k shortest paths. SIAM J. Comput. 28(2), 652\u201373 (1998)","journal-title":"SIAM J. Comput."},{"key":"1386_CR8","doi-asserted-by":"publisher","first-page":"2975","DOI":"10.1016\/j.cor.2013.07.005","volume":"40","author":"W Jin","year":"2013","unstructured":"Jin, W., Chen, S.P., Jiang, H.: Finding the K shortest paths in a time-schedule network with constraints on arcs. Comput. Oper. Res. 40, 2975\u20132982 (2013)","journal-title":"Comput. Oper. Res."},{"key":"1386_CR9","doi-asserted-by":"publisher","first-page":"2852","DOI":"10.1016\/j.cor.2013.06.014","volume":"40","author":"D Sever","year":"2013","unstructured":"Sever, D., Dellaert, N.P., van Woensel, T., de Kok, A.G.: Dynamic shortest path problems: hybrid routing policies considering network disruptions. Comput. Oper. Res. 40, 2852\u20132863 (2013)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"1386_CR10","doi-asserted-by":"crossref","first-page":"265","DOI":"10.3934\/jimo.2015.11.265","volume":"11","author":"ND Tanka","year":"2015","unstructured":"Tanka, N.D.: A survey on models and algorithms for discrete evacuation planning network problems. J. Ind. Manag. Optim. 11(1), 265\u2013289 (2015)","journal-title":"J. Ind. Manag. Optim."},{"issue":"1","key":"1386_CR11","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1016\/0377-2217(88)90382-7","volume":"35","author":"W Choi","year":"1988","unstructured":"Choi, W., Hamacher, H.W., Tufekci, S.: Modeling of building evacuation problems by network flows with side constraints. Eur. J. Oper. Res. 35(1), 98\u2013110 (1988)","journal-title":"Eur. J. Oper. Res."},{"key":"1386_CR12","doi-asserted-by":"publisher","first-page":"58","DOI":"10.3141\/2041-07","volume":"2041","author":"Y Liu","year":"2008","unstructured":"Liu, Y., Chang, G.L., Liu, Y., Lai, X.R.: Corridor-based emergency evacuation system for Washington, DC: system development and case study. Transp. Res. Rec. J. Transp. Res. Board 2041, 58\u201367 (2008)","journal-title":"Transp. Res. Rec. J. Transp. Res. Board"},{"key":"1386_CR13","doi-asserted-by":"crossref","unstructured":"Vogiatzis, C, Walteros, J.L., Pardalos, P.M.: Evacuation through clustering techniques. In: Models, Algorithms, and Technologies for Network Analysis, pp. 185\u2013198. Springer, New York (2013)","DOI":"10.1007\/978-1-4614-5574-5_10"},{"key":"1386_CR14","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1016\/j.future.2017.05.014","volume":"83","author":"M Lujak","year":"2018","unstructured":"Lujak, M., Giordani, S.: Centrality measures for evacuation: finding agile evacuation routes. Future Gener. Comput. Syst. 83, 401\u2013412 (2018)","journal-title":"Future Gener. Comput. Syst."},{"key":"1386_CR15","volume-title":"Evacuation Modeling and Betweenness Centrality. International Conference on Dynamics of Disasters","author":"C Vogiatzis","year":"2016","unstructured":"Vogiatzis, C., Pardalos, P.M.: Evacuation Modeling and Betweenness Centrality. International Conference on Dynamics of Disasters. Springer, Cham (2016)"},{"issue":"2","key":"1386_CR16","doi-asserted-by":"publisher","first-page":"186","DOI":"10.3390\/ijgi1020186","volume":"1","author":"M Goetz","year":"2012","unstructured":"Goetz, M., Zipf, A.: Using crowdsourced geodata for agent-based indoor evacuation simulations. ISPRS Int. J. Geo-Inf. 1(2), 186\u2013208 (2012)","journal-title":"ISPRS Int. J. Geo-Inf."},{"key":"1386_CR17","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/j.buildenv.2011.09.021","volume":"49","author":"FQ Tang","year":"2012","unstructured":"Tang, F.Q., Ren, A.: GIS-based 3D evacuation simulation for indoor fire. Build. Environ. 49, 193\u2013202 (2012)","journal-title":"Build. Environ."},{"issue":"3","key":"1386_CR18","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/j.jsm.2015.10.001","volume":"14","author":"V Adjiski","year":"2015","unstructured":"Adjiski, V., Mirakovski, D., Despodov, Z., Mijalkovski, S.: Simulation and optimization of evacuation routes in case of fire in underground mines. J. Sustain. Min. 14(3), 133\u2013143 (2015)","journal-title":"J. Sustain. Min."},{"key":"1386_CR19","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1145\/322077.322090","volume":"25","author":"MR Garey","year":"1978","unstructured":"Garey, M.R., Johnson, D.: Strong NP-completeness results: motivation, examples, and implications. J. ACM 25, 499\u2013508 (1978)","journal-title":"J. ACM"}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-018-1386-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10957-018-1386-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-018-1386-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,1]],"date-time":"2022-09-01T01:36:23Z","timestamp":1661996183000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10957-018-1386-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,9,10]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,4]]}},"alternative-id":["1386"],"URL":"https:\/\/doi.org\/10.1007\/s10957-018-1386-2","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"type":"print","value":"0022-3239"},{"type":"electronic","value":"1573-2878"}],"subject":[],"published":{"date-parts":[[2018,9,10]]},"assertion":[{"value":"21 March 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 August 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 September 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}