The transportation system considered in this work is an urban transportation network integrating public and private modes of transport. Such a network is modelled as a Discrete Event System and its behaviour is reproduced bys means of an ad-hoc realized simulation tool. The paper centres round a particular module of the overall simulator, consistiong in an on-line information service able to provide the best intermodal paths between any pair of stations in the network. Such paths vary according to the system dynamics, depending essentially on the traffic conditions.
Heuristic search for the best paths in an intermodal tranportation system
1997
6 Seiten, 2 Bilder, 8 Quellen
Aufsatz (Konferenz)
Englisch
Heuristic Search for the Best Paths in an Intermodal Transportation System
British Library Conference Proceedings | 1997
|Some aspects of metropolitan area tranportation problems
Engineering Index Backfile | 1953
|Best Neighbor Heuristic Search for Finding Minimum Paths in Transportation Networks
Transportation Research Record | 1998
|Best Neighbor Heuristic Search for Finding Minimum Paths in Transportation Networks
Online Contents | 1998
|