Urban Traffic Simulated From A Dual Perspective Hu Mao-Bin University of Science and Technology of China Hefei, P.R. China

Slides:



Advertisements
Similar presentations
Complex Networks Advanced Computer Networks: Part1.
Advertisements

Swarm-Based Traffic Simulation
PEDESTRIANS Osama Tabash Khaled El-Yazory Dr. Essam Almasri
Analysis and Modeling of Social Networks Foudalis Ilias.
School of Information University of Michigan Network resilience Lecture 20.
Generated Waypoint Efficiency: The efficiency considered here is defined as follows: As can be seen from the graph, for the obstruction radius values (200,
Exploring The Relationship Between Urban Morphology And Resilience In A Few Neighbourhoods In Pretoria Darren Nel & Karina Landman University of Pretoria.
4. PREFERENTIAL ATTACHMENT The rich gets richer. Empirical evidences Many large networks are scale free The degree distribution has a power-law behavior.
Weighted networks: analysis, modeling A. Barrat, LPT, Université Paris-Sud, France M. Barthélemy (CEA, France) R. Pastor-Satorras (Barcelona, Spain) A.
1 Evolution of Networks Notes from Lectures of J.Mendes CNR, Pisa, Italy, December 2007 Eva Jaho Advanced Networking Research Group National and Kapodistrian.
Complex Networks Third Lecture TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AA TexPoint fonts used in EMF. Read the.
A Mobile Infrastructure Based VANET Routing Protocol in the Urban Environment School of Electronics Engineering and Computer Science, PKU, Beijing, China.
Some Theoretical Results on Two Idealized Typical Road Traffic Networks Mingzhe Li Faculty of Economics Fukuoka University.
The Barabási-Albert [BA] model (1999) ER Model Look at the distribution of degrees ER ModelWS Model actorspower grid www The probability of finding a highly.
The structure of the Internet. How are routers connected? Why should we care? –While communication protocols will work correctly on ANY topology –….they.
TSF: Trajectory-based Statistical Forwarding for Infrastructure-to-Vehicle Data Delivery in Vehicular Networks Jaehoon Jeong, Shuo Guo, Yu Gu, Tian He,
Identifying Patterns in Road Networks Topographic Data and Maps Henri Lahtinen Arto Majoinen.
An Analysis of the Optimum Node Density for Ad hoc Mobile Networks Elizabeth M. Royer, P. Michael Melliar-Smith and Louise E. Moser Presented by Aki Happonen.
CS 728 Lecture 4 It’s a Small World on the Web. Small World Networks It is a ‘small world’ after all –Billions of people on Earth, yet every pair separated.
Route Planning Vehicle navigation systems, Dijkstra’s algorithm, bidirectional search, transit-node routing.
On Scaling Time Dependent Shortest Path Computations for Dynamic Traffic Assignment Amit Gupta, Weijia Xu Texas Advanced Computing Center Kenneth Perrine,
Technische Universität München 1 Traffic Simulation with Queues Ferienakademie, Sarntal Neven Popov.
Large-scale organization of metabolic networks Jeong et al. CS 466 Saurabh Sinha.
(Social) Networks Analysis III Prof. Dr. Daning Hu Department of Informatics University of Zurich Oct 16th, 2012.
Developing Analytical Framework to Measure Robustness of Peer-to-Peer Networks Niloy Ganguly.
GUI: GPS-Less Traffic Congestion Avoidance in Urban Area with Inter-Vehicular Communication Presenter: Zhen Jiang or
Tonghong Li, Yuanzhen Li, and Jianxin Liao Department of Computer Science Technical University of Madrid, Spain Beijing University of Posts & Telecommunications.
Complex Networks First Lecture TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AA TexPoint fonts used in EMF. Read the.
Mapping City Wide Travel Times Andrew Hardin. Project Goal Encouraging alternate transportation – NYC- Bike Share – Boulder’s Transportation Management.
Cognitive ability affects connectivity in metapopulation: A simulation approach Séverine Vuilleumier The University of Queensland.
Self-Similarity of Complex Networks Maksim Kitsak Advisor: H. Eugene Stanley Collaborators: Shlomo Havlin Gerald Paul Zhenhua Wu Yiping Chen Guanliang.
Hong Zhang The Hong Kong Polytechnic University and Zhilin Li The Hong Kong Polytechnic University Structural.
Hong Zhang The Hong Kong Polytechnic University and Zhilin Li The Hong Kong Polytechnic University Structural.
Social Network Analysis Prof. Dr. Daning Hu Department of Informatics University of Zurich Mar 5th, 2013.
Small-Scale and Large-Scale Routing in Vehicular Ad Hoc Networks Wenjing Wang 1, Fei Xie 2 and Mainak Chatterjee 1 1 School of Electrical Engineering and.
Robustness of complex networks with the local protection strategy against cascading failures Jianwei Wang Adviser: Frank,Yeong-Sung Lin Present by Wayne.
Easiest-to-Reach Neighbor Search Fatimah Aldubaisi.
Yongqin Gao, Greg Madey Computer Science & Engineering Department University of Notre Dame © Copyright 2002~2003 by Serendip Gao, all rights reserved.
Mitigation strategies on scale-free networks against cascading failures Jianwei Wang Adviser: Frank,Yeong-Sung Lin Present by Chris Chang.
Most of contents are provided by the website Graph Essentials TJTSD66: Advanced Topics in Social Media.
D e p a r t m e n t o f A r c h I t e c t u r e _ U n I v e r s I t y o f T h e s s a l y _ G r e e c e Accessibility Instrument: connectivity (working.
A. Bazzani, B. Giorgini, S. Rambaldi Physics of the City Lab Dept. of Physics - CIG – INFN Models and tools for the analysis.
1 Utilizing Shared Vehicle Trajectories for Data Forwarding in Vehicular Networks IEEE INFOCOM MINI-CONFERENCE Fulong Xu, Shuo Gu, Jaehoon Jeong, Yu Gu,
Fundamental Principles of Traffic Flow
1 Importance and Exposure in Road Network Vulnerability Analysis: A Case Study for Northern Sweden Erik Jenelius Transport and Location Analysis Dept.
Network Connectivity of VANETs in Urban Areas Wantanee Viriyasitavat, Ozan K. Tonguz, Fan Bai IEEE communications society conference on sensor, mesh and.
Po-Yu Chen, Zan-Feng Kao, Wen-Tsuen Chen, Chi-Han Lin Department of Computer Science National Tsing Hua University IEEE ICPP 2011 A Distributed Flow-Based.
Transport in weighted networks: optimal path and superhighways Collaborators: Z. Wu, Y. Chen, E. Lopez, S. Carmi, L.A. Braunstein, S. Buldyrev, H. E. Stanley.
Timmy Galvin Computer Systems Lab. Traffic simulation Communication Traffic Jams What causes a jam?
Generated Trips and their Implications for Transport Modelling using EMME/2 Marwan AL-Azzawi Senior Transport Planner PDC Consultants, UK Also at Napier.
Enhancing the capacity of on-ramp system by controlling the entrance gap Bin Jia, Xingang Li a, Rui Jiang b, Ziyou Gao a Bin Jia a, Xingang Li a, Rui Jiang.
1 Travel Times from Mobile Sensors Ram Rajagopal, Raffi Sevlian and Pravin Varaiya University of California, Berkeley Singapore Road Traffic Control TexPoint.
Mapping of Traffic Conditions at Downtown Thessaloniki with the Help of GPS Technology P. D. Savvaidis and K. Lakakis Aristotle University of Thessaloniki,
Efficient Placement and Dispatch of Sensors in a Wireless Sensor Network You-Chiun Wang, Chun-Chi Hu, and Yu-Chee Tseng IEEE Transactions on Mobile Computing.
Transportation Networks September 9, 2014 Michael Lin Alex Farrell Ziqi Zhu Sanjeev Ramachadra.
Network Dynamics and Simulation Science Laboratory Structural Analysis of Electrical Networks Jiangzhuo Chen Joint work with Karla Atkins, V. S. Anil Kumar,
Response network emerging from simple perturbation Seung-Woo Son Complex System and Statistical Physics Lab., Dept. Physics, KAIST, Daejeon , Korea.
Scaling Properties of the Internet Graph Aditya Akella With Shuchi Chawla, Arvind Kannan and Srinivasan Seshan PODC 2003.
Dynamic Network Analysis Case study of PageRank-based Rewiring Narjès Bellamine-BenSaoud Galen Wilkerson 2 nd Second Annual French Complex Systems Summer.
A Place-based Model for the Internet Topology Xiaotao Cai Victor T.-S. Shi William Perrizo NDSU {Xiaotao.cai, Victor.shi,
12.Nov.2007 Capacity of Ad Hoc Wireless Networks Jinyang Li Charles Blake Douglas S. J. De Coutu Hu Imm Lee Robert Morris Paper presentation by Tonio Gsell.
Network Analyst. Network A network is a system of linear features that has the appropriate attributes for the flow of objects. A network is typically.
Cmpe 588- Modeling of Internet Emergence of Scale-Free Network with Chaotic Units Pulin Gong, Cees van Leeuwen by Oya Ünlü Instructor: Haluk Bingöl.
International Interdisciplinary Seminar
T-Share: A Large-Scale Dynamic Taxi Ridesharing Service
Structural Holes for Forming Hierarchical Road Network
Empirical analysis of Chinese airport network as a complex weighted network Methodology Section Presented by Di Li.
A Probabilistic Routing Protocol for Mobile Ad Hoc Networks
Department of Computer Science University of York
Continuous Density Queries for Moving Objects
Presentation transcript:

Urban Traffic Simulated From A Dual Perspective Hu Mao-Bin University of Science and Technology of China Hefei, P.R. China

Contents  Introduction of Urban Traffic Problem  Dual Graph of City Traffic Network  Traffic Model From Dual Perspective  Simulation Results  Open Questions

Introduction: Traffic Jam in Big Cities

BeiJing 14 Sep. 2006

BeiJing 1 Aug. 2007

Tai Yuan

Traffic Problem  Transition from free flow to jam  Efficient navigation strategy  Balance of overall capacity and individual traveling time  City planning & Environment

2. Dual Graph Micro & Macro Approaches  Road (High Way) Traffic --Microscopic 1.Interaction of vehicles on highway 2.Occurrence/development of jam 3.Focus on vehicle speed, density, flux  Network Traffic – Macroscopic 1.Urban Planning 2.static/dynamic Traffic distribution

Two Representations of Urban Network System  Primal: intersections (or settlements) are turned into nodes and roads (or lines of relationship) are turned into edges.  Dual: roads are turned into nodes, intersections are turned into links between the corresponding nodes.

Steps of Dual Representation

six 1-square mile samples

Primal Graphs of the 6 cities

dual graphs of the 6 cities

Compare Primal & Dual  Primal: intuitive, the value of distance can be easily associated to edges. But it can not characterize the common notion of “ main roads ” in urban traffic systems. It violates the intuitive notion that an intersection is where two roads cross, not where four roads begin.  Dual: one can have many “ conceptually countless ” edges for each node. This leads to the recognition of scale-free behavior for the degree distribution of urban street networks.

Empirical Statistical Results of Urban Dual Graphs  Planned Cities --- The degree distribution is exponential.  Self-Organized Cities --- Power-Law Scaling of degree distribution: A Few Main Roads: Many Intersections Most are Minor Roads: few intersections

Shortcoming of Space Syntax  Largely subjective construction process of axial mapping  Abandonment of any reference to geographic-Euclidean space: a street is one node no matter how long its real length is.  Metric distance is the core element of most traffic flow studies

3. Traffic Model on Dual Graph  Degree Ki: number of intersections  Holding Ability Ci: maximum number of vehicles the road can hold. Ci= × Ki, -ability of one segment

Node Related Terms  Turning Ability Ti: maximum number of vehicles turning from the road into the neighboring roads per time step – Ti =  × Ki,  - ability of one intersection

1) Adding of Vehicles  The entering of vehicles into the system is controlled by a Poisson process with an entering rate R. Each new vehicle is given a random origin and destination.

2) Navigation of Vehicles  A conceptual local searching strategy is considered in this paper Each vehicle performs local searching among the neighboring roads of the current road. If a vehicle's destination is found in the nearest neighborhood, its direction will be set to the target. Otherwise, the vehicle performs random walk in the system. Once a vehicle reaches its destination, it is removed from the system.  Other Strategies: Shortest Path, Local Routing, Efficient Routing ……

3) Movement of Vehicles in the Road  Vehicle Speed: assuming a homogeneous vehicle movement along one given road: Vi = Vmax (1.0i)  Vmax is the maximum velocity possible in the urban system, i = Ni/Ci is the local vehicle density (Ni is the number of vehicles on road i)  This equation reflects that the vehicles will take Vmax when there is no vehicle on the road, and that the velocity decreases linearly until no vehicle can move when i =1.0.

