REAL-TIME OPTIMAL-ROUTE COMPUTATION: A HEURISTIC APPROACH

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.

  • Availability:
  • Corporate Authors:

    GORDON AND BREACH SCIENCE PUB.

    AMSTERDAM:
    ,    
  • Authors:
    • Karimi, H A
  • Publication Date: 1996-5

Language

  • English

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 00724365
  • Record Type: Publication
  • Files: TRIS
  • Created Date: Sep 2 1996 12:00AM