{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,8]],"date-time":"2025-05-08T16:42:19Z","timestamp":1746722539082,"version":"3.37.3"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2022,9,22]],"date-time":"2022-09-22T00:00:00Z","timestamp":1663804800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,9,22]],"date-time":"2022-09-22T00:00:00Z","timestamp":1663804800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Oper. Res. Forum"],"DOI":"10.1007\/s43069-022-00168-2","type":"journal-article","created":{"date-parts":[[2022,9,22]],"date-time":"2022-09-22T11:03:58Z","timestamp":1663844638000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Efficient Algorithms for Abstract Flow with Partial Switching"],"prefix":"10.1007","volume":"3","author":[{"given":"Durga Prasad","family":"Khanal","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2545-3658","authenticated-orcid":false,"given":"Urmila","family":"Pyakurel","sequence":"additional","affiliation":[]},{"given":"Tanka Nath","family":"Dhamala","sequence":"additional","affiliation":[]},{"given":"Stephan","family":"Dempe","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,9,22]]},"reference":[{"key":"168_CR1","unstructured":"United Nations International Strategy for Disaster Reduction (UNISDR) Geneva, Switzerland, (2009). Terminology on Disaster Risk Reduction. https:\/\/unisdr.org\/files\/7817_UNISDRTerminologyEnglish.pdf"},{"key":"168_CR2","doi-asserted-by":"publisher","first-page":"399","DOI":"10.4153\/CJM-1956-045-5","volume":"8","author":"LR Ford","year":"1956","unstructured":"Ford LR, Fulkerson DR (1956) Maximal flow through a network. Can J Math 8:399\u2013404","journal-title":"Can J Math"},{"key":"168_CR3","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1007\/BF01580250","volume":"6","author":"AJ Hoffman","year":"1974","unstructured":"Hoffman AJ (1974) A generalization of max flow - min cut. Math. Prog. 6:352\u2013359","journal-title":"Math. Prog."},{"key":"168_CR4","unstructured":"McCormick ST (1996) A polynomial algorithm for abstract maximum flow. In Proceeding of the 7th annual ACM-SIAM symposium on discrete algorithms, 490-497"},{"key":"168_CR5","first-page":"97","volume":"5035","author":"M Martens","year":"2008","unstructured":"Martens M, McCormick ST (2008) A polynomial algorithm for weighted abstract flow. In Integer Programming and Combinatorial Optimization, Lecture Notes in Computer Sciences 5035:97\u2013111","journal-title":"In Integer Programming and Combinatorial Optimization, Lecture Notes in Computer Sciences"},{"key":"168_CR6","unstructured":"Martens M (2007) Path-Constrained Network Flows. PhD Thesis, Technical University, Berlin, Germany"},{"key":"168_CR7","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1016\/j.tcs.2014.04.012","volume":"544","author":"J-PW Kappmeier","year":"2014","unstructured":"Kappmeier J-PW, Matuschke J, Peis B (2014) Abstract flow over time: A first step towards solving dynamic packing problems. Theor Comput Sci. Algorithms Combin 544:74\u201383","journal-title":"Theor Comput Sci. Algorithms Combin"},{"key":"168_CR8","unstructured":"Kappmeier PW (2015) Generalizations of flows over time with application in evacuation optimization. PhD Thesis, Technical University, Berlin, Germany"},{"issue":"6","key":"168_CR9","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1016\/j.tra.2011.03.008","volume":"45","author":"S Bretschneider","year":"2011","unstructured":"Bretschneider S, Kimms A (2011) A basic mathematical model for evacuation problems in urban areas. Transp Res A Policy Pract 45(6):523\u2013539","journal-title":"Transp Res A Policy Pract"},{"key":"168_CR10","doi-asserted-by":"publisher","unstructured":"Vogiatzis C, Walteros JL, Pardalos PM (2013) 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. Springer, New York, NY. https:\/\/doi.org\/10.1007\/978-1-4614-5574-5_10","DOI":"10.1007\/978-1-4614-5574-5_10"},{"key":"168_CR11","doi-asserted-by":"crossref","unstructured":"Kim S, Shekhar S (2005) Contraflow network reconfiguration for evacuation planning: a summary of results, In: Proceedings of 13th ACM Symposium on Advances in Geographic Information Systems GIS vol. 05, 250-259","DOI":"10.1145\/1097064.1097099"},{"key":"168_CR12","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/s10479-017-2427-1","volume":"254","author":"U Pyakurel","year":"2017","unstructured":"Pyakurel U, Dhamala TN, Dempe S (2017) Efficient continuous contraflow algorithms for evacuation planning problems. Annals of Operations Research (ANOR) 254:335\u2013364","journal-title":"Annals of Operations Research (ANOR)"},{"key":"168_CR13","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-018-3031-8","author":"U Pyakurel","year":"2019","unstructured":"Pyakurel U, Nath HN, Dhamala TN (2019) Partial contraflow with path reversals for evacuation planning. Ann Oper Res. https:\/\/doi.org\/10.1007\/s10479-018-3031-8","journal-title":"Ann Oper Res"},{"key":"168_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/s43069-020-00033-0","author":"U Pyakurel","year":"2020","unstructured":"Pyakurel U, Dempe S (2020) Network flow with intermediate storage: models and algorithms. SN Operations Research Forum. https:\/\/doi.org\/10.1007\/s43069-020-00033-0","journal-title":"SN Operations Research Forum"},{"key":"168_CR15","doi-asserted-by":"publisher","unstructured":"Pyakurel U, Dempe S (2021) Universal maximum flow with intermediate storage for evacuation planning. In: Kotsireas I.S., Nagurney A., Pardalos P.M., Tsokas A. (eds) Dynamics of Disasters. Springer Optimization and Its Applications\u00a0vol. 169, Springer, Cham. 2021. https:\/\/doi.org\/10.1007\/978-3-030-64973-9_14","DOI":"10.1007\/978-3-030-64973-9_14"},{"key":"168_CR16","doi-asserted-by":"publisher","unstructured":"Khanal DP, Pyakurel U, Dhamala TN (2021) Maximum multi-commodity flow with intermediate storage. Mathematical Problems in Engineering, 2021, Article ID 5063207. https:\/\/doi.org\/10.1155\/2021\/5063207","DOI":"10.1155\/2021\/5063207"},{"issue":"2","key":"168_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.3126\/nmsr.v38i2.42700","volume":"38","author":"DP Khanal","year":"2021","unstructured":"Khanal DP, Pyakurel U, Dempe S (2021) Dynamic contraflow with orientation dependent transit times allowing intermediate storage. Nepali Math Sci Rep 38(2):1\u201312. https:\/\/doi.org\/10.3126\/nmsr.v38i2.42700","journal-title":"Nepali Math Sci Rep"},{"key":"168_CR18","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2022.06.054","author":"U Pyakurel","year":"2022","unstructured":"Pyakurel U, Khanal DP, Dhamala TN (2022) Abstract network flow with intermediate storage for evacuation planning. Eur J Oper Res. https:\/\/doi.org\/10.1016\/j.ejor.2022.06.054","journal-title":"Eur J Oper Res"},{"key":"168_CR19","unstructured":"Ford LR, Fulkerson DR (1962) Flows in networks. Princeton University Press Princeton New Jersey"},{"key":"168_CR20","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/BF01415527","volume":"37","author":"RE Burkard","year":"1993","unstructured":"Burkard RE, Dlaska K, Klinz B (1993) The quickest flow problem. ZOR- Methods and Models of Operational Research 37:31\u201358","journal-title":"ZOR- Methods and Models of Operational Research"},{"key":"168_CR21","doi-asserted-by":"crossref","unstructured":"Lin M, Jaillet P (2015) On the quickest flow problem in dynamic networks: a parametric min-cost flow approach. In: Proceeding of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, Philadelphia: Society for Industrial and Applied Mathmatics 1343-1356","DOI":"10.1137\/1.9781611973730.89"},{"issue":"3","key":"168_CR22","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1287\/moor.15.3.430","volume":"15","author":"AV Goldberg","year":"1990","unstructured":"Goldberg AV, Tarjan RE (1990) Finding minimum-cost circulations by successive approximation. Math Oper Res 15(3):430\u2013466","journal-title":"Math Oper Res"},{"key":"168_CR23","doi-asserted-by":"publisher","first-page":"2079","DOI":"10.1007\/s11425-017-9264-3","volume":"61","author":"U Pyakurel","year":"2018","unstructured":"Pyakurel U, Nath HN, Dhamala TN (2018) Efficient contraflow algorithms for quickest evacuation planning. SCIENCE CHINA Math 61:2079\u20132100","journal-title":"SCIENCE CHINA Math"},{"key":"168_CR24","doi-asserted-by":"publisher","first-page":"198","DOI":"10.3844\/jmssp.2020.198.211","volume":"16","author":"TN Dhamala","year":"2020","unstructured":"Dhamala TN, Gupta SP, Khanal DP, Pyakurel U (2020) Quickest multi-commodity flow over time with partial lane reversals. J Math Stat 16:198\u2013211","journal-title":"J Math Stat"},{"issue":"2","key":"168_CR25","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1002\/net.20278","volume":"53","author":"AK Andreas","year":"2009","unstructured":"Andreas AK, Smith JC (2009) Decomposition algorithms for the design of a nonsimultaneous capacitated evacuation tree network. Networks: An International Journal 53(2):91\u2013103","journal-title":"Networks: An International Journal"},{"key":"168_CR26","doi-asserted-by":"publisher","unstructured":"Achrekar O, Vogiatzis C (2018) Evacuation trees with contraflow and divergence considerations. In: Kotsireas I, Nagurney A, Pardalos P. (eds) Dynamics of Disasters. DOD 2017. Springer Optimization and Its Applications vol 140. Springer, Cham. https:\/\/doi.org\/10.1007\/978-3-319-97442-2_1","DOI":"10.1007\/978-3-319-97442-2_1"},{"key":"168_CR27","doi-asserted-by":"crossref","unstructured":"Purba DSD, Kontou E, Vogiatzis C (2021) Evacuation network modeling for alternative fuel vehicles. arXiv preprint.\u00a0arXiv:2109.01578","DOI":"10.1016\/j.trc.2022.103837"},{"key":"168_CR28","first-page":"24","volume-title":"Mathematical modeling of evacuation problems: a state of art","author":"H Hamacher","year":"2001","unstructured":"Hamacher H, Tjandra S (2001) Mathematical modeling of evacuation problems: a state of art. Berichte des Frauenhofer ITWM, Nr, p 24"},{"key":"168_CR29","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1177\/0361198106196400114","volume":"1","author":"Y Liu","year":"2006","unstructured":"Liu Y, Lai X, Chang GL (2006) Cell-based network optimization model for staged evacuation planning under emergencies. Transportation Res. Rec. J Transportation Res Board 1:127\u2013135","journal-title":"J Transportation Res Board"},{"key":"168_CR30","doi-asserted-by":"crossref","unstructured":"Lu Q, George B, Shekhar S (2005) Capacity constrained routing algorithms for evacuation planning: a Summary of results. In: Bauzer Medeiros, E. M. B. E., C., ed., Lecture Notes in Computer Science, vol. 3633, Springer, Berlin, 291-307","DOI":"10.1007\/11535331_17"},{"key":"168_CR31","doi-asserted-by":"publisher","DOI":"10.1002\/net.21981","volume-title":"Large-scale zone-based evacuation planning","author":"MH Hasan","year":"2020","unstructured":"Hasan MH, Van Hentenryck P (2020) Large-scale zone-based evacuation planning. Models and algorithms, Part I. https:\/\/doi.org\/10.1002\/net.21981"},{"key":"168_CR32","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1002\/NET.21980","volume":"77","author":"MH Hasan","year":"2021","unstructured":"Hasan MH, Van Hentenryck P (2021) Large-scale zone-based evacuation planning, Part II: Macroscopic and microscopic evaluations. Networks 77:341\u2013358. https:\/\/doi.org\/10.1002\/NET.21980","journal-title":"Networks"},{"key":"168_CR33","unstructured":"Khanal DP, Pyakurel U, Dhamala TN. Abstract flow with partial switching for evacuation planning, Under Review"}],"container-title":["Operations Research Forum"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s43069-022-00168-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s43069-022-00168-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s43069-022-00168-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,31]],"date-time":"2023-01-31T11:05:41Z","timestamp":1675163141000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s43069-022-00168-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,22]]},"references-count":33,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2022,12]]}},"alternative-id":["168"],"URL":"https:\/\/doi.org\/10.1007\/s43069-022-00168-2","relation":{},"ISSN":["2662-2556"],"issn-type":[{"type":"electronic","value":"2662-2556"}],"subject":[],"published":{"date-parts":[[2022,9,22]]},"assertion":[{"value":"29 September 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 August 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 September 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interest"}}],"article-number":"55"}}