Efficient Dynamic Flow Algorithms for Evacuation Planning Problems with Partial Lane Reversal

Contraflow technique has gained a considerable focus in evacuation planning research over the past several years. In this work, we design efficient algorithms to solve the maximum, lex-maximum, earliest arrival, and quickest dynamic flow problems having constant attributes and their generalizations...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Mathematics (Basel) Ročník 7; číslo 10; s. 993
Hlavní autori: Pyakurel, Urmila, Nath, Hari Nandan, Dempe, Stephan, Dhamala, Tanka Nath
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Basel MDPI AG 01.10.2019
Predmet:
Algorithms
Approximation
contraflow configuration
Control theory
dynamic flow
Earthquakes
Emergency preparedness
Evacuation
evacuation planning
Heuristic
Humanitarianism
Integer programming
logistic supports
Mathematics
network optimization
Optimization techniques
partial lane reversals, algorithms and complexity
Planning
Polynomials
Reconfiguration
Road design
Time dependence
Traffic congestion
Traffic flow
Transit time
Transportation networks
Tsunamis
United States > US
Japan
Nepal
ISSN:2227-7390, 2227-7390
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Abstract Contraflow technique has gained a considerable focus in evacuation planning research over the past several years. In this work, we design efficient algorithms to solve the maximum, lex-maximum, earliest arrival, and quickest dynamic flow problems having constant attributes and their generalizations with partial contraflow reconfiguration in the context of evacuation planning. The partial static contraflow problems, that are foundations to the dynamic flows, are also studied. Moreover, the contraflow model with inflow-dependent transit time on arcs is introduced. A strongly polynomial time algorithm to compute approximate solution of the quickest partial contraflow problem on two terminal networks is presented, which is substantiated by numerical computations considering Kathmandu road network as an evacuation network. Our results show that the quickest time to evacuate a flow of value 100,000 units is reduced by more than 42% using the partial contraflow technique, and the difference is more with the increase in the flow value. Moreover, the technique keeps the record of the portions of the road network not used by the evacuees.
AbstractList Contraflow technique has gained a considerable focus in evacuation planning research over the past several years. In this work, we design efficient algorithms to solve the maximum, lex-maximum, earliest arrival, and quickest dynamic flow problems having constant attributes and their generalizations with partial contraflow reconfiguration in the context of evacuation planning. The partial static contraflow problems, that are foundations to the dynamic flows, are also studied. Moreover, the contraflow model with inflow-dependent transit time on arcs is introduced. A strongly polynomial time algorithm to compute approximate solution of the quickest partial contraflow problem on two terminal networks is presented, which is substantiated by numerical computations considering Kathmandu road network as an evacuation network. Our results show that the quickest time to evacuate a flow of value 100,000 units is reduced by more than 42% using the partial contraflow technique, and the difference is more with the increase in the flow value. Moreover, the technique keeps the record of the portions of the road network not used by the evacuees.
Author Pyakurel, Urmila
Dhamala, Tanka Nath
Nath, Hari Nandan
Dempe, Stephan
Author_xml – sequence: 1
  givenname: Urmila
  surname: Pyakurel
  fullname: Pyakurel, Urmila
– sequence: 2
  givenname: Hari Nandan
  surname: Nath
  fullname: Nath, Hari Nandan
– sequence: 3
  givenname: Stephan
  orcidid: 0000-0001-6344-5152
  surname: Dempe
  fullname: Dempe, Stephan
– sequence: 4
  givenname: Tanka Nath
  surname: Dhamala
  fullname: Dhamala, Tanka Nath
