A Flow Algorithm for Network Synchronization
Operations Research · 1996 · Volume 44 · Issue 4
Abstract
The problem we treat is defined on a graph where each node is associated with a variable and there are loss functions defined on the arcs, depending on the difference between the corresponding node variables. The objective is to compute values for the node variables so as to minimize the sum of losses. We exploit the relation between this problem and network flows optimization and use it in developing an approximation algorithm for the problem. A main application of the problem is the synchronization of fixed cycle traffic signals.
Keywords
network flow algorithms, application to synchronization of node variables, production scheduling, synchronization of cyclic work stations, transportation traffic models, traffic signal syncronization
Enable JavaScript for citation tools and additional paper interactions.