Skip to content
KinPilot™Learn & Explore
Menu

Grades 9–12 · Systems

What limits flow through parallel paths?

Two conveyor branches can carry items side by side, yet a slower belt feeding both can still limit the whole route. Parallel paths add carrying capacity only where the rest of the system can supply and receive their combined flow. Capacity is an upper bound; throughput is the amount actually passing through the complete network each minute.

S21 visual explanationWith unlimited waiting supply, continuous divisible flow and upper-first routing, throughput is 8 items/min: upper 5, lower 3. Source, both paths and the shared exit all limit this fixed network.Locate the partsToy items per minute • no storage or lossSource 8Upper cap 5Lower cap 4Exit 10Rule: fill upper path first, then lowerFlow 5Flow 3Throughput: 8 items/min

In the diagramLocate the partsToy items per minute • no storage or lossSource 8Upper cap 5Lower cap 4Exit 10Rule: fill upper path first, then lowerFlow 5Flow 3Throughput: 8 items/min

The shared source limits throughput to 8 items per minute despite 9 items per minute of combined branch capacity. Upper-first routing sends 5 through the upper branch and 3 through the lower.

This directed network has one source connection, two independent branches, and one shared exit after the branches rejoin. In steady flow with no loss or storage, the incoming amount equals the outgoing amount at each split or merge. Neither branch may exceed its capacity, and their combined flow cannot exceed either shared connection.

For this arrangement, greatest feasible throughput is the smallest of source capacity, the sum of branch capacities, and exit capacity. The illustration gives 8 items per minute at the source, branch capacities of 5 and 4, and an exit capacity of 10. Although the branches could together carry 9, the shared source limits throughput to 8.

A stated routing rule fills the upper branch first, then the lower. The 8-item total therefore divides into 5 upper and 3 lower. Extra lower-branch capacity does not create another item or bypass the source limit. With different capacities, the combined branches or shared exit could become the bottleneck instead.

Widening the lower branch alone would not raise the eight-item total while the source stays limited to eight. If the source became faster, the combined branch capacity could become the next limit; a smaller exit could instead hold everything back after the paths rejoin. The bottleneck belongs to the connected route, so adding capacity in one place helps only when that place is limiting the whole flow.

About this explanation

This fixed directed network assumes unlimited waiting supply, divisible continuous flow, and no delays, losses or storage. Upper-first routing determines the branch amounts. The minimum-of-three rule follows from this topology, not a general network algorithm or a law of fluid pressure.

Starting knowledge: Interpret rates and upper-bound inequalities; conserve flow at a split and a merge.

Sources

  • Princeton University, Kevin Wayne — Network Flow I: Capacity and Flow Conservation
← Grades 9–12 topics