Optimizing Emergency Transportation through Multicommodity Quickest Paths
نویسندگان
چکیده
منابع مشابه
Quickest paths: parallelization and dynamization
Let N = (V, E, c, /) be a network, where G = (V, E), (VI = n and (El = m, is a directed graph, c(e) > 0 is the capacity and I(e) 2 0 is the lead time for each edge e E E. The transmission time to send u units of data from a given source s to a destination t using path p is T(a,p) = I(p) + &, where 1(p) is the sum of the lead times of the edges in p, and c(p) is the minimum capacity of the edges...
متن کاملQuickest Path Queries on Transportation Network
This paper considers the problem of finding a quickest path between two points in the Euclidean plane in the presence of a transportation network. A transportation network consists of a planar network where each road (edge) has an individual speed. A traveller may enter and exit the network at any point on the roads. Along any road the traveller moves with a fixed speed depending on the road, a...
متن کاملQuickest Paths in Simulations of Pedestrians
This contribution proposes a method to make agents in a microscopic simulation of pedestrian traffic walk approximately along a path of estimated minimal remaining travel time to their destination. Usually models of pedestrian dynamics are (implicitly) built on the assumption that pedestrians walk along the shortest path. Model elements formulated to make pedestrians locally avoid collisions an...
متن کاملQuickest Paths: Faster Algorithms and Dynamization
Given a network N = (V,E, c, l), where G = (V,E), |V | = n and |E| = m, is a directed graph, c(e) > 0 is the capacity and l(e) ≥ 0 is the lead time (or delay) for each edge e ∈ E, the quickest path problem is to find a path for a given source–destination pair such that the total lead time plus the inverse of the minimum edge capacity of the path is minimal. The problem has applications to fast ...
متن کاملAn algorithm for ranking quickest simple paths
In this paper, an algorithm for ranking loopless paths in undirected networks, according to the transmission time, is presented. It is shown that the worst-case computational time complexity of the algorithm presented is O(Kr(m+n log n)), which is also the best-known complexity to solve this problem. The worst-case memory complexity is O(Kn), which improves the existing algorithms. Finally, com...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transportation Research Procedia
سال: 2015
ISSN: 2352-1465
DOI: 10.1016/j.trpro.2015.09.029