| On-Line Papers – Copyright This online paper may be cited or briefly quoted in line with the usual academic conventions. You may also download them for your own personal use. This paper must not be published elsewhere (e.g. to mailing lists, bulletin boards etc.) without the author's explicit permission. Please note that if you copy this paper you must: • include this copyright note • not use the paper for commercial purposes or gain in any way • you should observe the conventions of academic citation in a version of the following form: Complexity Analysis of Urban Transportation Networks., published at: http://www.cosmobilities.net/fullpaper.php?id=27 |
| Complexity Analysis of Urban Transportation Networks. |
| Wednesday 15th of October 2008 |
| Posted by fabiolamanna |
|
I would like to introduce you my research project called Time=net.work. The latter has got the purpose to extend complex networks theories to transportation systems under a new time-related point of view. Coupled biological and chemical systems, neural networks, social interacting species, the Internet and the World Wide Web are only a few examples of complex networks, i.e. systems composed by a large number of highly interconnected dynamical units. During the last ten years these kinds of systems have been the subject of many studies related to comprehend their common structural properties and their dynamics. Complex networks are supposed to be very stable and robust structures in case of failures or deliberate attacks on the system. Moreover, due to their well-known properties, they allow to model several real networks in order to find the key elements for a complete and efficient communication activity between nodes.Analysis have been taken firstly on Berlin Transportation Network (consisting of U-bahn, S-bahn, Regional bahn, Bus and Tram networks) and then to several other test cases. The relative results help in finding statistical properties about the connectivity and the structure of such system both topologically and considering the travel time and the frequency of the scheduled services. Figures are related of some of the outputs available from the tool: they represent the betweenness centrality measure (i.e. a measure that takes into account the amount of shortest path passing through nodes) in a particular graph called space of changes . This graph considers the amount of the direct connections available by U-bahn, S-bahn and Regional bahn throughout the whole city of Berlin. ![]() By means of this and other extended measures of Efficiency I ve been able to analysed the most connected and the most critical stations and routes in function of travel times and frequency of the services. This is a new approach to robustness of transportation networks which allows to find which and how many nodes have to assurance their functionality in order to provide a desired Level of Service in case of failures or deliberate attacks. I m currently been developing the website (www.timenetwork.org) of the project with new features and test cases. Many other outputs will be available. |
Showing page 1 of 1 pages