{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T05:07:02Z","timestamp":1740114422706,"version":"3.37.3"},"reference-count":21,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2024,1,2]],"date-time":"2024-01-02T00:00:00Z","timestamp":1704153600000},"content-version":"vor","delay-in-days":1462,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2020,1]]},"DOI":"10.1016\/j.tcs.2019.10.028","type":"journal-article","created":{"date-parts":[[2019,10,18]],"date-time":"2019-10-18T15:38:58Z","timestamp":1571413138000},"page":"196-206","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":3,"special_numbering":"C","title":["Balanced-flow algorithm for path network planning in hierarchical spaces"],"prefix":"10.1016","volume":"803","author":[{"given":"Yi","family":"Hong","sequence":"first","affiliation":[]},{"given":"Jiandong","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Deying","family":"Li","sequence":"additional","affiliation":[]},{"given":"Chuanwen","family":"Luo","sequence":"additional","affiliation":[]},{"given":"Mengjie","family":"Chang","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"year":"1992","series-title":"Optimization Algorithms for Networks and Graphs","author":"Evans","key":"10.1016\/j.tcs.2019.10.028_br0010"},{"issue":"2","key":"10.1016\/j.tcs.2019.10.028_br0020","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/BF02592101","article-title":"Shortest paths algorithms: theory and experimental evaluation","volume":"73","author":"Cherkassky","year":"1996","journal-title":"Math. Program."},{"key":"10.1016\/j.tcs.2019.10.028_br0030","doi-asserted-by":"crossref","first-page":"1077","DOI":"10.1016\/j.ssci.2009.01.001","article-title":"Determination of the optimal escape routes of underground mine networks in emergency cases","volume":"47","author":"Jalali","year":"2009","journal-title":"Saf. Sci."},{"year":"1997","series-title":"A new algorithm for ranking loopless paths","author":"de Queir\u00f3s Vieira Martins","key":"10.1016\/j.tcs.2019.10.028_br0040"},{"issue":"2","key":"10.1016\/j.tcs.2019.10.028_br0050","doi-asserted-by":"crossref","first-page":"652","DOI":"10.1137\/S0097539795290477","article-title":"Finding the k shortest paths","volume":"28","author":"Eppstein","year":"1998","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.tcs.2019.10.028_br0060","doi-asserted-by":"crossref","first-page":"2975","DOI":"10.1016\/j.cor.2013.07.005","article-title":"Finding the K shortest paths in a time-schedule network with constraints on arcs","volume":"40","author":"Jin","year":"2013","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.tcs.2019.10.028_br0070","doi-asserted-by":"crossref","first-page":"2852","DOI":"10.1016\/j.cor.2013.06.014","article-title":"Dynamic shortest path problems: hybrid routing policies considering network disruptions","volume":"40","author":"Sever","year":"2013","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.tcs.2019.10.028_br0080","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1016\/j.eswa.2018.08.008","article-title":"Multi-objective multi-robot path planning in continuous environment using an enhanced genetic algorithm","volume":"115","author":"Nazarahari","year":"2019","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.tcs.2019.10.028_br0090","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1287\/mnsc.14.3.205","article-title":"A primal method for minimal cost flows with applications to the assignment and transportation problems","volume":"14","author":"Klein","year":"1967","journal-title":"Manag. Sci."},{"issue":"4","key":"10.1016\/j.tcs.2019.10.028_br0100","doi-asserted-by":"crossref","first-page":"873","DOI":"10.1145\/76359.76368","article-title":"Finding minimum-cost circulations by canceling negative cycles","volume":"36","author":"Goldberg","year":"1989","journal-title":"J. ACM"},{"issue":"2","key":"10.1016\/j.tcs.2019.10.028_br0110","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1145\/321694.321699","article-title":"Theoretical improvements in algorithmic efficiency for network flow problems","volume":"19","author":"Edmonds","year":"1972","journal-title":"J. ACM"},{"key":"10.1016\/j.tcs.2019.10.028_br0120","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF02614365","article-title":"A polynomial time primal network simplex algorithm for minimum cost flows","volume":"78","author":"Orlin","year":"1997","journal-title":"Math. Program."},{"key":"10.1016\/j.tcs.2019.10.028_br0130","article-title":"Minimum cost noncrossing flow problem on layered networks","author":"Kuban Alt\u0131nel","year":"2018","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"10.1016\/j.tcs.2019.10.028_br0140","doi-asserted-by":"crossref","first-page":"265","DOI":"10.3934\/jimo.2015.11.265","article-title":"A survey on models and algorithms for discrete evacuation planning network problems","volume":"11","author":"Dhamala","year":"2015","journal-title":"J. Ind. Manag. Optim."},{"issue":"1","key":"10.1016\/j.tcs.2019.10.028_br0150","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1016\/0377-2217(88)90382-7","article-title":"Modeling of building evacuation problems by network flows with side constraints","volume":"35","author":"Choi","year":"1988","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/j.tcs.2019.10.028_br0160","doi-asserted-by":"crossref","first-page":"58","DOI":"10.3141\/2041-07","article-title":"Corridor-based emergency evacuation system for Washington, DC: system development and case study","volume":"2041","author":"Liu","year":"2008","journal-title":"Transp. Res. Rec."},{"key":"10.1016\/j.tcs.2019.10.028_br0170","doi-asserted-by":"crossref","DOI":"10.1155\/2018\/4295419","article-title":"Dynamic route network planning problem for emergency evacuation in restricted space scenarios","volume":"2018","author":"Hong","year":"2018","journal-title":"J. Adv. Transp."},{"key":"10.1016\/j.tcs.2019.10.028_br0180","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/s10957-018-1386-2","article-title":"Priority-oriented route network planning for evacuation in constrained space scenarios","volume":"181","author":"Hong","year":"2019","journal-title":"J. Optim. Theory Appl."},{"key":"10.1016\/j.tcs.2019.10.028_br0190","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1016\/j.ins.2018.11.045","article-title":"An efficient approach to 3D path planning","volume":"478","author":"Han","year":"2019","journal-title":"Inf. Sci."},{"key":"10.1016\/j.tcs.2019.10.028_br0200","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1016\/j.biosystemseng.2018.04.010","article-title":"Partial field coverage based on two path planning patterns","volume":"171","author":"Graf Plessen","year":"2018","journal-title":"Biosyst. Eng."},{"key":"10.1016\/j.tcs.2019.10.028_br0210","series-title":"COCOA 2018","first-page":"233","article-title":"Min-max-flow based algorithm for evacuation network planning in restricted spaces","volume":"vol. 11346","author":"Hong","year":"2018"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397519306577?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397519306577?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,4,6]],"date-time":"2024-04-06T16:41:01Z","timestamp":1712421661000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397519306577"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1]]},"references-count":21,"alternative-id":["S0304397519306577"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2019.10.028","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[2020,1]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Balanced-flow algorithm for path network planning in hierarchical spaces","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2019.10.028","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2019 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}