BookMark eNptUU1rWzEQFCGFpmlO_QOCHIMT6Ul-ejqG1PkAQ01pj0Ws5JUjI0uJnpyQfx85biCU7mWXZWZ2mP1CDlNOSMg3zs6F0OxiA_Vecca0FgfkqOs6NVFtf_hh_kxOxnHNWmkuBqmPyJ-Z98EFTJV-f0mwCY5ex_xML-Mql1DvNyP1udDZE7gt1JATXURIKaQVXZRsIzbAc8PRBZQaINI5JKQ_8QnLCPEr-eQhjnjytx-T39ezX1e3k_mPm7ury_nEiV7WiehAoXV6mIJU4D2Hzg1eWuyZB8vk0lvHxNS6HpVYggWvkUur5BR7pZkWx-Rur7vMsDYPJWygvJgMwbwtclmZnT0X0Qwole2xhaR62ZRsp6AHNvgBeu5917RO91oPJT9ucaxmnbclNfumm8pBCyb57iLfo1zJ41jQGxfqW0C1QIiGM7N7ivnwlMY5-4fz7vR_6FetH5D9
CitedBy_id crossref_primary_10_1155_2020_1605806
crossref_primary_10_1038_s41598_025_96536_z
crossref_primary_10_1007_s43069_020_00033_0
crossref_primary_10_1109_ACCESS_2022_3193145
crossref_primary_10_3390_math8091426
crossref_primary_10_1016_j_ejor_2022_06_054
crossref_primary_10_1155_2020_2676378
crossref_primary_10_3390_math8040648
crossref_primary_10_1016_j_rineng_2025_106198
crossref_primary_10_1007_s43069_025_00474_5
crossref_primary_10_1109_ACCESS_2024_3404406
crossref_primary_10_1155_2021_6613622
crossref_primary_10_1007_s12597_023_00690_9
crossref_primary_10_1155_2021_5063207
crossref_primary_10_3390_su14084780
crossref_primary_10_1007_s10479_023_05210_y
crossref_primary_10_3390_e24101485
crossref_primary_10_1007_s43069_023_00270_z
crossref_primary_10_3390_math12131984
Cites_doi 10.1287/opre.19.7.1602
10.1002/net.1030
10.1109/ITSIM.2008.4631982
10.1307/mmj/1028998140
10.1016/j.tcs.2014.04.012
10.1287/moor.1090.0382
10.1109/TKDE.2007.190722
10.3934/jimo.2016028
10.1137/1.9781611973730.89
10.1007/s10479-018-3031-8
10.1007/BF01415527
10.1016/S0167-6377(98)00037-6
10.1287/opre.21.2.517
10.1515/9781400875184
10.1007/3-540-45749-6_53
10.1007/978-3-642-29116-6
10.1145/2628036
10.3126/ijorn.v8i1.51849
10.1287/moor.25.1.36.15211
10.3934/jimo.2015.11.265
10.1016/S0965-8564(03)00007-7
10.1002/net.20398
10.1007/s10479-017-2427-1
10.1007/978-3-319-43709-5
10.1016/j.physa.2013.10.048
10.1007/s10479-006-0068-x
10.1007/978-3-642-33090-2_48
10.1007/s10479-016-2302-5
10.1016/j.ejor.2005.05.016
10.1007/s10878-008-9175-8
10.1145/234533.234534
10.1016/j.endm.2010.05.077
10.1002/net.21726
10.1002/nav.20288
10.1007/s11425-017-9264-3
10.1287/moor.4.4.414
ContentType Journal Article
Copyright 2019 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
Copyright_xml – notice: 2019 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
DBID AAYXX
CITATION
3V.
7SC
7TB
7XB
8AL
8FD
8FE
8FG
8FK
ABJCF
ABUWG
AFKRA
ARAPS
AZQEC
BENPR
BGLVJ
CCPQU
DWQXO
FR3
GNUQQ
HCIFZ
JQ2
K7-
KR7
L6V
L7M
L~C
L~D
M0N
M7S
P62
PHGZM
PHGZT
PIMPY
PKEHL
PQEST
PQGLB
PQQKQ
PQUKI
PTHSS
Q9U
DOA
DOI 10.3390/math7100993
DatabaseName CrossRef
ProQuest Central (Corporate)
Computer and Information Systems Abstracts
Mechanical & Transportation Engineering Abstracts
ProQuest Central (purchase pre-March 2016)
Computing Database (Alumni Edition)
Technology Research Database
ProQuest SciTech Collection
ProQuest Technology Collection
ProQuest Central (Alumni) (purchase pre-March 2016)
Materials Science & Engineering Collection
ProQuest Central (Alumni)
ProQuest Central UK/Ireland
Advanced Technologies & Computer Science Collection
ProQuest Central Essentials
ProQuest Central
Technology collection
ProQuest One Community College
ProQuest Central
Engineering Research Database
ProQuest Central Student
ProQuest SciTech Premium Collection
ProQuest Computer Science Collection
Computer Science Database
Civil Engineering Abstracts
ProQuest Engineering Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
Computing Database
Engineering Database
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Premium
ProQuest One Academic
Publicly Available Content Database
ProQuest One Academic Middle East (New)
ProQuest One Academic Eastern Edition (DO NOT USE)
ProQuest One Applied & Life Sciences
ProQuest One Academic (retired)
ProQuest One Academic UKI Edition
Engineering collection
ProQuest Central Basic
DOAJ Directory of Open Access Journals
DatabaseTitle CrossRef
Publicly Available Content Database
Computer Science Database
ProQuest Central Student
Technology Collection
Technology Research Database
Computer and Information Systems Abstracts – Academic
ProQuest One Academic Middle East (New)
Mechanical & Transportation Engineering Abstracts
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Essentials
ProQuest Computer Science Collection
Computer and Information Systems Abstracts
ProQuest Central (Alumni Edition)
SciTech Premium Collection
ProQuest One Community College
ProQuest Central
ProQuest One Applied & Life Sciences
ProQuest Engineering Collection
ProQuest Central Korea
ProQuest Central (New)
Advanced Technologies Database with Aerospace
Engineering Collection
Advanced Technologies & Aerospace Collection
Civil Engineering Abstracts
ProQuest Computing
Engineering Database
ProQuest Central Basic
ProQuest Computing (Alumni Edition)
ProQuest One Academic Eastern Edition
ProQuest Technology Collection
ProQuest SciTech Collection
Computer and Information Systems Abstracts Professional
ProQuest One Academic UKI Edition
Materials Science & Engineering Collection
Engineering Research Database
ProQuest One Academic
ProQuest One Academic (New)
ProQuest Central (Alumni)
DatabaseTitleList
CrossRef
Publicly Available Content Database
Database_xml – sequence: 1
  dbid: DOA
  name: DOAJ Directory of Open Access Journals
  url: https://www.doaj.org/
  sourceTypes: Open Website
