Shortest Paths on Dynamic Graphs: A Survey

Ferone, Daniele; Festa, Paola; Napoletano, Antonio; Pastore, Tommaso

doi:10.1590/0101-7438.2017.037.03.0487

Cited by 16 publications

(3 citation statements)

References 53 publications

(51 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Distributed algorithms for finding shortest paths are developed in [34][35][36], and surveys of the general area of temporal graphs appear in [37][38][39].…”

Section: Related Workmentioning

confidence: 99%

Path Algorithms for Contact Sequence Temporal Graphs

Gheibi,

Banerjee,

Ranka

et al. 2024

Algorithms

View full text Add to dashboard Cite

This paper proposes a new time-respecting graph (TRG) representation for contact sequence temporal graphs. Our representation is more memory-efficient than previously proposed representations and has run-time advantages over the ordered sequence of edges (OSE) representation, which is faster than other known representations. While our proposed representation clearly outperforms the OSE representation for shallow neighborhood search problems, it is not evident that it does so for different problems. We demonstrate the competitiveness of our TRG representation for the single-source all-destinations fastest, min-hop, shortest, and foremost paths problems.

show abstract

“…Distributed algorithms for finding shortest paths are developed in [34][35][36], and surveys of the general area of temporal graphs appear in [37][38][39].…”

Section: Related Workmentioning

confidence: 99%

Path Algorithms for Contact Sequence Temporal Graphs

Gheibi,

Banerjee,

Ranka

et al. 2024

Algorithms

View full text Add to dashboard Cite

show abstract

“…This leads to a nonlinear optimization problem with a concave solution space, which are in general computationally expensive to solve. The formulation to find the shortest path in a network by a discrete optimization problem can also be easily implemented [24]. Yet, in turn, finding the second, third and k-th shortest path is usually solved by heuristics, as for example by Yen's K-shortest paths algorithm [25].…”

Section: Resilience Optimizationmentioning

confidence: 99%

Optimal Resilience Enhancement of Water Distribution Systems

Lorenz

Pelz

2020

Water

View full text Add to dashboard Cite

Water distribution systems (WDSs) as critical infrastructures are subject to demand peaks due to daily consumption fluctuations, as well as long term changes in the demand pattern due to increased urbanization. Resilient design of water distribution systems is of high relevance to water suppliers. The challenging combinatorial problem of high-quality and, at the same time, low-cost water supply can be assisted by cost-benefit optimization to enhance the resilience of existing main line WDSs, as shown in this paper. A Mixed Integer Linear Problem, based on a graph-theoretical resilience index, is implemented considering WDS topology. Utilizing parallel infrastructures, specifically those of the urban transport network and the water distribution network, makes allowances for physical constraints, in order to adjust the existing WDS and to enhance resilience. Therefore, decision-makers can be assisted in choosing the optimal adjustment of WDS depending on their investment budget. Furthermore, it can be observed that, for a specific urban structure, there is a convergence of resilience enhancement with higher costs. This cost-benefit optimization is conducted for a real-world main line WDS, considering also the limitations of computational expenses.

show abstract

“…There is a large body of research on dynamic shortest path problems. Ferone et al [29] give a recent survey on the problems. The dynamic version of all pairs shortest-path problem is, for example, dealt within [30] and single-source shortest-path in [31].…”

Section: Dynamic Single-source Shortest-path Algorithmsmentioning

confidence: 99%

SRide: An Online System for Multi-Hop Ridesharing

2020

View full text Add to dashboard Cite

In the context of smart cities, ridesharing in urban areas is gaining researchers’ interest and is considered to be a sustainable transportation solution. In this paper, we present SRide (Shared Ride), a multi-hop ridesharing system as a mode of sustainable transportation. Multi-hop ridesharing is a type of ridesharing in which a rider travels in multiple hops to reach a destination, transferring from one driver to another between hops. The key problem in multi-hop ridesharing is to find an optimal itinerary or route plan for a rider from an origin to a destination in a dynamic, online setting. SRide adopts a novel approach to finding itineraries for riders suited to the online nature of the problem. The system represents ride offers as a time-dependent directed graph and finds itineraries dynamically by updating the graph incrementally and decrementally as ride offers are updated in the system. The system’s distinguishing feature is its incremental and decremental operation, which is enabled by employing dynamic single-source shortest-path algorithms. We conducted two extensive simulation studies to evaluate its performance. Metrics, including the matching rate, savings in total system-wide vehicle-miles, and total system-wide driving times were measured. In the first study, SRide’s dynamic update algorithms were compared with their non-dynamic versions. Results show that SRide’s algorithms run up to thirteen times faster than their non-dynamic versions. In the second study, we used data from the travel demand model for metropolitan Atlanta in the US state of Georgia, to assess the benefits of multi-hop ridesharing. Results show that matching rates increase up to 68%, saving in total system-wide vehicle-miles of up to 12%, and reduction in the total system-wide driving time of up to 12.86% is achieved.

show abstract

Shortest Paths on Dynamic Graphs: A Survey

Cited by 16 publications

References 53 publications

Path Algorithms for Contact Sequence Temporal Graphs

Path Algorithms for Contact Sequence Temporal Graphs

Optimal Resilience Enhancement of Water Distribution Systems

SRide: An Online System for Multi-Hop Ridesharing

Contact Info

Product

Resources

About