Optimal-route computation is an important function that is needed in many applications, especially in transportation-related activities. In certain applications, the real-time processing of this computation is required. The conventional algorithms for computing optimal routes do not handle this real-time requirement very efficiently, especially when large networks are involved. Therefore, alternative algorithms are needed. Of the possible alternatives, heuristic algorithms are considered to treat the real-time constraint much more effectively than nonheuristic algorithms. This paper discusses a heuristic algorithm for real-time computation of routes and compares it with other techniques and approaches.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    REAL-TIME OPTIMAL-ROUTE COMPUTATION: A HEURISTIC APPROACH


    Beteiligte:

    Erschienen in:

    Erscheinungsdatum :

    01.01.1996


    Format / Umfang :

    17 pages




    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch




    Real-Time Optimal-Route Computation: A Heuristic Approach

    Chang, G.-L. / Smith, R. L. | British Library Online Contents | 1996


    Real-Time Optimal-Route Computation: A Heuristic Approach

    Karimi, H. A. | British Library Online Contents | 1996



    Real-Time Optimal-Route Computation: A Heuristic Approach: Response

    Karimi, H. A. | British Library Online Contents | 1996