# Algorithm for finding traffic equilibrium

I watched a youtube video about a certain interesting property of springs and road networks. It made me think: if we represent a network of roads as a graph where edges are roads described by a throughput and latency, and vertices correspond to road junctions what would an efficient algorithm for determining the equilibrium (such that no car can make a faster route) of traffic look like? And as a bonus question: how would that algorithm change for different types of agents (say we try the find the equilibrium for super rational agents)

• It is unclear to me what you mean by equilibrium. An allocation of traffic such that no driver can cut their driving time by changing their route? Or do you mean maximum possible throughput? Do you have a single starting point and a single destination in mind, or can there be more? Try being more precise. Also, your question should be as self-contained as possible. I suppose no one will watch a video to find out what you're asking. (Certainly not me.) Also, how do roads react to congestion? Your question is very ambiguous. Dec 8, 2021 at 13:43
• (A small correction: multiple sources S and destinations D can be simulated by adding one new start and one destination node ($N_s$ and $N_d$), with edges from $N_s$ to every $s \in S$ , and from every $d \in D$ to $N_d$, all having zero latency and throughput equal to the capacity of the corresponding original start/end node. Because of this, the distinction between a single and multiple starting/ending nodes is not as relevant.) Dec 8, 2021 at 14:04
• An allocation of traffic such that no driver can cut their driving time by changing their route is what I meant. And there is a single destination. @JozefMikušinec Dec 8, 2021 at 22:16
• So, is this what you are looking for? en.wikipedia.org/wiki/Braess%27s_paradox#Finding_an_equilibrium Dec 8, 2021 at 22:21
• Also, it seems to me that your question has a name: "Traffic equilibrium problem". And there's a paper that discusses it and should contain an algorithm: jstor.org/stable/25767967 I'm new to this site so I don't know if this is enough of an answer, but if you're happy with this as is, let me know and I'll post this comment as an answer. Dec 8, 2021 at 22:27