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.


    Access

    Access via TIB

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Heuristic search for the best paths in an intermodal tranportation system


    Contributors:
    Febbraro, A. DI (author) / Pasqui, S. (author) / Sacone, S. (author) / Serra, P. (author)


    Publication date :

    1997


    Size :

    6 Seiten, 2 Bilder, 8 Quellen



    Type of media :

    Conference paper


    Type of material :

    Print


    Language :

    English




    Heuristic Search for the Best Paths in an Intermodal Transportation System

    Di Febbraro, A. / Pasqui, L. / Sacone, S. et al. | British Library Conference Proceedings | 1997


    Some aspects of metropolitan area tranportation problems

    Davis, H.E. | Engineering Index Backfile | 1953



    Best Neighbor Heuristic Search for Finding Minimum Paths in Transportation Networks

    Adler, Jeffrey L. | Transportation Research Record | 1998