Dual graph representation of transport networks

Anez, J; Barra, Tomás de la; Perez, Benjamin Cabrera

doi:10.1016/0191-2615(95)00024-0

Cited by 101 publications

(54 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…In terms of supply modeling, the schedule-based approach requires a run-based supply representation in which individual vehicle trips with arrival/departure times at stops are considered. In the literature, there are three main run-based representations of transit services: the diachronic network (Nuzzolo and Russo 1993) also referred to as time-expanded network (Ahuja et al 1993); the dual network (Anez et al 1996) and the mixed line-based/database supply model (Tong and Richardson 1984;Wong and Tong 1999). In the proposed modeling framework, we adopted the diachronic network approach to represent the multimodal and multiservice network of the study area, and to estimate the OD level of service (Fig.…”

Section: Hsr Demand Forecasting: State Of Artmentioning

confidence: 99%

An elastic demand schedule-based multimodal assignment model for the simulation of high speed rail (HSR) systems

Cascetta

Coppola

2012

EURO Journal on Transportation and Logistics

View full text Add to dashboard Cite

High speed rail (HSR) represents the future of medium-haul intercity transport. In fact, a number of HSR projects are being developed all over the world despite the financial and economic crisis. Such large investments require reliable demand forecasting models to develop solid business plans aiming at optimizing the fares structures and the timetables (operational level) and, on the other hand, at exploring opportunities for new businesses in the long period (strategic level). In this paper, we present a models system developed to forecast the national passenger demand for different macroeconomic, transport supply, and HSR market scenarios. The core of the model is based on the simulation of the competition between transportation modes (i.e. air, auto, rail), railways services (intercity vs. high speed rail) and HSR operators, using an explicit representation of the timetables of all competing modes/services/runs (schedule-based assignment). This requires, in turn, a diachronic network representation of the transport supply for scheduled services and a nested logit model of mode, service, operator, and run choice. To authors' knowledge this represents the first case of elastic demand, schedule-based assignment model at national scale to forecast HSR demand. The overall modeling framework has been calibrated based on extensive traffic counts and mixed RP-SP interviews gathered between 2009 and 2011, on the Italian multimodal transportation system. The results of the models estimation are presented, and, some applications to test HSR service options (i.e. fares and timetable) of a new operator entering the HSR market and competing with the national incumbent are discussed.

show abstract

Section: Hsr Demand Forecasting: State Of Artmentioning

confidence: 99%

An elastic demand schedule-based multimodal assignment model for the simulation of high speed rail (HSR) systems

Cascetta

Coppola

2012

EURO Journal on Transportation and Logistics

View full text Add to dashboard Cite

show abstract

“…Different from the method of splitting a node [12], the dual graph uses an auxiliary arc to describe the steering relationship and restrictions between adjacent roads. In the model of the dual graph, the original edge where the road is located becomes a node that contains some attribute information of the original road edge, and the turning direction in the original road map is represented by an edge in the dual graph.…”

Section: Dual Graphmentioning

confidence: 99%

“…However, the increase in number of nodes and links will lead to great reduction in efficiency of computing the optimal path. In addition, de la Barra [12] proposed a data structure called dual graph to describe the transportation network model with steering limitations. Dual graph uses arcs that express the relationship of the turning to represent turning relationship (or restrictions) at nodes within the model of the road network, which can not only fully express the connectional relationship and steering restrictions but also greatly reduce data redundancy [13].…”

Section: Introductionmentioning

confidence: 99%

Optimized Route Selection Method based on the Turns of Road Intersections: A Case Study on Oversized Cargo Transportation

Meng¹,

Hu²,

Huang³

et al. 2015

IJGI

View full text Add to dashboard Cite

For oversized cargo transportation, traditional transportation schemes only consider road length, road width, the transportation cost as weight values in analysis and calculation of route selection. However, for oversized trucks, turning direction at road intersections is also a factor worth considering. By introducing the classical algorithm of Dijkstra into the model of road network, this research considers the size of turning angle at intersections as the weight value of the edge in the auxiliary network based on the weight values of road corners, upon which the shortest path analysis is performed. Then, an optimal path with minimum time cost was eventually obtained. The proposed algorithm was analyzed and compared with the traditional shortest path algorithm and it reported that our method could reduce the time for oversized trucks to pass through intersections. In addition, the proposed algorithm could be adapted to the complex and diverse road networks and provide a reliable scheme for route selection of oversized trucks.

show abstract

“…In the paper, the ideas related to the method of dual graph [7] [8] are introduced herein, and the method to transform road network construction is used to handle intersection steering restriction and node weights. The basic idea is as below: nodes-based weighted directed graph is transformed into arc (section)-based weighted directed graph, and then the optimal path is calculated on the transformed road network.…”

Section: Transformation Of Road Network Construction Based On Segmentmentioning

confidence: 99%

Research on the Layering A* Algorithm for Real-Time Navigation

Tan

2015

Int. Arch. Photogramm. Remote Sens. Spatial Inf. Sci.

View full text Add to dashboard Cite

ABSTRACT:According to the existing problems in the applications of embedded navigation, this paper designs the hierarchical search A * algorithm, based on the transferring road network, to meet the need of real-time navigation. In the algorithm, a hierarchical search strategy is applied to route programming of large area, yet the duplicate searching A * algorithm, based on the transferring road network, is applied to the path computation, which is able to handle intersection turn restrictions and node weight, with little storage space but fast searching speed. Practically, the algorithm is proved to meet the technological need of real-time navigation both in computing speed and route rationality.

show abstract

Dual graph representation of transport networks

Cited by 101 publications

References 2 publications

An elastic demand schedule-based multimodal assignment model for the simulation of high speed rail (HSR) systems

An elastic demand schedule-based multimodal assignment model for the simulation of high speed rail (HSR) systems

Optimized Route Selection Method based on the Turns of Road Intersections: A Case Study on Oversized Cargo Transportation

Research on the Layering A* Algorithm for Real-Time Navigation

Contact Info

Product

Resources

About