Hessian Riemannian Flow For Multi-Population Wardrop Equilibrium

원문 초록

In this paper, we address the problem of optimizing flows on generalized graphs that feature multiple entry points and multiple populations, each with varying cost structures. We tackle this problem by considering the multi-population Wardrop equilibrium, defined through variational inequalities. We rigorously analyze the existence and uniqueness of the Wardrop equilibrium. Furthermore, we introduce an efficient numerical method to find the solution. In particular, we reformulate the equilibrium problem as a distributed optimization problem over subgraphs and introduce a novel Hessian Riemannian flow method, a Riemannian-manifold-projected Hessian flow, to efficiently compute a solution. Finally, we demonstrate the effectiveness of our approach through examples in urban traffic management, including routing for diverse vehicle types and strategies for minimizing emissions in congested environments.