Premium
Maximizing Accessibility on Congested Networks
Author(s) -
Liu Cheng,
Ralston Bruce A.
Publication year - 1989
Publication title -
geographical analysis
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.773
H-Index - 65
eISSN - 1538-4632
pISSN - 0016-7363
DOI - 10.1111/j.1538-4632.1989.tb00891.x
Subject(s) - bipartite graph , computer science , mathematical optimization , flow network , flow (mathematics) , arc (geometry) , tree (set theory) , function (biology) , volume (thermodynamics) , traffic volume , mathematics , theoretical computer science , transport engineering , engineering , combinatorics , geometry , graph , physics , quantum mechanics , evolutionary biology , biology
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.