Open Access Open Access  Restricted Access Subscription Access
Open Access Open Access Open Access  Restricted Access Restricted Access Subscription Access

Optimal Achievable Path Algorithm to Identify an Efficient Route for Commuters in a Road Traffic Network


Affiliations
1 Department of Computer Science and Engineering, Kalyani Government Engineering College, Kalyani-741325, West Bengal, India
     

   Subscribe/Renew Journal


This paper aims to provide an optimal achievable path (OAP) algorithm using which an automobile can find the optimal path from its source to its destination. Optimal path refers to that specific path which decreases the amount of congestion the vehicle has to face and also moderates the distance it has to cover for the same. The algorithm works by representing the overall traffic network under consideration as a graph and then finding out the optimal path amongst all possibilities based on the weightage allotted to each path.

Keywords

Traffic Flow Graph, Possible Path Tree.
User
Subscription Login to verify subscription
Notifications
Font Size

Abstract Views: 337

PDF Views: 4




  • Optimal Achievable Path Algorithm to Identify an Efficient Route for Commuters in a Road Traffic Network

Abstract Views: 337  |  PDF Views: 4

Authors

Ratul Bhattacharjee
Department of Computer Science and Engineering, Kalyani Government Engineering College, Kalyani-741325, West Bengal, India
Anabil Munshi
Department of Computer Science and Engineering, Kalyani Government Engineering College, Kalyani-741325, West Bengal, India
Akashnil Sarkar
Department of Computer Science and Engineering, Kalyani Government Engineering College, Kalyani-741325, West Bengal, India

Abstract


This paper aims to provide an optimal achievable path (OAP) algorithm using which an automobile can find the optimal path from its source to its destination. Optimal path refers to that specific path which decreases the amount of congestion the vehicle has to face and also moderates the distance it has to cover for the same. The algorithm works by representing the overall traffic network under consideration as a graph and then finding out the optimal path amongst all possibilities based on the weightage allotted to each path.

Keywords


Traffic Flow Graph, Possible Path Tree.



DOI: https://doi.org/10.22485/jaei%2F2015%2Fv85%2Fi3-4%2F119864