4 citations · 5 across the 3 of their papers we have counts for
3 papers
math.OC2023★ 1 cited
A fresh look at symmetric traffic assignment and algorithm convergence
Priyadarshan N. Patil
Extensions of the static traffic assignment problem with link interactions were studied extensively in the past. Much of the network modeling community has since shifted to dynamic…
math.OC2022
Computationally-Efficient Decomposition Heuristic for the Static Traffic Assignment Problem
Venktesh Pandey, Priyadarshan N. Patil
Applications such as megaregional planning require efficient methods for solving traffic assignment problems (TAPs) on large-scale networks. We propose a decomposition heuristic th…
math.OC2021★ 4 cited
Budget-constrained rail electrification modeling using symmetric traffic assignment -- a North American case study
Priyadarshan N. Patil, Rydell Walthall, Stephen D. Boyles
We consider a budget constrained rail network electrification problem with associated changes in costs of energy usage (via path gradient and curvature), operations, and long-term…