– sequence: 2
  dbid: PIMPY
  name: Publicly Available Content Database
  url: http://search.proquest.com/publiccontent
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
Discipline Mathematics
EISSN 2227-7390
ExternalDocumentID oai_doaj_org_article_8e47b6e993764bafb27a6a08f8a61ff2
10_3390_math7100993
GeographicLocations United States--US
Japan
Nepal
GeographicLocations_xml – name: Nepal
– name: United States--US
– name: Japan
GroupedDBID -~X
5VS
85S
8FE
8FG
AADQD
AAFWJ
AAYXX
ABDBF
ABJCF
ABPPZ
ABUWG
ACIPV
ACIWK
ADBBV
AFFHD
AFKRA
AFPKN
AFZYC
ALMA_UNASSIGNED_HOLDINGS
AMVHM
ARAPS
AZQEC
BCNDV
BENPR
BGLVJ
BPHCQ
CCPQU
CITATION
DWQXO
GNUQQ
GROUPED_DOAJ
HCIFZ
IAO
K6V
K7-
KQ8
L6V
M7S
MODMG
M~E
OK1
PHGZM
PHGZT
PIMPY
PQGLB
PQQKQ
PROAC
PTHSS
RNS
3V.
7SC
7TB
7XB
8AL
8FD
8FK
FR3
JQ2
KR7
L7M
L~C
L~D
M0N
P62
PKEHL
PQEST
PQUKI
Q9U
ID FETCH-LOGICAL-c364t-32a7ebc985a47aff1a2c8f4be60fab04dfbc035bc6e73dabaf9e14b745e679093
IEDL.DBID DOA
ISICitedReferencesCount 21
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000498404700122&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 2227-7390
IngestDate Tue Oct 14 15:09:08 EDT 2025
Fri Jul 25 11:50:16 EDT 2025
Sat Nov 29 07:13:23 EST 2025
Tue Nov 18 22:02:05 EST 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 10
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c364t-32a7ebc985a47aff1a2c8f4be60fab04dfbc035bc6e73dabaf9e14b745e679093
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ORCID 0000-0001-6344-5152
OpenAccessLink https://doaj.org/article/8e47b6e993764bafb27a6a08f8a61ff2
PQID 2548930419
PQPubID 2032364
ParticipantIDs doaj_primary_oai_doaj_org_article_8e47b6e993764bafb27a6a08f8a61ff2
proquest_journals_2548930419
crossref_citationtrail_10_3390_math7100993
crossref_primary_10_3390_math7100993
PublicationCentury 2000
PublicationDate 2019-10-01
PublicationDateYYYYMMDD 2019-10-01
PublicationDate_xml – month: 10
  year: 2019
  text: 2019-10-01
  day: 01
