The Algorithm of the Time-Dependent Shortest Path Problem with Time Windows

El-Sherbeny, Nasser A.

doi:10.4236/am.2014.517264

Cited by 13 publications

(11 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For example, the traveling time of a road varies widely on the basis of traffic conditions (e.g., traffic congestion and speed limit). Therefore, a time-dependent spatial network in which the variation of edge cost can be described by a function with respect to time was proposed in [15], and, subsequently, numerous studies have deployed mathematical prediction functions for future traveling time estimations on the basis of real historical traffic data [15]- [18].…”

Section: Related Studiesmentioning

confidence: 99%

See 1 more Smart Citation

On-the-Fly Nearest-Shelter Computation in Event-Dependent Spatial Networks in Disasters

Tsai

Lin²,

Liu

2016

IEEE Trans. Veh. Technol.

View full text Add to dashboard Cite

Numerous approaches have been proposed to solve shortest-path query problems in either static or time-dependent spatial networks; however, these approaches are neither appropriately nor efficiently used to find the nearest shelter with fastest paths in disaster evacuations. In disasters, segments of a path computed and saved as the fastest might become impassable. The nearest shelter differs for people depending on their locations and can also change on the basis of an unpredictable and highly dynamic edge cost (e.g., maximum passable vehicle speed), which is influenced by disaster events. To solve this problem, this paper proposes a dynamic network model, called an event-dependent network, to represent a spatial network in a disaster. Effective approaches using multiple algorithms are proposed for on-thefly computation of the nearest shelter and fastest paths in a disaster. A distributed system consisting of a server and multiple mobile clients using our approaches is presented for navigating the fastest paths for people to evacuate a disaster area. Real-world maps, such as a map of California, were used in our experiments. The results revealed that our approaches require less than 2 ms to find a new nearest shelter and its fastest paths which is faster than other approaches for solving the fastest path problem.

show abstract

Section: Related Studiesmentioning

confidence: 99%

“…Preprocessing algorithms [18]- [20] compute certain information (a data structure or index) to accelerate the second phase. To solve the SPQP in a static network, a traditional solution is to use a single-source shortest path (SSSP) [21] to answer queries online without precomputing any data structures.…”

Section: Related Studiesmentioning

confidence: 99%

On-the-Fly Nearest-Shelter Computation in Event-Dependent Spatial Networks in Disasters

Tsai

Lin²,

Liu

2016

IEEE Trans. Veh. Technol.

View full text Add to dashboard Cite

show abstract

“…Traditional shortest path first (SPF) algorithms such as Dijkstra focus on how to find out a best route which is able to meet the requirement or maximum satisfy the requirement [7][8]. However, the overall utilization of network resources is ignored so that the global optimization cannot be achieved.…”

Section: Introductionmentioning

confidence: 99%

An Improved OSPF Routing Algorithm Based on Quotient and Granularity Space Theory

Zhong¹

2016

IJSIP

View full text Add to dashboard Cite

show abstract

“…It has shown to require lower memory usage than Dijkstra's or A* algorithms, so it is more suitable for low cost robots or systems with limited resources. The author in [10] also proposes a new algorithm for finding the shortest path which aims to reduce execution time, comparing his algorithm to Dijkstra's. In [11] a new way for path finding is described which is based on Compressed Path Databases (CPD).…”

Section: Introductionmentioning

confidence: 99%

NafisNav: An indoor navigation algorithm for embedded systems and based on grid maps

Eraghi

Lopez-Colino

Castro

et al. 2015

2015 IEEE International Conference on Industrial Technology (ICIT)

View full text Add to dashboard Cite

Esta es la versión de autor de la comunicación de congreso publicada en: This is an author produced version of a paper published in: Abstract-An important goal in navigation of low cost robots is low memory usage. In this paper, we propose a novel navigation algorithm (NafisNav) suitable for embedded systems with low resources, mainly memory. The proposed path finding algorithm is designed and implemented in grid maps. Unlike existing algorithms, that mainly focus on obtaining the shortest possible path for navigation, the proposed algorithm focuses on reducing memory consumption, even at the cost of not always obtaining the best path. Experimental results show the trade-off between path length and memory consumption that is obtained, comparing it with typical algorithms such as Dijkstra or A*.

show abstract

The Algorithm of the Time-Dependent Shortest Path Problem with Time Windows

Abstract: In this paper, we present a new algorithm of the time-dependent shortest path problem with time windows. Give a directed graph ( )

Cited by 13 publications

References 16 publications

On-the-Fly Nearest-Shelter Computation in Event-Dependent Spatial Networks in Disasters

On-the-Fly Nearest-Shelter Computation in Event-Dependent Spatial Networks in Disasters

An Improved OSPF Routing Algorithm Based on Quotient and Granularity Space Theory

NafisNav: An indoor navigation algorithm for embedded systems and based on grid maps

Contact Info

Product

Resources

About