Abstract: A dynamic simulation model is extended to represent traffic system disruptions in the form of lane closures. The model has two components: a macroparticle traffic simulator, and a user decisions component which comprises ...

Abstract: The use of microscopic traffic‐simulation codes in practice and in research has generally been limited by available computational resources to very small portions of an urban area's network. Supercomputers offer an ...

Abstract: The most widely used algorithm for solving traffic assignment problems is the Frank-Wolfe (FW) algorithm. Its popularity is attributed to its modest memory requirements and simplicity. However, it is also known that FW ...