Critical Review of Time-Dependent Shortest Path Algorithms: A Multimodal Trip Planner Perspective

Abstract

A multimodal trip planner that produces optimal journeys involving both public transport and private vehicle legs has to solve a number of shortest path problems, both on the road network and the public transport network. The algorithms that are used to solve these shortest path problems have been researched since the late 1950s. However, in order to provide accurate journey plans that can be trusted by the user, the variability of travel times caused by traffic congestion must be taken into consideration. This requires the use of more sophisticated time-dependent shortest path algorithms, which have only been researched in depth over the last two decades, from the mid-1990s. This paper will review and compare nine algorithms that have been proposed in the literature, discussing the advantages and disadvantages of each algorithm on the basis of five important criteria that must be considered when choosing one or more of them to implement in a multimodal trip planner.     

A predictive dynamic traffic assignment model in congested capacity-constrained road networks

In this paper, a predictive dynamic traffic assignment model in congested capacity-constrained road networks is formulated. A traffic simulator is developed to incrementally load the traffic demand onto the network, and updates the traffic conditions dynamically. A time-dependent shortest path algorithm is also given to determine the paths with minimum actual travel time from an origin to all the destinations. The traffic simulator and time-dependent shortest path algorithm are employed in a method of successive averages to solve the dynamic equilibrium solution of the problem. A numerical example is given to illustrate the effectiveness of the proposed method.     

Path-constrained traffic assignment: A trip chain analysis under range anxiety

This paper proposes and analyzes a distance-constrained traffic assignment problem with trip chains embedded in equilibrium network flows. The purpose of studying this problem is to develop an appropriate modeling tool for characterizing traffic flow patterns in emerging transportation networks that serve a massive adoption of plug-in electric vehicles. This need arises from the facts that electric vehicles suffer from the “range anxiety” issue caused by the unavailability or insufficiency of public electricity-charging infrastructures and the far-below-expectation battery capacity. It is suggested that if range anxiety makes any impact on travel behaviors, it more likely occurs on the trip chain level rather than the trip level, where a trip chain here is defined as a series of trips between two possible charging opportunities (Tamor et al., 2013). The focus of this paper is thus given to the development of the modeling and solution methods for the proposed traffic assignment problem. In this modeling paradigm, given that trip chains are the basic modeling unit for individual decision making, any traveler’s combined travel route and activity location choices under the distance limit results in a distance-constrained, node-sequenced shortest path problem. A cascading labeling algorithm is developed for this shortest path problem and embedded into a linear approximation framework for equilibrium network solutions. The numerical result derived from an illustrative example clearly shows the mechanism and magnitude of the distance limit and trip chain settings in reshaping network flows from the simple case characterized merely by user equilibrium.     

A discrete-convex programming approach to the simultaneous optimization of land use and transportation

Three design problems are discussed in this article. First, it is shown that the network design problem with congestion reduces to an all-or nothing traffic assignment problem under some assumptions on the congestion function and the investment cost function. Second, the land use design problem is formulated as an extension of the Koopmans-Beckmann problem and a heuristic is proposed to solve this problem. Third, it is shown that the seemingly more complex problem of designing jointly a land-use plan and a transportation network reduces to a pure land-use design problem. All that is needed to solve the joint optimization problem is a shortest path algorithm and a heuristic to solve the land use design problem. Computational experience is reported for each algorithm.     

A novel traffic signal control formulation

A novel traffic signal control formulation is developed through a mixed integer programming technique. The formulation considers dynamic traffic, uses dynamic traffic demand as input, and takes advantage of a convergent numerical approximation to the hydrodynamic model of traffic flow. As inherent from the underlying hydrodynamic model, this formulation covers the whole range of the fundamental relationships between speed, flow, and density. Kinematic waves of the stop-and-go traffic associated with traffic signals are also captured. Because of this property, one does not need to tune or switch the model for the different traffic conditions. It “automatically” adjusts to the different traffic conditions. We applied the model to three demand scenarios in a simple network. The results seemed promising. This model produced timing plans that are consistent with models that work for unsaturated conditions. In gridlock conditions, it produced a timing plan that was better than conventional queue management practices.     

