scholarly journals Applying Ollivier-Ricci curvature to indicate the mismatch of travel demand and supply in urban transit network

Author(s):  
Yaoli Wang ◽  
Zhou Huang ◽  
Ganmin Yin ◽  
Haifeng Li ◽  
Liu Yang ◽  
...  
Author(s):  
Gabriel Wilkes ◽  
Roman Engelhardt ◽  
Lars Briem ◽  
Florian Dandl ◽  
Peter Vortisch ◽  
...  

This paper presents the coupling of a state-of-the-art ride-pooling fleet simulation package with the mobiTopp travel demand modeling framework. The coupling of both models enables a detailed agent- and activity-based demand model, in which travelers have the option to use ride-pooling based on real-time offers of an optimized ride-pooling operation. On the one hand, this approach allows the application of detailed mode-choice models based on agent-level attributes coming from mobiTopp functionalities. On the other hand, existing state-of-the-art ride-pooling optimization can be applied to utilize the full potential of ride-pooling. The introduced interface allows mode choice based on real-time fleet information and thereby does not require multiple iterations per simulated day to achieve a balance of ride-pooling demand and supply. The introduced methodology is applied to a case study of an example model where in total approximately 70,000 trips are performed. Simulations with a simplified mode-choice model with varying fleet size (0–150 vehicles), fares, and further fleet operators’ settings show that (i) ride-pooling can be a very attractive alternative to existing modes and (ii) the fare model can affect the mode shifts to ride-pooling. Depending on the scenario, the mode share of ride-pooling is between 7.6% and 16.8% and the average distance-weighed occupancy of the ride-pooling fleet varies between 0.75 and 1.17.


2004 ◽  
Vol 18 (19n20) ◽  
pp. 1043-1049 ◽  
Author(s):  
JIANJUN WU ◽  
ZIYOU GAO ◽  
HUIJUN SUN ◽  
HAIJUN HUANG

Many systems can be represented by networks as a set of nodes joined together by links indicating interaction. Recently studies have suggested that a lot of real networks are scale-free, such as the WWW, social networks, etc. In this paper, discoveries of scale-free characteristics are reported on the network constructed from the real urban transit system data in Beijing. It is shown that the connectivity distribution of the transit network decays as a power-law, and the exponent λ is about equal to 2.24 from the simulation graph. Based on the scale-free network topology structure of the transit network, if only transit "hub nodes" are controlled well, the transit network can resist random failures (such as traffic congestion, traffic accidents, etc.) successfully.


2015 ◽  
Vol 42 (7) ◽  
pp. 3760-3773 ◽  
Author(s):  
Hang Zhao ◽  
Wangtu (Ato) Xu ◽  
Rong Jiang

2021 ◽  
Vol 13 (23) ◽  
pp. 13366
Author(s):  
Hiroe Ando ◽  
Fumitaka Kurauchi

The road network is one of the most permanent elements of the physical structure of cities, and the long-term impacts should be considered for effective and efficient road network improvement. It is therefore important to catch up on how the road will be used after construction. However, we do not have much knowledge on the pattern and time lag in the change process of travel demand and supply in the real situation. To explore such changes, this study proposes to evaluate a network with eigenvector centrality (EC) measures that can evaluate the importance of nodes in a network. We believe the analysis based on topological properties by the graph theory is suitable to verify the evolution of road networks. This study analysed long-term changes over 20 years in an actual city to understand the impact of road network improvements. The EC analysis with the weights of traffic indices obtained from survey data evaluates the connectivity of road services on the supply side, and traffic concentration on the demand side.


2018 ◽  
Vol 7 (3.20) ◽  
pp. 140
Author(s):  
Ahmed Tarajo BUBA ◽  
Lai Soon LEE

In this paper, the urban transit routing problem is addressed by using a real-world urban transit network. Given the road network infrastructure and the demand, the problem consists in designing routes such that the service level as well as the operator cost are optimized. The optimality of the service level is measured in terms of average journey time and the route set length. A differential evolution approach is proposed to solve the problem. An improved sub-route reversal repair mechanism is introduced to deal with the infeasibility of route sets. Computational results on a real network produce solutions that are close to the lower bound values of the passenger and the operator costs. In addition, the proposed algorithm produces approximate Pareto fronts that enable the transit operator to evaluate the trade-off between the passenger and passenger costs. 


Sign in / Sign up

Export Citation Format

Share Document