Minimize Traffic Congestion: An Application of Maximum Flow in Dynamic Networks

An important characteristic of a network is its capacity to carry flow. What, given capacities on the arcs, is the maximum flow that can be sent between any two nodes? The dynamic version of the maximum flow problem on networks that generalizes the well-known static one. This basic combinatorial optimization problem has a large implementation for many practical problems. Traffic congestion is a consequence of the nature of supply and demand: capacity is time consuming and costly to build and is fixed for long time periods, demand fluctuates over time, and transport services cannot be stored to smooth imbalances between capacity and demand. In this paper, I tried to solve the traffic congestion problem i.e. Maximum flow of goods in a dynamic network with the help of a Lingo Model. The same can be generalized for the large product if the software supports the systems.