{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T21:23:17Z","timestamp":1743024197487,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030046507"},{"type":"electronic","value":"9783030046514"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-04651-4_16","type":"book-chapter","created":{"date-parts":[[2018,11,15]],"date-time":"2018-11-15T19:56:50Z","timestamp":1542311810000},"page":"233-245","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Min-Max-Flow Based Algorithm for Evacuation Network Planning in Restricted Spaces"],"prefix":"10.1007","author":[{"given":"Yi","family":"Hong","sequence":"first","affiliation":[]},{"given":"Jiandong","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Chuanwen","family":"Luo","sequence":"additional","affiliation":[]},{"given":"Deying","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,11,16]]},"reference":[{"key":"16_CR1","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":"16_CR2","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":"16_CR3","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."},{"unstructured":"Martins, E.D.Q.V., Queir, E., Dos Santos, J.L.E., Martins, V., Margarida, M., Pascoal, M.M.B.: A new algorithm for ranking loopless paths. Technical report, Univ. de Coimbra (1997)","key":"16_CR4"},{"issue":"2","key":"16_CR5","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\u2013673 (1998)","journal-title":"SIAM J. Comput."},{"key":"16_CR6","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., 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":"16_CR7","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., Van Woensel, T., De Kok, T.: Dynamic shortest path problems: hybrid routing policies considering network disruptions. Comput. Oper. Res. 40, 2852\u20132863 (2013)","journal-title":"Comput. Oper. Res."},{"doi-asserted-by":"crossref","unstructured":"Hong, Y., Li, D., Wu, Q., Xu, H. Dynamic route network planning problem for emergency evacuation in restricted space scenarios. J. Adv. Transp. Article ID 4295419, 13 p. (2018)","key":"16_CR8","DOI":"10.1155\/2018\/4295419"},{"doi-asserted-by":"publisher","unstructured":"Hong, Y., Li, D., Wu, Q., Xu, H.: Priority-oriented route network planning for evacuation in constrained space scenarios. J. Optim. Theory Appl. (2018). https:\/\/doi.org\/10.1007\/s10957-018-1386-2","key":"16_CR9","DOI":"10.1007\/s10957-018-1386-2"},{"key":"16_CR10","series-title":"Springer Proceedings in Mathematics & Statistics","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/978-1-4614-5574-5_10","volume-title":"Models, Algorithms, and Technologies for Network Analysis","author":"C Vogiatzis","year":"2013","unstructured":"Vogiatzis, C., Walteros, J.L., Pardalos, P.M.: Evacuation through clustering techniques. In: Goldengorin, B., Kalyagin, V., Pardalos, P. (eds.) Models, Algorithms, and Technologies for Network Analysis. Springer Proceedings in Mathematics & Statistics, vol. 32, pp. 185\u2013198. Springer, New York (2013). https:\/\/doi.org\/10.1007\/978-1-4614-5574-5_10"},{"key":"16_CR11","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. Futur. Gener. Comput. Syst. 83, 401\u2013412 (2018)","journal-title":"Futur. Gener. Comput. Syst."},{"key":"16_CR12","series-title":"Springer Proceedings in Mathematics & Statistics","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/978-3-319-43709-5_17","volume-title":"Dynamics of Disasters\u2014Key Concepts, Models, Algorithms, and Insights","author":"C Vogiatzis","year":"2016","unstructured":"Vogiatzis, C., Pardalos, P.M.: Evacuation modeling and betweenness centrality. In: Kotsireas, I., Nagurney, A., Pardalos, P. (eds.) DOD 2015 2016. Springer Proceedings in Mathematics & Statistics, vol. 185, pp. 345\u2013359. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-43709-5_17"},{"key":"16_CR13","volume-title":"Network Flows: Theory, Algorithms, and Applications","author":"RK Ahuja","year":"1993","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, Inc., Upper Saddle River (1993). ISBN 0-13-617549-X"},{"key":"16_CR14","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1287\/mnsc.14.3.205","volume":"14","author":"M Klein","year":"1967","unstructured":"Klein, M.: A primal method for minimal cost flows with applications to the assignment and transportation problems. Manag. Sci. 14, 205\u2013220 (1967)","journal-title":"Manag. Sci."},{"issue":"4","key":"16_CR15","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1145\/76359.76368","volume":"36","author":"AV Goldberg","year":"1989","unstructured":"Goldberg, A.V., Tarjan, R.E.: Finding minimum-cost circulations by canceling negative cycles. J. ACM 36(4), 873\u2013886 (1989)","journal-title":"J. ACM"},{"issue":"2","key":"16_CR16","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1145\/321694.321699","volume":"19","author":"J Edmonds","year":"1972","unstructured":"Edmonds, J., Karp, R.M.: Theoretical improvements in algorithmic efficiency for network flow problems. J. ACM 19(2), 248\u2013264 (1972)","journal-title":"J. ACM"},{"key":"16_CR17","first-page":"109","volume":"78","author":"JB Orlin","year":"1997","unstructured":"Orlin, J.B.: A polynomial time primal network simplex algorithm for minimum cost flows. Math. Program. 78, 109\u2013129 (1997)","journal-title":"Math. Program."},{"issue":"1","key":"16_CR18","doi-asserted-by":"publisher","first-page":"265","DOI":"10.3934\/jimo.2015.11.265","volume":"11","author":"Tanka Nath Dhamala","year":"2015","unstructured":"Tanka Nath Dhamala: 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":"16_CR19","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":"16_CR20","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.: 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"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-04651-4_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T15:48:12Z","timestamp":1710344892000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-04651-4_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030046507","9783030046514"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-04651-4_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"16 November 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Combinatorial Optimization and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Atlanta, GA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 December 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoa2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/spacl.kennesaw.edu\/cocoa2018\/cfp.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}