Please use this identifier to cite or link to this item:
http://idr.nitk.ac.in/jspui/handle/123456789/14754Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Das M. | |
| dc.contributor.author | Ambati S.S. | |
| dc.contributor.author | Chandrasekaran K. | |
| dc.date.accessioned | 2021-05-05T10:15:44Z | - |
| dc.date.available | 2021-05-05T10:15:44Z | - |
| dc.date.issued | 2020 | |
| dc.identifier.citation | 2020 IEEE International Conference on Distributed Computing, VLSI, Electrical Circuits and Robotics, DISCOVER 2020 - Proceedings , Vol. , , p. 29 - 34 | en_US |
| dc.identifier.uri | https://doi.org/10.1109/DISCOVER50404.2020.9278058 | |
| dc.identifier.uri | http://idr.nitk.ac.in/jspui/handle/123456789/14754 | - |
| dc.description.abstract | This paper discusses the problem of finding a path to be blocked from the source to the destination for a vehicle to pass by in such a way that the traffic disruption caused is minimum. The traffic disruption caused by blocking a path is measured by estimating the number of vehicles that would have crossed any of the vertices in the path if the path had not been blocked. It also presents a heuristic algorithm 'Aggregate Traffic Minimization' (ATM) to solve the above problem. The traffic disruption caused by the path chosen by the ATM algorithm was compared with that of a popular baseline algorithm and was found that ATM outperforms the baseline alzorithm in most cases. © 2020 IEEE. | en_US |
| dc.title | A Heuristic Algorithm to Find a Path to be Blocked by Minimizing Traffic Disruption | en_US |
| dc.type | Conference Paper | en_US |
| Appears in Collections: | 2. Conference Papers | |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.