PublicationDecade 2010
PublicationPlace Basel
PublicationPlace_xml – name: Basel
PublicationTitle Mathematics (Basel)
PublicationYear 2019
Publisher MDPI AG
Publisher_xml – name: MDPI AG
References Smith (ref_34) 2014; 395
Pyakurel (ref_30) 2016; 2016
Minieka (ref_16) 1973; 21
ref_13
Fleischer (ref_25) 1998; 23
ref_35
Dhamala (ref_3) 2015; 11
ref_12
Pyakurel (ref_24) 2017; 253
ref_33
ref_10
Wilkinson (ref_15) 1971; 19
Goldberg (ref_36) 2014; 57
Chen (ref_9) 2008; 55
Fleischer (ref_22) 2001; 38
ref_17
Ruzika (ref_18) 2011; 10
Saho (ref_44) 2017; 69
Pyakurel (ref_32) 2017; 13
Altay (ref_6) 2006; 175
Karger (ref_38) 1996; 43
Pyakurel (ref_31) 2015; 12
Kappmeier (ref_46) 2014; 544
Hoppe (ref_19) 2000; 25
Rebennack (ref_28) 2010; 19
Kim (ref_27) 2008; 20
Pascoal (ref_7) 2006; 147
Cova (ref_5) 2003; 37
ref_47
ref_23
ref_43
Dhamala (ref_11) 2018; 15
ref_41
Burkard (ref_20) 1993; 37
Pyakurel (ref_40) 2014; 3
Megiddo (ref_42) 1979; 4
ref_2
Gale (ref_14) 1959; 6
ref_26
Pyakurel (ref_37) 2018; 61
Pyakurel (ref_39) 2019; 8
ref_48
ref_8
Pyakurel (ref_1) 2017; 254
Schmidt (ref_45) 2010; 36
ref_4
Baumann (ref_21) 2009; 34
Dhamala (ref_29) 2013; 10
References_xml – volume: 19
  start-page: 1602
  year: 1971
  ident: ref_15
  article-title: An algorithm for universal maximal dynamic flows in a network
  publication-title: Oper. Res.
  doi: 10.1287/opre.19.7.1602
– volume: 38
  start-page: 115
  year: 2001
  ident: ref_22
  article-title: Universally maximum flow with piecewise-constant capacities
  publication-title: Networks
  doi: 10.1002/net.1030
– ident: ref_10
  doi: 10.1109/ITSIM.2008.4631982
– volume: 6
  start-page: 59
  year: 1959
  ident: ref_14
  article-title: Transient flows in networks
  publication-title: Mich. Math. J.
  doi: 10.1307/mmj/1028998140
– volume: 544
  start-page: 74
  year: 2014
  ident: ref_46
  article-title: Abstract flows over time: A first step towards solving dynamic packing problems
  publication-title: Theor. Comput. Sci.
  doi: 10.1016/j.tcs.2014.04.012
– ident: ref_26
– volume: 34
  start-page: 499
  year: 2009
  ident: ref_21
  article-title: Earliest arrival flows with multiple sources
  publication-title: Math. Oper. Res.
  doi: 10.1287/moor.1090.0382
– volume: 20
  start-page: 1115
  year: 2008
  ident: ref_27
  article-title: Contraflow transportation network reconfiguration for evacuation route planning
  publication-title: IEEE Trans. Knowl. Data Eng.
  doi: 10.1109/TKDE.2007.190722
– ident: ref_47
– volume: 13
  start-page: 489
  year: 2017
  ident: ref_32
  article-title: Evacuation planning by earliest arrival contraflow
  publication-title: J. Ind. Manag. Optim.
  doi: 10.3934/jimo.2016028