On the dual approach to the traffic assignment problem

This paper attempts to explore the possibility of solving the traffic assignment problem with elastic demands by way of its dual problem. It is shown that the dual problem can be formulated as a nonsmooth convex optimization problem of which the objective function values and subgradients are conveniently calculated by solving shortest path problems associated with the transportation network. A subgradient algorithm to solve the dual problem is presented and limited computational experience is reported. The computational results are encouraging enough to demonstrate the effectiveness of the proposed approach.     

Macroscopic relations of urban traffic variables: Bifurcations, multivaluedness and instability

Recent experimental work has shown that the average flow and average density within certain urban networks are related by a unique, reproducible curve known as the Macroscopic Fundamental Diagram (MFD). For networks consisting of a single route this MFD can be predicted analytically; but when the networks consist of multiple overlapping routes experience shows that the flows observed in congestion for a given density are less than those one would predict if the routes were homogeneously congested and did not overlap. These types of networks also tend to jam at densities that are only a fraction of their routes’ average jam density.This paper provides an explanation for these phenomena. It shows that, even for perfectly homogeneous networks with spatially uniform travel patterns, symmetric equilibrium patterns with equal flows and densities across all links are unstable if the average network density is sufficiently high. Instead, the stable equilibrium patterns are asymmetric. For this reason the networks jam at lower densities and exhibit lower flows than one would predict if traffic was evenly distributed.Analysis of small idealized networks that can be treated as simple dynamical systems shows that these networks undergo a bifurcation at a network-specific critical density such that for lower densities the MFDs have predictably high flows and are univalued, and for higher densities the order breaks down. Microsimulations show that this bifurcation also manifests itself in large symmetric networks. In this case though, the bifurcation is more pernicious: once the network density exceeds the critical value, the stable state is one of complete gridlock with zero flow. It is therefore important to ensure in real-world applications that a network’s density never be allowed to approach this critical value.Fortunately, analysis shows that the bifurcation’s critical density increases considerably if some of the drivers choose their routes adaptively in response to traffic conditions. So far, for networks with adaptive drivers, bifurcations have only been observed in simulations, but not (yet) in real life. This could be because real drivers are more adaptive than simulated drivers and/or because the observed real networks were not sufficiently congested.     

Machine learning for multi-jurisdictional optimal traffic corridor control

Urban traffic corridors are often controlled by more than one agency. Typically in North America, a state of provincial transportation department controls freeways while another agency at the municipal or city level controls the nearby arterials. While the different segments of the corridor fall under different jurisdictions, traffic and users know no boundaries and expect seamless service. Common lack of coordination amongst those authorities due to lack of means for information exchange and/or possible bureaucratic ‘institutional grid-lock’ could hinder the full potential of technically-possible integrated control. Such institutional gridlock and related lack of timely coordination amongst the different agencies involved can have a direct impact on traffic gridlock. One potential solution to this problem is through integrated automatic control under intelligent transportation systems (ITS). Advancements in ITS and communication technology have the potential to considerably reduce delay and congestion through an array of network-wide traffic control and management strategies that can seamlessly cross-jurisdictional boundaries. Perhaps two of the most promising such control tools for freeway corridors are traffic-responsive ramp metering and/or dynamic traffic diversion possibly using variable message signs (VMS). Technically, the use of these control methods separately might limit their potential usefulness. Therefore, integrated corridor control using ramp metering and VMS diversion simultaneously might be synergetic and beneficial. Motivated by the above problem and potential solution approach, the aim of the research presented in this paper is to develop a self-learning adaptive integrated freeway-arterial corridor control for both recurring and non-recurring congestion. The paper introduces the use of reinforcement learning, an Artificial Intelligence method for machine learning, to provide optimal control using ramp metering and VMS routing in an integrated agent for a freeway-arterial corridor. Reinforcement learning is an approach whereby the control agent directly learns optimal strategies via feedback reward signals from its environment. A simple but powerful reinforcement learning method known as Q-learning is used. Results from an elaborate simulation study on a key corridor in Toronto are very encouraging and discussed in the paper.     

