Population-driven Urban Road Evolution Dynamic Model
- 435 Downloads
In this paper, we propose a road evolution model by considering the interaction between population distribution and urban road network. In the model, new roads need to be constructed when new zones are built, and existing zones with higher population density have higher probability to connect with new roads. The relative neighborhood graph and a Fermat-Weber location problem are introduced as the connection mechanism to capture the characteristics of road evolution. The simulation experiment is conducted to demonstrate the effects of population on road evolution. Moreover, the topological attributes for the urban road network are evaluated using degree distribution, betweenness centrality, coverage, circuitness and treeness in the experiment. Simulation results show that the distribution of population in the city has a significant influence on the shape of road network, leading to a growing heterogeneous topology.
KeywordsRoad evolution Population distribution Relative neighborhood Fermat-Webber location problem
This work was partially supported by the National Basic Research Program of China (2012CB725400), NSFC (71271024, 71322102), and the Foundation of State Key Laboratory of Rail Traffic Control and Safety (RCS2015ZZ003).
- Ding Y, Lou Y (1998) Application of fractal theory in the evaluation transportation network. J Shanghai Marit Univ 19(4):7–12Google Scholar
- Facchinei F, Pang JS (2003) Finite-dimensional variational inequalities and complementarity problems, vol I. Springer, New YorkGoogle Scholar
- Haggett P, Chorley R (1969) Network analysis in geography. Edward Arnold, LondonGoogle Scholar
- Levinson D, Xie F, Zhu S (2007) The co-evolution of land use and road networks. Proc 17th Int Sympo Transp Traffic Theory 111-126:839–859Google Scholar
- Liu HX,Wang DZW (2015) Global optimization method for network design problem with stochastic user equilibrium. Transp Res B 72:20–39Google Scholar
- Wang DZW, Liu HX, Szeto WY (2015) A novel discrete design problem formulation and its global optimization solution algorithm. Transp Res E 79:213–230Google Scholar
- Weiszfeld E (1937) Sur le point pour lequel la somme des distances de n points donnés est minimum. Tôhoku Math J 43:355–386Google Scholar
- Xie F, Levinson D (2011) Evolving transportation networks. SpringerGoogle Scholar
- Yang H, Huang HJ (1998) Principle of marginal-cost pricing: How does it work in a general road network? Transp Res A 32(1):45–54Google Scholar