– ident: ref_43
  doi: 10.1137/1.9781611973730.89
– volume: 15
  start-page: 101
  year: 2018
  ident: ref_11
  article-title: A critical survey on the network optimization algorithms for evacuation planning problems
  publication-title: Int. J. Oper. Res.
– ident: ref_33
  doi: 10.1007/s10479-018-3031-8
– volume: 37
  start-page: 31
  year: 1993
  ident: ref_20
  article-title: The quickest flow problem
  publication-title: ZOR-Methods Model. Oper. Res.
  doi: 10.1007/BF01415527
– volume: 23
  start-page: 71
  year: 1998
  ident: ref_25
  article-title: Efficient continuous-time dynamic network flow algorithms
  publication-title: Oper. Res. Lett.
  doi: 10.1016/S0167-6377(98)00037-6
– volume: 21
  start-page: 517
  year: 1973
  ident: ref_16
  article-title: Maximal, lexicographic, and dynamic network flows
  publication-title: Oper. Res.
  doi: 10.1287/opre.21.2.517
– ident: ref_13
  doi: 10.1515/9781400875184
– ident: ref_2
  doi: 10.1007/3-540-45749-6_53
– ident: ref_41
  doi: 10.1007/978-3-642-29116-6
– ident: ref_35
– volume: 57
  start-page: 82
  year: 2014
  ident: ref_36
  article-title: Efficient maximum flow algorithms
  publication-title: Commun. ACM
  doi: 10.1145/2628036
– volume: 8
  start-page: 27
  year: 2019
  ident: ref_39
  article-title: Earliest arrival flow with partial lane reversals for evacuation planning
  publication-title: Int. J. Oper. Res. Nepal
  doi: 10.3126/ijorn.v8i1.51849
– volume: 25
  start-page: 36
  year: 2000
  ident: ref_19
  article-title: The quickest transshipment problem
  publication-title: Math. Oper. Res.
  doi: 10.1287/moor.25.1.36.15211
– volume: 3
  start-page: 27
  year: 2014
  ident: ref_40
  article-title: Generalized maximum dynamic contraflow on lossy network
  publication-title: Int. J. Oper. Res. Nepal
– volume: 11
  start-page: 265
  year: 2015
  ident: ref_3
  article-title: A survey on models and algorithms for discrete evacuation planning network problems
  publication-title: J. Ind. Manag. Optim.
  doi: 10.3934/jimo.2015.11.265
– volume: 37
  start-page: 579
  year: 2003
  ident: ref_5
  article-title: A network flow model for lane-based evacuation routing
  publication-title: Transp. Res. Part Policy Pract.
  doi: 10.1016/S0965-8564(03)00007-7
– ident: ref_8
– ident: ref_4
– volume: 10
  start-page: 169
  year: 2011
  ident: ref_18
  article-title: Earliest arrival flows on series-parallel graphs
  publication-title: Networks
  doi: 10.1002/net.20398
– volume: 254
  start-page: 335
  year: 2017
  ident: ref_1
  article-title: Efficient continuous contraflow algorithms for evacuation planning problems
  publication-title: Ann. Oper. Res.
  doi: 10.1007/s10479-017-2427-1
– ident: ref_12
  doi: 10.1007/978-3-319-43709-5
– ident: ref_48
– volume: 12
  start-page: 36
  year: 2015
  ident: ref_31
  article-title: Models and algorithms on contraflow evacuation planning network problems
  publication-title: Int. J. Oper. Res.
– volume: 395
  start-page: 560
  year: 2014
  ident: ref_34
  article-title: M/G/c/c state dependent travel time models and properties
  publication-title: Phys. Stat. Mechan. Its Appl.
  doi: 10.1016/j.physa.2013.10.048
– volume: 10
  start-page: 1
  year: 2013
  ident: ref_29
  article-title: Earliest arrival contraflow problem on series-parallel graphs
  publication-title: Int. J. Oper. Res.
– volume: 147
  start-page: 5
  year: 2006
  ident: ref_7
  article-title: A comprehensive survey on the quickest path problem
  publication-title: Ann. Oper. Res.
  doi: 10.1007/s10479-006-0068-x
