Shortest viable hyperpath in multimodal networks

Transportation Research Part B: Methodological

Volumn 36, Issue 10, 2002, Pages 853-874

  Lozano, Angélica ^a   Storchi, Giovanni ^b  

^a UNIVERSIDAD NACIONAL AUTÓNOMA DE MÉXICO   (Mexico)

^b SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY; MODAL ANALYSIS; OPTIMAL SYSTEMS; PARETO PRINCIPLE; PROBLEM SOLVING;

MULTIMODAL NETWORKS;

TRANSPORTATION;

NETWORK ANALYSIS; SPATIAL ANALYSIS; TRANSPORTATION PLANNING; TRAVEL TIME;

EID: 0036895188     PISSN: 01912615     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0191-2615(01)00038-8     Document Type: Article

References (14)

1. Path composition and multiple choice in a bimodal transportation network
2. Multicommodity, multimode freight transportation: A general modeling and algorithmic framework for the service network design problem
3. Network equilibrium models with combined modes
4. Transportation policy analysis with a geographic information system: The virtual network of freight transportation in Europe
5. Shortest viable path algorithm in multimodal networks
6. Hyperpath formulations of traffic assignment problems
7. GIS design for multimodal network analysis
8. Geographic information system design for networks equilibrium-based travel demand models
9. Hyperpaths and shortest hyperpaths
10. Assegnamento dei passaggeri ad un sistema di linee urbane: determinazione degli ipercammini minimi
11. A modeling framework for the passenger assignment on a transportation network with time-tables
12. Shortest path algorithms in transportation models: Classical and innovative aspects
13. An intermodal optimum path algorithm for multimodal networks with dynamic arc travel times and switching delays