{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T19:30:33Z","timestamp":1768591833876,"version":"3.49.0"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2025,7,24]],"date-time":"2025-07-24T00:00:00Z","timestamp":1753315200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,7,24]],"date-time":"2025-07-24T00:00:00Z","timestamp":1753315200000},"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-025-00474-5","type":"journal-article","created":{"date-parts":[[2025,7,24]],"date-time":"2025-07-24T15:02:00Z","timestamp":1753369320000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Temporally Repeated Maximum Dynamic Flow with Intermediate Storage"],"prefix":"10.1007","volume":"6","author":[{"given":"Durga Prasad","family":"Khanal","sequence":"first","affiliation":[]},{"given":"Urmila","family":"Pyakurel","sequence":"additional","affiliation":[]},{"given":"Stephan","family":"Dempe","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,7,24]]},"reference":[{"key":"474_CR1","volume-title":"Network flows: theory","author":"RK Ahuja","year":"1993","unstructured":"Ahuja RK, Magnanti TL, Orlin JB (1993) Network flows: theory. Algorithm and Applications, Prentice Hall, Englewood Cliffs"},{"key":"474_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02216922","volume":"20","author":"JE Aronson","year":"1989","unstructured":"Aronson JE (1989) A survey of dynamic network flows. Ann Oper Res 20:1\u201366","journal-title":"Ann Oper Res"},{"key":"474_CR3","unstructured":"Arulselvan A (2009) Network model for disaster management, Ph.D. thesis. University of Florida Gainesville"},{"key":"474_CR4","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/j.dam.2006.04.030","volume":"155","author":"N Baumann","year":"2007","unstructured":"Baumann N, K\u00f6hler EM (2007) Approximating earliest arrival flows with flow-dependent transit times. Discrete Appl Math 155:161\u2013171","journal-title":"Discrete Appl Math"},{"issue":"6","key":"474_CR5","first-page":"523","volume":"45","author":"S Bretschneider","year":"2011","unstructured":"Bretschneider S, Kimms A (2011) A basic mathematical model for evacuation problems in urban areas. Trans Res Part A: Policy Pract 45(6):523\u2013539","journal-title":"Trans Res Part A: Policy Pract"},{"key":"474_CR6","first-page":"101","volume":"15","author":"TN Dhamala","year":"2018","unstructured":"Dhamala TN, Pyakurel U, Dempe S (2018) A critical survey on the network optimization algorithms for evacuation planning problems. Int J Oper Res 15:101\u2013133","journal-title":"Int J Oper Res"},{"key":"474_CR7","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"},{"key":"474_CR8","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra EW (1959) A note on two problems in connexion with graphs. Numer Math 1:269\u2013271","journal-title":"Numer Math"},{"key":"474_CR9","unstructured":"Dinic EA (1970) Algorithm for solution of a problem of maximum flow in a network with power estimation. Soviet Mathematics - Doklady. Doklady 11:1277\u20131280. English translation by RF. Rinehart"},{"issue":"2","key":"474_CR10","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1145\/321694.321699","volume":"19","author":"J Edmonds","year":"1972","unstructured":"Edmonds J, Karp RM (1972) Theoretical improvements in algorithmic efficiency for network flow problems. Journal of the ACM 19(2):248\u2013264","journal-title":"Journal of the ACM"},{"issue":"3","key":"474_CR11","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1002\/net.1030","volume":"38","author":"L Fleischer","year":"2001","unstructured":"Fleischer L (2001) Universally maximum flows with piecewise constant capacities. Networks 38(3):115\u2013125","journal-title":"Networks"},{"key":"474_CR12","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/S0167-6377(98)00037-6","volume":"23","author":"L Fleischer","year":"1998","unstructured":"Fleischer L, Tardos \u00c9 (1998) Efficient continuous-time dynamic network flow algorithms. Oper Res Lett 23:71\u201380","journal-title":"Oper Res Lett"},{"key":"474_CR13","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":"474_CR14","volume-title":"Flows in networks","author":"LR Ford","year":"1962","unstructured":"Ford LR, Fulkerson DR (1962) Flows in networks. Princeton University Press"},{"issue":"1","key":"474_CR15","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1307\/mmj\/1028998140","volume":"6","author":"D Gale","year":"1959","unstructured":"Gale D (1959) Transient flows in networks. Mich Math J 6(1):59\u201363","journal-title":"Mich Math J"},{"key":"474_CR16","doi-asserted-by":"publisher","unstructured":"Gerasimenko E, Kureichik V, Kuliev E (2022) Maximum dynamic flow model for hesitant fuzzy evacuation with intermediate storage at nodes, In: Kahraman C., Cebi S., Cevik Onar S., Oztaysi B., Tolga A. C., Sari I. U. (eds) Intelligent and Fuzzy Techniques for Emerging Conditions and Digital Transformation. INFUS 2021. Lecture Notes in Networks and Systems, vol 307, Springer, Cham. https:\/\/doi.org\/10.1007\/978-3-030-85626-7_81","DOI":"10.1007\/978-3-030-85626-7_81"},{"key":"474_CR17","doi-asserted-by":"publisher","unstructured":"Goldberg AV, Tarjan RE (1986) A new approach to the maximum flow problem. Proceedings of the eighteenth annual ACM symposium on Theory of computing \u2013 STOC \u201986. pp 136. https:\/\/doi.org\/10.1145\/12130.12144","DOI":"10.1145\/12130.12144"},{"key":"474_CR18","unstructured":"Hamacher H, Tjandra S (2002) Mathematical modeling of evacuation problems: a state of the art, In M. Schreckenberger & S.D. Sharma (Eds.), Pedestrain and Evacuation Dynamics (pp 227\u2013266)"},{"key":"474_CR19","doi-asserted-by":"publisher","unstructured":"Hasan MH, Van Hentenryck P (2020). Large-scale zone-based evacuation planning-part I: models and algorithms. https:\/\/doi.org\/10.1002\/net.21981","DOI":"10.1002\/net.21981"},{"key":"474_CR20","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":"474_CR21","unstructured":"Hoppe B, Tardos \u00c9 (1994) Polynomial time algorithms for some evacuation problems, In: Fifth Annual ACM\u2013SIAM symposium on discrete algorithms (SODA\u201994), pp 433\u2013441"},{"key":"474_CR22","unstructured":"International Federation of Red Cross and Red Crescent Societies (IFRC) (2021) New report: alarming levels of climate-related displacement, 16 March. https:\/\/media.ifrc.org\/ifrc\/press-release\/new-report-alarming-levels-climate-related-displacement\/"},{"key":"474_CR23","unstructured":"Khanal DP (2024) Multi-commodity dynamic flow problems with intermediate storage and varying transit times, PhD Thesis, Tribhuvan University, Institute of Science and Technology, Kathmandu, Nepal"},{"key":"474_CR24","doi-asserted-by":"publisher","DOI":"10.1155\/2021\/5063207","author":"DP Khanal","year":"2021","unstructured":"Khanal DP, Pyakurel U, Dhamala TN (2021) Maximum multi-commodity flow with intermediate storage. Mathematical Problems in Engineering. https:\/\/doi.org\/10.1155\/2021\/5063207","journal-title":"Mathematical Problems in Engineering"},{"issue":"2","key":"474_CR25","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":"474_CR26","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 SystemsGIS, vol 05 ,pp 250\u2013259","DOI":"10.1145\/1097064.1097099"},{"key":"474_CR27","doi-asserted-by":"publisher","first-page":"1115","DOI":"10.1109\/TKDE.2007.190722","volume":"20","author":"S Kim","year":"2008","unstructured":"Kim S, Shekhar S, Min M (2008) Contraflow transportation network reconfiguration for evacuation route planning. IEEE Trans Knowl Data Eng 20:1115\u20131129","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"474_CR28","unstructured":"Kotnyek B (2003) An annotated overview of dynamic network flows, Rapport de recherche 4936, INRIA Sophia Antipolis"},{"key":"474_CR29","doi-asserted-by":"crossref","unstructured":"Kotsireas IS, Nagurney A, Pardalos PM (2018) Dynamics of disasters-algorithmic approaches and applications. Springer Optimization and Its Applications","DOI":"10.1007\/978-3-319-97442-2"},{"key":"474_CR30","doi-asserted-by":"crossref","unstructured":"Liu Y, Lai X, Chang GL (2006) Cell-based network optimization model for staged evacuation planning under emergencies. TranS Res Rec.: J Trans Res Board 1:127\u2013135","DOI":"10.1177\/0361198106196400114"},{"key":"474_CR31","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1287\/opre.21.2.517","volume":"21","author":"E Minieka","year":"1973","unstructured":"Minieka E (1973) Maximal, lexicographic, and dynamic network flows. Oper Res 21:517\u2013527","journal-title":"Oper Res"},{"key":"474_CR32","doi-asserted-by":"publisher","unstructured":"Nath HN, Pyakurel U, Dhamala TN (2021) Network reconfiguration with orientation-dependent transit times, International Journal of Mathematics and Mathematical Sciences, Article ID 6613622, 11 pages. https:\/\/doi.org\/10.1155\/2021\/6613622","DOI":"10.1155\/2021\/6613622"},{"key":"474_CR33","doi-asserted-by":"publisher","unstructured":"Nayak S (2020) Fundamentals of optimization techniques with algorithms. Elsevier Science. https:\/\/doi.org\/10.1016\/b978-0-12-821126-7.00009-7","DOI":"10.1016\/b978-0-12-821126-7.00009-7"},{"key":"474_CR34","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1002\/net.3230180405","volume":"18","author":"RG Ogier","year":"1988","unstructured":"Ogier RG (1988) Minimum delay routing in continuous-time dynamic networks with piecewise constant capacities. Networks 18:303\u2013318","journal-title":"Networks"},{"key":"474_CR35","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s43069-020-00033-0","volume":"1","author":"U Pyakurel","year":"2020","unstructured":"Pyakurel U, Dempe S (2020) Network flow with intermediate storage: models and algorithms. SN Oper Res Forum 1:1\u201323","journal-title":"SN Oper Res Forum"},{"key":"474_CR36","doi-asserted-by":"publisher","unstructured":"Pyakurel U, Dempe S (2021) Universal maximum flow with intermediate storage for evacuation planning, In I. S. Kotsireas, A. Nagurney, P. M. Pardalos, & A. Tsokas A. (Eds.), Dynamics of Disasters, Springer Optimization and Its Applications, vol 169. Springer, Cham. https:\/\/doi.org\/10.1007\/978-3-030-64973-9_14","DOI":"10.1007\/978-3-030-64973-9_14"},{"key":"474_CR37","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. Ann Oper Res 254:335\u2013364","journal-title":"Ann Oper Res"},{"key":"474_CR38","doi-asserted-by":"publisher","unstructured":"Pyakurel U, Khanal DP, Dhamala TN (2022) Abstract network flow with intermediate storage for evacuation planning. European Journal of Operational Research. https:\/\/doi.org\/10.1016\/j.ejor.2022.06.054","DOI":"10.1016\/j.ejor.2022.06.054"},{"key":"474_CR39","doi-asserted-by":"publisher","first-page":"1","DOI":"10.3390\/math7100993","volume":"7","author":"U Pyakurel","year":"2019","unstructured":"Pyakurel U, Nath HN, Dempe S, Dhamala TN (2019) Efficient dynamic flow algorithms for evacuation planning problems with partial lane reversal. Mathematics 7:1\u201329","journal-title":"Mathematics"},{"key":"474_CR40","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/s10878-008-9175-8","volume":"19","author":"S Rebennack","year":"2010","unstructured":"Rebennack S, Arulselvan A, Elefteriadou L, Pardalos PM (2010) Complexity analysis for maximum flow problems with arc reversals. J Combin Optim 19:200\u2013216","journal-title":"J Combin Optim"},{"key":"474_CR41","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1002\/net.20398","volume":"10","author":"S Ruzika","year":"2011","unstructured":"Ruzika S, Sperber H, Steiner M (2011) Earliest arrival flows on series-parallel graphs. Networks 10:169\u2013173","journal-title":"Networks"},{"key":"474_CR42","unstructured":"Tjandra SA (2003) Dynamic network optimization with application to the evacuation problem. PhD thesis, University of Kaiserslautern. Germany"},{"key":"474_CR43","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":"474_CR44","doi-asserted-by":"publisher","first-page":"1602","DOI":"10.1287\/opre.19.7.1602","volume":"19","author":"WL Wilkinson","year":"1971","unstructured":"Wilkinson WL (1971) An algorithm for universal maximal dynamic flows in a network. Oper Res 19:1602\u20131612","journal-title":"Oper Res"}],"container-title":["Operations Research Forum"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s43069-025-00474-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s43069-025-00474-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s43069-025-00474-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,10]],"date-time":"2025-12-10T16:08:34Z","timestamp":1765382914000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s43069-025-00474-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,24]]},"references-count":44,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2025,9]]}},"alternative-id":["474"],"URL":"https:\/\/doi.org\/10.1007\/s43069-025-00474-5","relation":{},"ISSN":["2662-2556"],"issn-type":[{"value":"2662-2556","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,7,24]]},"assertion":[{"value":"3 June 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 May 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 July 2025","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":"Competing Interests"}}],"article-number":"101"}}