Dual graph representation of transport networks

Transportation Research Part B: Methodological

Volumn 30, Issue 3 PART B, 1996, Pages 209-216

  Anez J ^a   De La Barra, T ^a   Perez B ^a  

^a Modelistica   (Venezuela)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION; ERRORS; GRAPH THEORY; HIGHWAY TRAFFIC CONTROL; MATHEMATICAL MODELS; TRANSPORTATION ROUTES;

DUAL GRAPH REPRESENTATION; DUAL NETWORKS; PROHIBITED TURNS; TRANSPORT NETWORKS;

HIGHWAY SYSTEMS;

DUAL GRAPH REPRESENTATION; METHODOLOGICAL EVALUATION; TRANSPORT NETWORK; TRANSPORT PLANNING;

EID: 0030304222     PISSN: 01912615     EISSN: None     Source Type: Journal    
DOI: 10.1016/0191-2615(95)00024-0     Document Type: Article

References (7)

1. Caldwell T. (1961) On finding minimum routes in a network with turn penalties. Commun. A.C.M. 4, 107-108.
2. de la Barra T. (1989) Integrated Land Use and Transport Modelling. Cambridge Univ. Press.
3. de la Barra T., Perez B. and Añez J. (1993) Multidimensional path search and assignment. Proc. 21st PTRC Summer Annual Meeting, Manchester, U.K.
4. Dial R., Glover F., Karney D. and Klingman D. (1979). A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees. Networks 9, 215-248.
5. Dijkstra E. W. (1959) A note on two problems in conexion with graphs. Num. Mathematik 1, 269-71.
6. Modelistica (1993) TRANUS Technical Description. Caracas, Venezuela.
7. Van Vliet D. (1979) The arc-vertex transformation for handling turn penalties. Technical Note 11, Institute for Transport Studies, Univ. of Leeds, UK.