An extension of labeling techniques for finding shortest path trees

Ziliaskopoulos, Athanasios; Mandanas, Fotios D.; Mahmassani, Hani S.

doi:10.1016/j.ejor.2008.08.018

Cited by 14 publications

(7 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…With the explicit consideration of vehicle routing problem systems for optimal route specification in realtime have been developed to disseminate dynamic information that is a necessity for alleviating the congestion propagation (Wahle et al, 2001;Bielli et al, 2006;Thomas and White, 2007;Florian et al, 2008). Adaptation of shortest path procedures for computing minimum link travelling times from an origin to a destination that is anticipated and then responses given to changes in congestion in dynamic networks has been extensively studied by alternating the algorithm used (Ziliaskopoulos and Wardell, 2000;Bielli et al, 2006;Thomas and White, 2007;Ziliaskopoulos et al, 2009).…”

Section: Model Scalesmentioning

confidence: 99%

Reconstructing freeway travel times with a simplified network flow model alternating the adopted fundamental diagram

Çelikoğlu¹

2013

European Journal of Operational Research

View full text Add to dashboard Cite

Section: Model Scalesmentioning

confidence: 99%

Reconstructing freeway travel times with a simplified network flow model alternating the adopted fundamental diagram

Çelikoğlu¹

2013

European Journal of Operational Research

View full text Add to dashboard Cite

“…It is O(jEjlgjVj) if Q is implemented as a binary heap and O(jEj + jVjlgjVj) when as a Fibonacci heap [13,15]. Though the efficiency and various applications of Dijkstra's algorithm have been widely studied [16][17][18][19][20], Dijkstra's algorithm may not be easily understood, especially when implementing the labeling method [1,16,17,19,21]. In this paper, we introduce another way to implement Dijkstra's algorithm, called the Node Combination (NC) algorithm, with which the source node iteratively combines nodes into a new source node and updates the edge weights of the remaining node.…”

Section: Introductionmentioning

confidence: 99%

Finding the shortest paths by node combination

Lu¹,

Camitz²

2011

Applied Mathematics and Computation

View full text Add to dashboard Cite

“…So, the problem we are concerned with can be stated as follows: Given a set of trips of different types (available modes and companies) with fixed schedule and capacity, and given the origin/destination nodes with desired departure/arrival times and preferences about the type of trips, find a set of paths satisfying certain criteria. In doing so, each user request runs a three‐phase optimization procedure based on building and pruning a user‐specific time–space graph where a k ‐shortest path search algorithm is applied (see e.g., or ), each path following one of the chosen criterion.…”

Section: Introductionmentioning

confidence: 99%

A methodology for schedule‐based paths recommendation in multimodal public transportation networks

Canca

Zarzo

González‐R

et al. 2012

J of Advced Transportation

View full text Add to dashboard Cite

This paper analyzes the problem of intermodal itineraries recommendation in interurban networks where different public transportation modes, several companies, time, and capacity constraints, as well as seat booking, are considered. The inherent network optimization problem is first modeled for a generic user request, and then a solving method that makes use of a network graph transformation is proposed. For each request, this solving method is based on pruning the user-specific time-space graph, followed by the application of a k-shortest path algorithm. Moreover, in order to build on-demand real-time itineraries recommendations, the algorithm has been embedded in a Web client-server to which users ask for trip recommendations by Internet or mobile phone. Finally, as an illustration, the proposed approach has been tested on the Andalusia main transportation network. ATIS and APTS have been analyzed by many authors, from both a theoretical and technical point of view. Yang and Meng [4] studied the price of using and the benefits gained from ATIS services as two key factors in explaining the growth of adoption of ATIS products. Horn [5] proposed a modeling framework to analyze the performance of urban passenger transport systems, with particular attention to demand-responsive transport modes and traveler information technologies. Levinson [6] and Kenyon and Lyons [7] considered the value of ATIS for route choice and its potential contribution to modal change, respectively. Yin et al.[8] studied how Intelligent Transportation Systems technologies can improve traffic congestion levels in urban road networks. They analyzed the impact that ATIS may play in route choice and departure time decisions. Most of these works are focused on the use of information systems in the private vehicle case. Concerning to the public case, several authors have studied different issues of ATIS and APTS focused on different topics such as users assessment (see e.g., [9] or [10]), congestion costs [11], or technology sourcing evaluation [12]. A recent point of interest has been the integration of ATIS into Web applications (see [13][14][15][16]).Roughly speaking, traveler public information systems have two main aims (see e.g., [17] or [18]). First, they should contribute to minimize the inconvenience of using public transport, simplifying the journey-planning and executing processes. Second, their design should be addressed to diminish the sense in which such a journey is disjointed and awkward, in such a way that the intermodal travel experience becomes closer to that of a journey by private car. To succeed in this latter aim, an accurate and efficient way to manage transfers is needed because, as pointed out in [19], transfers are one of the most important inconveniences perceived by users of multimodal transport systems.At this point, it is clear that, besides the appropriate infrastructure properties of the network, good and well-oriented information becomes also necessary in order to guarantee intermodality success [20]. Moreover...

show abstract

An extension of labeling techniques for finding shortest path trees

Cited by 14 publications

References 14 publications

Reconstructing freeway travel times with a simplified network flow model alternating the adopted fundamental diagram

Reconstructing freeway travel times with a simplified network flow model alternating the adopted fundamental diagram

Finding the shortest paths by node combination

A methodology for schedule‐based paths recommendation in multimodal public transportation networks

Contact Info

Product

Resources

About