In most hierarchical routing algorithms, the origin and destination at the lower map level are not represented at the higher level. This often leads to a less optimum solution than desired. In this paper, we propose a novel routing strategy, which relies on promoting the origin and destination nodes to the higher level in order to improve the accuracy of the route computation. The proposed technique adopts smaller natural grids, which allows for the incorporation of origin-and-destination pair and concatenation of any two natural grids. It is shown that the technique developed lends well for managing large cities and that the increase in the average travel time is minimal. Moreover, the proposed routing strategy leads to the reduction in the maximum number of nodes that are involved in the computation at all levels of the hierarchy.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Improving hierarchical route computations for roadway networks


    Beteiligte:
    Quek Kai Hock, (Autor:in) / Srikanthan, T. (Autor:in)


    Erscheinungsdatum :

    2001-01-01


    Format / Umfang :

    594806 byte




    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch



    Improving Hierarchical Route Computations for Roadway Networks

    Quek, K. H. / Srikanthan, T. / IEEE | British Library Conference Proceedings | 2001


    A Hierarchical Representation of Roadway Networks

    Quek, K.H. / ITS Congress Association | British Library Conference Proceedings | 2000


    Improving seeing efficiency with roadway lighting

    Rex, C.H. | Engineering Index Backfile | 1956


    Roadway-induced ride quality reconnaissance and route planning

    LU JIANBO / FELIV DIMITAR P / HROVAT DAVOR et al. | Europäisches Patentamt | 2015

    Freier Zugriff

    Roadway

    Engineering Index Backfile | 1902