A dynamic shortest path algorithm using multi‐step ahead link travel time prediction

In this paper, a multi‐step ahead prediction algorithm of link travel speeds has been developed using a Kalman filtering technique in order to calculate a dynamic shortest path. The one‐step and the multi‐step ahead link travel time prediction models for the calculation of the dynamic shortest path have been applied to the directed test network that is composed of 16 nodes: 3 entrance nodes, 2 exit nodes and 11 internal nodes. Time‐varying traffic conditions such as flows and travel time data for the test network have been generated using the CORSIM model. The results show that the multi‐step ahead algorithm is compared more favorably for searching the dynamic shortest time path than the other algorithm.     

An integrated multi‐objective model to determine the optimal rescue path and traffic controlled arcs for disaster relief operations under uncertainty environments

This study proposes an integrated multi‐objective model to determine the optimal rescue path and traffic controlled arcs for disaster relief operations under uncertainty environments. The model consists of three sub‐models: rescue shortest path model, post‐disaster traffic assignment model, and traffic controlled arcs selection model to minimize four objectives: travel time of rescue path, total detour travel time, number of unconnected trips of non‐victims, and number of police officers required. Since these sub‐models are inter‐related with each other, they are solved simultaneously. This study employs genetic algorithms incorporated with traffic assignment and K‐shortest path methods to determine optimal rescue path and controlled arcs. To cope with uncertain information associated with the damaged network, fuzzy system reliability theory (weakest t‐norm method) is used to measure the access reliability of rescue path. To investigate the validity and applicability of the proposed model, studies on an exemplified case and a field case of Chi‐Chi earthquake in Taiwan are conducted. The performances of three rescue strategies: without traffic control, selective traffic control (i.e. the proposed model) and absolute traffic control are compared. The results show that the proposed model can maintain the efficiency of rescue activity with minimal impact to ordinary trips and number of police officers required.     

On the stability of traffic perimeter control in two-region urban cities

In this paper, stability analysis of traffic control for two-region urban cities is treated. It is known in control theory that optimality does not imply stability. If the optimal control is applied in a heavily congested system with high demand, traffic conditions might not change or the network might still lead to gridlock. A city partitioned in two regions with a Macroscopic Fundamental Diagram (MFD) for each of the regions is considered. Under the assumption of triangular MFDs, the two-region MFDs system is modeled as a piecewise second-order system. Necessary and sufficient conditions are derived for stable equilibrium accumulations in the undersaturated regimes for both MFDs. Moreover, the traffic perimeter control problem for the two-region MFDs system is formulated. Phase portraits and stability analysis are conducted, and a new algorithm is proposed to derive the boundaries of the stable and unstable regions. Based on these regions, a state-feedback control strategy is derived. Trapezoidal shape of MFDs are also addressed with numerical solutions.     

Bicriterion shortest path problem with a general nonadditive cost

A bicriterion shortest path problem with a general nonadditive cost seeks to optimize a combination of two path costs, one of which is evaluated by a nonlinear function. This paper first identifies a number of emerging transportation applications for which such a shortest path problem might be considered a core subproblem. We propose to first approximate the general nonlinear cost function with a piecewise linear counterpart, and then solve each linear subproblem sequentially. A specialized algorithm is developed to solve the subproblems, which makes use of the efficient path set (or the convex hull) to update upper and lower bounds of the original problem. Conditions under which the solution to a subproblem must belong to the efficient path set are specified. Accordingly, we show that the optimal path must be efficient if the nonlinear cost function is concave. If the optimal path to a subproblem is not efficient, partial path enumeration, implemented using a simple K-shortest path ranking procedure, is conducted to close the gap. The proposed algorithm includes strategies aiming to expedite path enumeration by using upper bounds derived from the efficient path set. Numerical experiments are conducted to demonstrate correctness and effectiveness of the proposed algorithm.     