– ident: ref_23
  doi: 10.1007/978-3-642-33090-2_48
– volume: 253
  start-page: 573
  year: 2017
  ident: ref_24
  article-title: Continuous dynamic contraflow approach for evacuation planning
  publication-title: Ann. Oper. Res.
  doi: 10.1007/s10479-016-2302-5
– volume: 2016
  start-page: 368587
  year: 2016
  ident: ref_30
  article-title: Continuous time dynamic contraflow models and algorithms
  publication-title: Adv. Oper. Res. Hindawi
– volume: 175
  start-page: 475
  year: 2006
  ident: ref_6
  article-title: OR/MS research in disaster operations management
  publication-title: Eur. J. Oper. Res.
  doi: 10.1016/j.ejor.2005.05.016
– ident: ref_17
– volume: 19
  start-page: 200
  year: 2010
  ident: ref_28
  article-title: Complexity analysis for maximum flow problems with arc reversals
  publication-title: J. Comb. Optim.
  doi: 10.1007/s10878-008-9175-8
– volume: 43
  start-page: 601
  year: 1996
  ident: ref_38
  article-title: A new approach to the minimum cut problem
  publication-title: J. ACM
  doi: 10.1145/234533.234534
– volume: 36
  start-page: 607
  year: 2010
  ident: ref_45
  article-title: Earliest arrival flows in networks with multiple sinks
  publication-title: Electron. Notes Discret. Math.
  doi: 10.1016/j.endm.2010.05.077
– volume: 69
  start-page: 179
  year: 2017
  ident: ref_44
  article-title: Cancel-and-tighten algorithm for quickest flow problems
  publication-title: Networks
  doi: 10.1002/net.21726
– volume: 55
  start-page: 363
  year: 2008
  ident: ref_9
  article-title: The building evacuation problem with shared information
  publication-title: Nav. Res. Logist.
  doi: 10.1002/nav.20288
– volume: 61
  start-page: 2079
  year: 2018
  ident: ref_37
  article-title: Efficient contraflow algorithms for quickest evacuation planning
  publication-title: Sci. China Math.
  doi: 10.1007/s11425-017-9264-3
– volume: 4
  start-page: 414
  year: 1979
  ident: ref_42
  article-title: Combinatorial optimization with rational objective functions
  publication-title: Math. Oper. Res.
  doi: 10.1287/moor.4.4.414
SSID ssj0000913849
Score 2.268336
Snippet Contraflow technique has gained a considerable focus in evacuation planning research over the past several years. In this work, we design efficient algorithms...
SourceID doaj
proquest
crossref
SourceType Open Website
Aggregation Database
Enrichment Source
Index Database
StartPage 993
SubjectTerms Algorithms
Approximation
contraflow configuration
Control theory
dynamic flow
Earthquakes
Emergency preparedness
Evacuation
evacuation planning
Heuristic
Humanitarianism
Integer programming
logistic supports
Mathematics
network optimization
Optimization techniques
partial lane reversals, algorithms and complexity
Planning
Polynomials
Reconfiguration
Road design
Time dependence
Traffic congestion
Traffic flow
Transit time
Transportation networks
Tsunamis
SummonAdditionalLinks – databaseName: Engineering Database
  dbid: M7S
  link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1NT9wwELXKtgc4QCkglkLlA6dKEU488ccJbYFVDy1alSJxQdHYsRekZRc22_L3sZPsAgJx4ZpY-ZrxzPN48h4h-zw1gMjKBEuZJQBWJSoXmBgG3Hif2cyZWmxCnp6qiws9aAtuVdtWOY-JdaAuJzbWyA_CQiakVgapPry9S6JqVNxdbSU0lsjHyJKQ1q17Z4saS-S8VKCb3_J4WN0fBBR4FflstObPElHN1_8iHNc5pr_23qf7TFZbdEl7jTuskw9u_IWs_F5Qs1Yb5PKkJo0IuYYeN2r0tD-a3NPeaBguOLu6qWjAsTQgbNuwgNO5rhEdNOIzFY3FWzqIThdu9gvHjv5xsb0DR5vkvH_y9-hn0mosJJYLmCU8Q-mM1SpHkOh9iplVHowTzGMwWOmNZTw3VjjJSzTotUvBSMidkJppvkU648nYbRMK4MFmIfB66YGzUmGeOwwQy-S5YZh2yff5By9sS0AedTBGRViIROsUT6zTJfuLwbcN78brw35Eyy2GRLLs-sBkOizauVcoB9IIF5GYgPAGJpMokCmvUKTBH7tkd27Uop3BVfFo0Z23T38lywFE6abBb5d0ZtN_bo98sv9n19X0W-2QDzM57UY
  priority: 102
  providerName: ProQuest
