{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T15:34:15Z","timestamp":1753889655353,"version":"3.40.3"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,12,28]],"date-time":"2024-12-28T00:00:00Z","timestamp":1735344000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,28]],"date-time":"2024-12-28T00:00:00Z","timestamp":1735344000000},"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-024-00410-z","type":"journal-article","created":{"date-parts":[[2024,12,28]],"date-time":"2024-12-28T10:56:52Z","timestamp":1735383412000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Maximum Dynamic FlowLoc with Intermediate Storage: A Temporally Repeated Approach"],"prefix":"10.1007","volume":"6","author":[{"given":"Sachin","family":"Wagle","sequence":"first","affiliation":[]},{"given":"Durga Prasad","family":"Khanal","sequence":"additional","affiliation":[]},{"given":"Urmila","family":"Pyakurel","sequence":"additional","affiliation":[]},{"given":"Stephan","family":"Dempe","sequence":"additional","affiliation":[]},{"given":"Tanka Nath","family":"Dhamala","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,12,28]]},"reference":[{"key":"410_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.trb.2013.03.002","volume":"54","author":"S An","year":"2013","unstructured":"An S, Cui N, Li X, Ouyang Y (2013) Location planning for transit-based evacuation under the risk of service disruption. Trans Res Part B: Method logic 54:1\u201316","journal-title":"Trans Res Part B: Method logic"},{"issue":"2","key":"410_CR2","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/j.dam.2006.04.030","volume":"155","author":"N Baumann","year":"2007","unstructured":"Baumann N, K\u00f6hler E (2007) Approximating earliest arrival flows with flow-dependent transit times. Disc Applied Math 155(2):161\u2013171","journal-title":"Disc Applied Math"},{"key":"410_CR3","doi-asserted-by":"crossref","first-page":"265","DOI":"10.3934\/jimo.2015.11.265","volume":"11","author":"TN Dhamala","year":"2015","unstructured":"Dhamala TN (2015) A survey on models and algorithms for discrete evacuation planning network problems. J Indust Manage Opt 11:265\u2013289","journal-title":"J Indust Manage Opt"},{"key":"410_CR4","doi-asserted-by":"crossref","unstructured":"Dhamala TN, Adhikari MC, Khanal DP, Pyakurel U (2024) Generalized maximum flow over time with intermediate storage, Annals of Operations Res, 1-24","DOI":"10.1007\/s10479-023-05773-w"},{"issue":"4","key":"410_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s43069-023-00270-z","volume":"4","author":"TN Dhamala","year":"2023","unstructured":"Dhamala TN, Nagurney A (2023) In memoriam: Urmila Pyakurel (1980\u20132023). Operation Res Forum 4(4):1\u201313","journal-title":"Operation Res Forum"},{"key":"410_CR6","first-page":"1","volume":"10","author":"TN Dhamala","year":"2013","unstructured":"Dhamala TN, Pyakurel U (2013) Earliest arrival contraflow problems on series-parallel graphs, International Journal of. Operations Res 10:1\u201313","journal-title":"Operations Res"},{"issue":"3","key":"410_CR7","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 Operation Res 15(3):101\u2013133","journal-title":"Int J Operation Res"},{"key":"410_CR8","doi-asserted-by":"publisher","DOI":"10.3934\/jimo.2023064","author":"TN Dhamala","year":"2023","unstructured":"Dhamala TN, Wagle S, Pyakurel U (2023) FlowLoc problems with maximum excess flow. J Indust Manage Opt. https:\/\/doi.org\/10.3934\/jimo.2023064","journal-title":"J Indust Manage Opt"},{"issue":"1","key":"410_CR9","first-page":"13","volume":"16","author":"RC Dhungana","year":"2019","unstructured":"Dhungana RC, Dhamala TN (2019) Maximum FlowLoc problems with network reconfiguration. Int J Operation Res 16(1):13\u201326","journal-title":"Int J Operation Res"},{"issue":"3","key":"410_CR10","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","volume":"15","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra EW (1959) A note on two problems in connection with graphs. Num Math 15(3):269\u2013271","journal-title":"Num Math"},{"key":"410_CR11","doi-asserted-by":"crossref","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. Canadian J Math 8:399\u2013404","journal-title":"Canadian J Math"},{"issue":"1","key":"410_CR12","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1307\/mmj\/1028998140","volume":"6","author":"D Gale","year":"1959","unstructured":"Gale D (1959) Transient flows in networks. Michigan Math J 6(1):59\u201363","journal-title":"Michigan Math J"},{"key":"410_CR13","doi-asserted-by":"crossref","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 AC, Sari I.U. (eds) Intelligent and Fuzzy Techniques for Emerging Conditions and Digital Transformation: Proceedings of the INFUS 2021 Conference, held 24-26 August, 2021, 1 (2022), 696 - 704","DOI":"10.1007\/978-3-030-85626-7_81"},{"key":"410_CR14","doi-asserted-by":"crossref","first-page":"783","DOI":"10.1016\/j.trpro.2014.09.088","volume":"2","author":"M Goerigk","year":"2014","unstructured":"Goerigk M, Gr\u00fcn B, He\u00dfler P (2014) Combining bus evacuation with location decisions: a branch-and-price approach. Trans Res Procedia 2:783\u2013791","journal-title":"Trans Res Procedia"},{"key":"410_CR15","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/s10479-011-0953-9","volume":"207","author":"HW Hamacher","year":"2013","unstructured":"Hamacher HW, Haller S, Rupp B (2013) Flow location (FlowLoc) problems: dynamic network flows and location models for evacuation planning. Annals of Operation Res 207:161\u2013180","journal-title":"Annals of Operation Res"},{"key":"410_CR16","unstructured":"Hoppe B, Tardos E (1994) Polynomial time algorithms for some evacuation problems, Proceedings of the 5th Annual ACM\u2013SIAM Symposium on Discrete Algorithms, 433-441"},{"key":"410_CR17","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1287\/moor.25.1.36.15211","volume":"25","author":"B Hoppe","year":"2000","unstructured":"Hoppe B, Tardos E (2000) The quickest transshipment problem. Math Operation Res 25:36\u201362","journal-title":"Math Operation Res"},{"key":"410_CR18","unstructured":"Khanal DP (2023) Multi-commodity dynamic flow problems with intermediate storage and varying transit times, PhD Thesis, Institute of Science & Technology, Tribhuvan University, Nepal,"},{"key":"410_CR19","doi-asserted-by":"publisher","unstructured":"Khanal DP, Pyakurel U, Dhamala TN (2021) Maximum multicommodity flow with intermediate storage, Math Prob Eng. Hindawi. https:\/\/doi.org\/10.1155\/2021\/5063207","DOI":"10.1155\/2021\/5063207"},{"issue":"2","key":"410_CR20","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. The Nepali Math Sci Report 38(2):1\u201312. https:\/\/doi.org\/10.3126\/nmsr.v38i2.42700","journal-title":"The Nepali Math Sci Report"},{"key":"410_CR21","unstructured":"Khanal DP, Pyakurel U, Dempe S (2022) Temporally repeated maximum dynamic flow with intermediate storage, Preprint, 2022-01 TU Bergakademie Friberg,"},{"key":"410_CR22","doi-asserted-by":"crossref","unstructured":"Kim S, Shekhar S, M Min M (2008) Contraflow transportation network reconfiguration for the evacuation route planning, IEEE Trans Knowl Data Eng, 20(8):1115-1129","DOI":"10.1109\/TKDE.2007.190722"},{"key":"410_CR23","doi-asserted-by":"crossref","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. Operation Res 21:517\u2013527","journal-title":"Operation Res"},{"key":"410_CR24","doi-asserted-by":"publisher","DOI":"10.3934\/jimo.2020102","author":"HN Nath","year":"2020","unstructured":"Nath HN, Pyakurel U, Dhamala TN, Dempe S (2020) Dynamic network flow location models and algorithms for evacuation planning. J Indust Manage Opt. https:\/\/doi.org\/10.3934\/jimo.2020102","journal-title":"J Indust Manage Opt"},{"key":"410_CR25","doi-asserted-by":"publisher","unstructured":"Nath HN, Pyakurel U, Dhamala TN (2021) Network reconfiguration with orientation-dependent transit times, Int J Math Math Sci, 1-11, https:\/\/doi.org\/10.1155\/2021\/6613622","DOI":"10.1155\/2021\/6613622"},{"key":"410_CR26","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 Operation Res Forum 1:1\u201323. https:\/\/doi.org\/10.1007\/s43069-020-00033-0","journal-title":"SN Operation Res Forum"},{"key":"410_CR27","doi-asserted-by":"publisher","unstructured":"Pyakurel U, Dempe S (2021) Universal maximum flow with intermediate storage for evacuatioin planning., In: Kotsireas IS, Nagurney A, Pardalos PM, Tsokas A. (eds) Dynamics of Disasters. Springer Optimization and Its Applications Springer, Cham., 169, 229-241, https:\/\/doi.org\/10.1007\/978-3-030-64973-9_14","DOI":"10.1007\/978-3-030-64973-9_14"},{"key":"410_CR28","doi-asserted-by":"publisher","unstructured":"Pyakurel U, Khanal DP, Dhamala TN. Abstract network flow with intermediate storage for evacuation planning, European J Operational Res, https:\/\/doi.org\/10.1016\/j.ejor.2022.06.054","DOI":"10.1016\/j.ejor.2022.06.054"},{"key":"410_CR29","doi-asserted-by":"crossref","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. Netw 10:169\u2013173","journal-title":"Netw"},{"key":"410_CR30","unstructured":"Ritchie H, Roser M (2014) Natural disasters, Our World in Data, https:\/\/ourworldindata.org\/natural-disasters"},{"key":"410_CR31","doi-asserted-by":"crossref","first-page":"106","DOI":"10.3126\/nmsr.v40i1-2.61506","volume":"40","author":"S Wagle","year":"2023","unstructured":"Wagle S, Dhamala TN, Pyakurel U (2023) Prioritized max-FlowLoc for evacuation planning. The Nepali Math Sci Report 40:106\u2013119","journal-title":"The Nepali Math Sci Report"},{"key":"410_CR32","volume-title":"Theory of the location industries $$\\ddot{U}$$ber den Standort der Industrien, University Chicago Press (1909)","author":"A Weber","year":"1929","unstructured":"Weber A (1929) Theory of the location industries $$\\ddot{U}$$ber den Standort der Industrien, University Chicago Press (1909). English translation by C.J, Friedrich"},{"issue":"7","key":"410_CR33","doi-asserted-by":"crossref","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. Operation Res 19(7):1602\u20131612","journal-title":"Operation Res"}],"container-title":["Operations Research Forum"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s43069-024-00410-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s43069-024-00410-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s43069-024-00410-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,30]],"date-time":"2025-03-30T11:15:01Z","timestamp":1743333301000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s43069-024-00410-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,28]]},"references-count":33,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2025,3]]}},"alternative-id":["410"],"URL":"https:\/\/doi.org\/10.1007\/s43069-024-00410-z","relation":{},"ISSN":["2662-2556"],"issn-type":[{"type":"electronic","value":"2662-2556"}],"subject":[],"published":{"date-parts":[[2024,12,28]]},"assertion":[{"value":"9 June 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 December 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 December 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics Approval"}},{"value":"Not applicable","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent to Participate"}},{"value":"Classical subscription mode without any payment.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for Publication"}},{"value":"The authors declare no competing interests.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interest"}}],"article-number":"6"}}