Overflow delay in signalized networks

Traffic arrivals tend to be random at signals near to the perimeter of a network (or near to traffic generators in a network). Within the signal network, however, surges in traffic demand are reduced due to limitations on the amount of traffic passing through intersections imposed by signals, resulting in more uniform arrivals from cycle to cycle. Such uniformity is a desirable property at signals as underutilization of green periods may be reduced and levels of service improved. This may have serious implications within networks where it may be possible to improve the capacity of critical intersections by the strategic placing and timing of signals at less critical locations. The analysis of such options is, however, restricted by most, if not all, of the currently available evaluation methods. Relatively simple modifications of delay formulae are proposed to overcome these restrictions.     

Real-time merging traffic control for throughput maximization at motorway work zones

Work zones on motorways necessitate the drop of one or more lanes which may lead to significant reduction of traffic flow capacity and efficiency, traffic flow disruptions, congestion creation, and increased accident risk. Real-time traffic control by use of green–red traffic signals at the motorway mainstream is proposed in order to achieve safer merging of vehicles entering the work zone and, at the same time, maximize throughput and reduce travel delays. A significant issue that had been neglected in previous research is the investigation of the impact of distance between the merge area and the traffic lights so as to achieve, in combination with the employed real-time traffic control strategy, the most efficient merging of vehicles. The control strategy applied for real-time signal operation is based on an ALINEA-like proportional–integral (PI-type) feedback regulator. In order to achieve maximum performance of the control strategy, some calibration of the regulator’s parameters may be necessary. The calibration is first conducted manually, via a typical trial-and-error procedure. In an additional investigation, the recently proposed learning/adaptive fine-tuning (AFT) algorithm is employed in order to automatically fine-tune the regulator parameters. Experiments conducted with a microscopic simulator for a hypothetical work zone infrastructure, demonstrate the potential high benefits of the control scheme.     

A dynamic behavioural traffic assignment model with strategic agents

Foresee traffic conditions and demand is a major issue nowadays that is very often approached using simulation tools. The aim of this work is to propose an innovative strategy to tackle such problem, relying on the presentation and analysis of a behavioural dynamic traffic assignment.The proposal relies on the assumption that travellers take routing policies rather than paths, leading us to introduce the possibility for each simulated agent to apply, in real time, a strategy allowing him to possibly re-route his path depending on the perceived local traffic conditions, jam and/or time already spent in his journey.The re-routing process allows the agents to directly react to any change in the road network. For the sake of simplicity, the agents’ strategy is modelled with a simple neural network whose parameters are determined during a preliminary training stage. The inputs of such neural network read the local information about the route network and the output gives the action to undertake: stay on the same path or modify it. As the agents use only local information, the overall network topology does not really matter, thus the strategy is able to cope with large and not previously explored networks.Numerical experiments are performed on various scenarios containing different proportions of trained strategic agents, agents with random strategies and non strategic agents, to test the robustness and adaptability to new environments and varying network conditions. The methodology is also compared against existing approaches and real world data. The outcome of the experiments suggest that this work-in-progress already produces encouraging results in terms of accuracy and computational efficiency. This indicates that the proposed approach has the potential to provide better tools to investigate and forecast drivers’ choice behaviours. Eventually these tools can improve the delivery and efficiency of traffic information to the drivers.     

Dynamic traffic routing in a network with adaptive signal control

