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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    REAL-TIME OPTIMAL-ROUTE COMPUTATION: A HEURISTIC APPROACH


    Contributors:

    Published in:

    Publication date :

    1996-01-01


    Size :

    17 pages




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English