3) Movement of Vehicles in the Road  Travel Distance: a vehicle enters a road at the mth intersection and leaves at the nth intersection, it must travel the distance along the road: d = L0  |m-n| Lo: average length of one segment

Empirical Statistical Results of Urban Dual Graphs  Planned Cities --- The degree distribution is exponential.  Self-Organized Cities --- Power-Law Scaling of degree distribution: A Few Main Roads: Many Intersections Most are Minor Roads: few intersections

Underlying Dual Network  1) Self-organized Scale-Free network  2) Well-Planned Lattice Grid

4.Simulation Results: Flow States & Phase Transition  Free Flow, Flow with Crisis, Congestion

2) Flux Fluctuation Near Critical Point  The ‘ crisis ’ -like behavior is one of the manifestations of the approach to a congested regime at the critical posting rate Rc.

 There is more fluctuation of flux in the lattice grid. But the number of running vehicles on lattice is much larger than that on the SF network.  Rc is a critical point for the phase transition from free flow to jam.  Rc can be used to determine the overall capacity of the urban system

3) Overall Capacity I – SF Rc increase with Vmax (beta) and then come to saturation.

 To improve the overall efficiency of the urban system, we need to enhance the road capacity together with the intersection capacity.  However, because the vehicle speed can not go beyond a certain value in cities, and because the intersection capacity can only be limitedly improved, there will be an unavoidable limit to the improvement of urban traffic efficiency, given that the network topology is fixed.  One should think of other ways to improve urban traffic efficiency when the limit is reached, such as adding shortcuts, developing subways, employing better navigation strategies, and so on.

Overall Capacity II- Lattice Grid

4) Traveling Time I – SF network  a power-law and an exponential cutoff (due to the finite network size)

Traveling Time II – Lattice Grid  Roughly follows an exponential distribution

Comparing SF network & Lattice  lattice grids are more efficient than a self-organized network:  1) The average number of vehicles running on the grid is much higher than that on the scale-free network  2) The critical entering rate Rc takes much larger value on the lattice grid  3) The vehicles have to travel for a much longer time in the self-organized network, probably because of the high cost of navigating in the system

5. Conclusions  Urban traffic can be studied on dual graph with more efficiency.  Flux fluctuation, Phase Transition, overall Capacity, Traveling time can be easily investigated.  Lattice grids perform better than self-organized networks  The model can be beneficial to:  1) the evaluation of overall efficiency of urban system  2) the alleviation of congestion of modern cities  3) Urban planning and some other related problems

Open Questions  1) the role of traffic control methods  2) interaction of vehicles in the road  3) differences between major and minor roads  4) more rational driving behaviors of the vehicles – Better navigation strategy  5) urban network generation models

Thank You VERY much!!!