In real traffic networks, travellers’ route choice is affected by traffic control strategies. In this research, we capture the interaction between travellers’ route choice and traffic signal control in a coherent framework. For travellers’ route choice, a VANET (Vehicular Ad hoc NETwork) is considered, where travellers have access to the real-time traffic information through V2V/V2I (Vehicle to Vehicle/Vehicle to Infrastructure) infrastructures and make route choice decisions at each intersection using hyper-path trees. We test our algorithm and control strategy by simulation in OmNet++ (A network communication simulator) and SUMO (Simulation of Urban MObility) under several scenarios. The simulation results show that with the proposed dynamic routing, the overall travel cost significantly decreases. It is also shown that the proposed adaptive signal control reduces the average delay effectively, as well as reduces the fluctuation of the average speed within the whole network.     

Continuity of the path delay operator for dynamic network loading with spillback

This paper establishes the continuity of the path delay operators for dynamic network loading (DNL) problems based on the Lighthill–Whitham–Richards model, which explicitly capture vehicle spillback. The DNL describes and predicts the spatial-temporal evolution of traffic flow and congestion on a network that is consistent with established route and departure time choices of travelers. The LWR-based DNL model is first formulated as a system of partial differential algebraic equations. We then investigate the continuous dependence of merge and diverge junction models with respect to their initial/boundary conditions, which leads to the continuity of the path delay operator through the wave-front tracking methodology and the generalized tangent vector technique. As part of our analysis leading up to the main continuity result, we also provide an estimation of the minimum network supply without resort to any numerical computation. In particular, it is shown that gridlock can never occur in a finite time horizon in the DNL model.     

Reverse time-restricted shortest paths: Application to air traffic management

In this paper, we consider a particular class of network flow problems that seeks a shortest path, if it exists, between a source node s and a destination node d in a connected digraph, such that we arrive at node d at a specified time τ while leaving node s no earlier than a lower-bounding time LB, and where the availability of each network link is time-dependent in the sense that it can be traversed only during specified intervals of time. We refer to this problem as the reverse time-restricted shortest path problem (RTSP), and it arises, for example, in the context of generating flight plans within air traffic management approaches under severe convective weather conditions. We show that this problem is NP-hard in general, but is polynomially solvable under a special regularity condition. A pseudo-polynomial time dynamic programming algorithm is developed to solve Problem RTSP, along with an effective heap implementation strategy. Computational results using real flight generation test cases as well as random simulated problems are presented.     

Managing evacuation networks

This paper proposes a non-anticipative, adaptive, decentralized strategy for managing evacuation networks. The strategy is non-anticipative because it does not rely on demand forecasts, adaptive because it uses real-time traffic information, and decentralized because all the information is available locally. It can be used with a failed communication network.The strategy pertains to networks in which no links backtrack in the direction of increased risk. For these types of networks, no other strategy exists that can evacuate more people in any given time, or finish the evacuation in less time. The strategy is also shown to be socially fair, in the sense that the time needed to evacuate all the people exceeding any risk level is, both, the least possible, and the same as if less-at-risk individuals did not participate in the evacuation. The strategy can be proven optimal even when backflows happen due to driver gaming.     

Optimal fueling strategies for locomotive fleets in railroad networks

Railroad companies spend billions of dollars each year to purchase fuel for thousands of locomotives across the railroad network. Each fuel station charges a site-dependent fuel price, and the railroad companies must pay an additional flat contracting fee in order to use it. This paper presents a linear mixed-integer mathematical model that integrates not only fuel station location decisions but also locomotive fueling schedule decisions. The proposed model helps railroads decide which fuel stations to contract, and how each locomotive should purchase fuel along its predetermined shipment path, such that no locomotive runs out of fuel while the summation of fuel purchasing costs, shipment delay costs (due to fueling), and contracting charges is minimized. A Lagrangian relaxation framework is proposed to decompose the problem into fueling schedule and facility location selection sub-problems. A network shortest path formulation of the fueling schedule sub-problem is developed to obtain an exact optimal solution to the fueling schedule sub-problem. The proposed framework is applied to a large-scale empirical case and is shown to effectively reduce system costs.