Experiences with evacuation route planning algorithms

Shekhar, Shashi; Yang, KwangSoo; Gunturi, Venkata M. V.; Manikonda, Lydia; Oliver, Dev; Zhou, Xun; George, Betsy; Kim, Sangho; Wolff, JeffreyM. R.; Lu, Qingsong

doi:10.1080/13658816.2012.719624

Cited by 74 publications

(27 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…One of the main goals of this group of studies, especially in spatial sciences, is solving the capacityconstrained shortest path (Shekhar et al 2012) or vehicle routing problems, i.e., a combinatorial optimization seeking to service a number of customers with a fleet of vehicles (Vidal et al 2013, Reed et al 2014. The problems will then be important network-constrained problems for vehicles and moving agents in the fields of transportation, distribution, and logistics.…”

Section: Motion Planningmentioning

confidence: 99%

Plain move predicate and its consistency concerning the moving agents in a network

Vahidnia

Alesheikh

2014

International Journal of Geographical Information Science

View full text Add to dashboard Cite

Advances in GIS and databases for dealing with spatiotemporal frameworks are leading to efficient querying, analyzing, and reasoning about moving objects/agents. However, contemporary frameworks on spatiotemporal logics are usually limited to qualitative approaches, such as the numerous studies on spatiotemporal databases that focus on observations, ignoring the intended movements of the agents. Moving object databases, on the other hand, can handle queries about the location, velocity, and time by assuming some agents to be targets. However, reasoning about the plan of moving agents, especially on the network and the achievability of such a plan, still remains a challenge. Studies on vehicle routing are often about the centralized planning of moving agents from scratch and do not deal with intended plans. Based on a plain move predicate, this paper presents a generic framework that can be used for representing and reasoning about plans of moving agents. Concepts from motion, network structure, graph theory, predicate logic, and constraint satisfaction are used to create the framework. We have also provided efficient algorithms for checking the consistency of the movement and extracting compatible plans along with some discussions on computational analysis, logical deduction, and flexibility. Finally, we have demonstrated the application of the methodology by developing NETwork-based Move Atoms Planning System (NETMAPS). The experiments show how NETMAPS can overcome an inconsistent movement plan and deliver advantageous suggestions to an executive agent.

show abstract

Section: Motion Planningmentioning

confidence: 99%

Plain move predicate and its consistency concerning the moving agents in a network

Vahidnia

Alesheikh

2014

International Journal of Geographical Information Science

View full text Add to dashboard Cite

show abstract

“…Its spatio-temporal generalization is related to CCRP with additional edge-capacity constraints [27], [28]. CCRP provides spatio-temporally disjoint service areas assuming compliance with recommended paths and schedules.…”

Section: Appendix D Relationship With Capacity-constrained Route Planmentioning

confidence: 99%

Capacity-Constrained Network-Voronoi Diagram

Yang

Shekhar

Oliver

et al. 2015

IEEE Trans. Knowl. Data Eng.

Self Cite

View full text Add to dashboard Cite

Given a graph and a set of service center nodes, a Capacity Constrained Network-Voronoi Diagram (CCNVD) partitions the graph into a set of contiguous service areas that meet service center capacities and minimize the sum of the shortest distances from graph-nodes to allotted service centers. The CCNVD problem is important for critical societal applications such as assigning evacuees to shelters and assigning patients to hospitals. This problem is NP-hard; it is computationally challenging because of the large size of the transportation network and the constraint that service areas must be contiguous in the graph to simplify communication of allotments. Previous work has focused on honoring either service area contiguity (e.g., Network Voronoi Diagrams) or service center capacity constraints (e.g., min-cost flow), but not both. Our preliminary work introduced a novel Pressure Equalizer (PE) approach for CCNVD to meet the capacity constraints of service centers while maintaining the contiguity of service areas. However, we find that the main bottleneck of the PE algorithm is testing whether service areas are contiguous. In this paper, we extend our previous work and propose novel algorithms that reduce the computational cost. Experiments using road maps from five different regions demonstrate that the proposed approaches significantly reduce computational cost for the PE approach.

show abstract

“…Chen et al [2] used methods of system simulation to compare the evacuation efficiency of three different networks, which include the grid network that we also consider in this paper. Lu et al [3] and Shekhar et al [4] Manuscript received July 31, 2013; revised October 6, 2013 studied the shortest path algorithm of evacuation with the consideration of capacity constraints and the increasing number of people in time and space. Berman [5] estimate problem in unknown environment by the performance ratio.…”

Section: Opt T T K mentioning

confidence: 99%

Tactics for Evacuating from an Affected Area

Jiang¹,

Wang²,

Wei³

2013

IJMLC

View full text Add to dashboard Cite

Abstract-This paper considers the problem faced by a group of evacuees must leave from an affected area as quickly as possible. We seek efficient tactics that achieve a bounded ratio of evacuation time without boundary information to that with. Specially, evacuees can communicate with each other during the evacuation.In this paper, we restrict the affected area to a convex region in the plane. We analyze this problem in two scenarios: general plane and plane in grid network. In these two scenarios, we present new efficient tactics and analyze the evacuate ratio of tactics, respectively.

show abstract

Experiences with evacuation route planning algorithms

Cited by 74 publications

References 19 publications

Plain move predicate and its consistency concerning the moving agents in a network

Plain move predicate and its consistency concerning the moving agents in a network

Capacity-Constrained Network-Voronoi Diagram

Tactics for Evacuating from an Affected Area

Contact Info

Product

Resources

About