Title Efficient Dynamic Flow Algorithms for Evacuation Planning Problems with Partial Lane Reversal
URI https://www.proquest.com/docview/2548930419
https://doaj.org/article/8e47b6e993764bafb27a6a08f8a61ff2
Volume 7
WOSCitedRecordID wos000498404700122&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVAON
  databaseName: DOAJ Directory of Open Access Journals
  customDbUrl:
  eissn: 2227-7390
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000913849
  issn: 2227-7390
  databaseCode: DOA
  dateStart: 20130101
  isFulltext: true
  titleUrlDefault: https://www.doaj.org/
  providerName: Directory of Open Access Journals
– providerCode: PRVHPJ
  databaseName: ROAD: Directory of Open Access Scholarly Resources
  customDbUrl:
  eissn: 2227-7390
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000913849
  issn: 2227-7390
  databaseCode: M~E
  dateStart: 20130101
  isFulltext: true
  titleUrlDefault: https://road.issn.org
  providerName: ISSN International Centre
– providerCode: PRVPQU
  databaseName: Computer Science Database
  customDbUrl:
  eissn: 2227-7390
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000913849
  issn: 2227-7390
  databaseCode: K7-
  dateStart: 20130301
  isFulltext: true
  titleUrlDefault: http://search.proquest.com/compscijour
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Engineering Database
  customDbUrl:
  eissn: 2227-7390
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000913849
  issn: 2227-7390
  databaseCode: M7S
  dateStart: 20130301
  isFulltext: true
  titleUrlDefault: http://search.proquest.com
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ProQuest Central
  customDbUrl:
  eissn: 2227-7390
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000913849
  issn: 2227-7390
  databaseCode: BENPR
  dateStart: 20130301
  isFulltext: true
  titleUrlDefault: https://www.proquest.com/central
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Publicly Available Content Database
  customDbUrl:
  eissn: 2227-7390
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000913849
  issn: 2227-7390
  databaseCode: PIMPY
  dateStart: 20130301
  isFulltext: true
  titleUrlDefault: http://search.proquest.com/publiccontent
  providerName: ProQuest
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1Nj9MwELXQwgEOiE9RWCof9oQUrRNP_HHchVYg2CpaQFoOKBo7NotUWrQpcOO3M47TqggkLlx8SKw4mUlm3liT9xg7kqUDRNEV2OmqAPCmMLXCwgmQLsbKV8ENYhN6sTAXF7bZk_pKPWGZHjgb7tgE0E6FlEYVOIyu0qhQmGhQlXSxFH2FtnvF1BCDbSkN2PxDnqS6_pjw32VisrFW_paCBqb-PwLxkF3md9jtERbyk3w7d9m1sLrHbp3tOFX7--zjbGB7oCTBX2QZeT5frn_wk-WnNVX4l196TgCUEzT2mb6bbwWJeJNVY3qedl15kx6aFnuDq8DPQ-rLwOUD9n4-e_f8ZTGKIxReKtgUskIdnLemRtAYY4mVNxFcUCIiWbqLzgtZO6-Clh2S5WwowWmog9JWWPmQHazWq_CIcYAIvqKIGXUEKTqDdR2QsJGrayewnLBnW3u1fmQOTwIWy5YqiGTcds-4E3a0m_w1E2b8fdppMvxuSmK5Hg6Q79vR9-2_fD9hh1u3teOn17dU8RIGE1Dax_9jjSfsJmEkm_v3DtnB5upbeMpu-O-bz_3VlF0_nS2a8-nw9tH4WhfT1D76No0_Z3S-eXXWfPgFby7mBw
linkProvider Directory of Open Access Journals
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V3LbtQwFLWqggQseFcMFPCibJCsOrbjxwKhQjtqNdPRCBWpGxSuHbutNM2UyUDVn-IbsfMYQCB2XbBNLCWOz3051-cgtMUzKwBoSaBUjAjhNNG5BGKp4DYE5pi3jdiEmkz08bGZrqHv_VmY1FbZ-8TGUZdzl_bIt2MhE0MrFZl5e_GFJNWo9He1l9BoYTHyV5exZKvfHOzG9X3F2HDv6P0-6VQFiONSLAlnoLx1RucgFISQAXM6COslDRBfsQzWUZ5bJ73iJVgIxmfCKpF7qUxDvhRd_g3BtUp2NVJktaeTODa1MO0xQM4N3Y5Z52nizzGG_xb4Gn2AP9x_E9OG9_63r3Ef3e2yZ7zTwv0BWvPVQ3TncEU9Wz9Cn_YaUowYS_HuVQXnZw4PZ_NLvDM7iRNYnp7XOObpOFYQrmU5x71uE5624jo1TpvTeJqMKj5sDJXHH3xqX4HZY_TxWua3gdareeWfICxEEI7FwBJUEJyWGvLcQ0whbZ5bCtkAve4XuHAdwXrS-ZgVsdBKaCh-QcMAba0GX7S8In8f9i4hZTUkkYE3F-aLk6LzLYX2QlnpU6YpRZyBZQokUB00yCza2wBt9iAqOg9VFz8R9PTft1-iW_tHh-NifDAZPUO3Y8Jo2mbGTbS-XHz1z9FN9215Vi9eNMaA0efrxtsPYLpNlA
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V3LbtQwFLWqKUKw4F0xUMCLskGKJrGd2F4gVJiOGLUdRQikskDh2rHbStNMmQxU_TW-jus8BhCIXRdsE0uJ43NfzvU5hOzwxAiAuIyglCwSwqpIpRlEJhbceM8sc6YRm5CzmTo60vkG-d6fhQltlb1PbBx1ubBhj3yEhQyG1lgkeuS7toh8PHl1_iUKClLhT2svp9FCZN9dXmD5Vr-cjnGtnzM22Xv_5m3UKQxElmdiFXEG0hmrVQpCgvcJMKu8MC6LPeDrlt7YmKfGZk7yEgx47RJhpEhdJnVDxITufxNTcsEGZDOfHuYf1zs8gXFTCd0eCuRcxyPMQU8Cm47W_Lcw2KgF_BEMmgg3uf0_f5s75FaXV9Pd1hDukg1X3SM3D9ektPV98mmvocvAKEvHlxWcnVo6mS8u6O78GCewOjmrKWbwFGsL2_Kf017Rieat7E5Nw7Y1zYO54cMOoHL0nQuNLTB_QD5cyfy2yKBaVO4hoUJ4YRmGHC-94HGpIE0dYHJp0tTEkAzJi36xC9tRrwcFkHmBJVhARvELMoZkZz34vGUc-fuw1wE16yGBJry5sFgeF53XKZQT0mQu5KCZwBkYJiGDWHkFWYKWOCTbPaCKznfVxU80Pfr37WfkOsKsOJjO9h-TG5hJ6rbLcZsMVsuv7gm5Zr-tTuvl084yKPl81YD7AcJ3WBU
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Efficient+Dynamic+Flow+Algorithms+for+Evacuation+Planning+Problems+with+Partial+Lane+Reversal&rft.jtitle=Mathematics+%28Basel%29&rft.au=Urmila+Pyakurel&rft.au=Hari+Nandan+Nath&rft.au=Stephan+Dempe&rft.au=Tanka+Nath+Dhamala&rft.date=2019-10-01&rft.pub=MDPI+AG&rft.eissn=2227-7390&rft.volume=7&rft.issue=10&rft.spage=993&rft_id=info:doi/10.3390%2Fmath7100993&rft.externalDBID=DOA&rft.externalDocID=oai_doaj_org_article_8e47b6e993764bafb27a6a08f8a61ff2
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2227-7390&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2227-7390&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2227-7390&client=summon