Maximizing Accessibility on Congested Networks

The problem of locating facilities to maximize their accessibility on networks where costs are functions of flow volume is considered. In particular, an accessibility model developed by Leonardi is extended to bipartite and tree networks whose arc costs are determined by a flow-dependent congestion function. The resultant nonseparable equilibrium problem is solved heuristically, and numerical simulations are used to explore the model's behavior under varying conditions.