A Heuristic Algorithm to Find a Path to be Blocked by Minimizing Traffic Disruption

Simple item page
dc.contributor.authorDas, M.
dc.contributor.authorAmbati, S.S.
dc.contributor.authorChandrasekaran, K.
dc.date.accessioned2026-02-06T06:36:37Z
dc.date.issued2020
dc.description.abstractThis 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.
dc.identifier.citation2020 IEEE International Conference on Distributed Computing, VLSI, Electrical Circuits and Robotics, DISCOVER 2020 - Proceedings, 2020, Vol., , p. 29-34
dc.identifier.urihttps://doi.org/10.1109/DISCOVER50404.2020.9278058
dc.identifier.urihttps://idr.nitk.ac.in/handle/123456789/30570
dc.publisherInstitute of Electrical and Electronics Engineers Inc.
dc.subjectAggregate Traffic Minimization
dc.subjectATM algorithm
dc.subjectFlow Network
dc.subjectGraph Algorithm
dc.subjectPath Blocking
dc.titleA Heuristic Algorithm to Find a Path to be Blocked by Minimizing Traffic Disruption

Files

Collections

Conference Papers