scholarly journals A Method of Bus Network Optimization Based on Complex Network and Beidou Vehicle Location

2019 ◽  
Vol 11 (4) ◽  
pp. 97 ◽  
Author(s):  
Peixin Dong ◽  
Dongyuan Li ◽  
Jianping Xing ◽  
Haohui Duan ◽  
Yong Wu

Aiming at the problems of poor time performance and accuracy in bus stops network optimization, this paper proposes an algorithm based on complex network and graph theory and Beidou Vehicle Location to measure the importance of bus stops. This method narrows the scope of points and edges to be optimized and is applied to the Jinan bus stop network. In this method, the bus driving efficiency, which can objectively reflect actual road conditions, is taken as the weight of the connecting edges in the network, and the network is optimized through the network efficiency. The experimental results show that, compared with the original network, the optimized network time performance is good and the optimized network bus driving efficiency is improved.

2020 ◽  
Vol 2020 ◽  
pp. 1-16
Author(s):  
Rui Li ◽  
Xin Xue ◽  
Hua Wang

Queue forming behind a bus stop on an urban street is common and a traffic bottleneck usually occurs around the bus stop area. The bus stop failure means arriving buses cannot move into the bus stop due to limited capacity but have to wait for available loading areas. It is related with the transit operation level. Traditionally, the failure rate (FR), defined as the percentage of buses that arrives at the bus stop to find all loading areas occupied, is adopted in bus capacity analysis. However, the concept of FR is unable to quantitatively analyze failure characteristics in terms of its dispersion and uncertainty over time. Therefore, in this paper, we propose a new index called failure duration rate (FDR) to evaluate the bus stop failure, which can characterize waiting time for traffic delay calculation and capacity drop estimation. The automatic vehicle location data at eight bus stops in Wujiang District Suzhou, China, over 56 working days, are used to analyze the temporal characteristics of FR and FDR. We next examined the failed service duration characteristics during peak hours at the eight bus stops. Based on these characteristics analyses, we then proposed a Distribution Fitting and Cumulative Distribution Correlation (DF-CDC) approach to explore the correlation between FDR and FR at the same cumulative distribution function levels and validated the bus stop failure performance using the cross-validation method. The analysis results revealed that (i) FR fluctuates more significant than FDR, (ii) FDR is a more robust index than FR in describing the traffic characteristics incurred by bus stop failures, and (iii) FDR performs better in failure characteristics analysis than FR.


Author(s):  
Shuang Song ◽  
Dawei Xu ◽  
Shanshan Hu ◽  
Mengxi Shi

Habitat destruction and declining ecosystem service levels caused by urban expansion have led to increased ecological risks in cities, and ecological network optimization has become the main way to resolve this contradiction. Here, we used landscape patterns, meteorological and hydrological data as data sources, applied the complex network theory, landscape ecology, and spatial analysis technology, a quantitative analysis of the current state of landscape pattern characteristics in the central district of Harbin was conducted. The minimum cumulative resistance was used to extract the ecological network of the study area. Optimized the ecological network by edge-adding of the complex network theory, compared the optimizing effects of different edge-adding strategies by using robustness analysis, and put forward an effective way to optimize the ecological network of the study area. The results demonstrate that: The ecological patches of Daowai, Xiangfang, Nangang, and other old districts in the study area are small in size, fewer in number, strongly fragmented, with a single external morphology, and high internal porosity. While the ecological patches in the new districts of Songbei, Hulan, and Acheng have a relatively good foundation. And ecological network connectivity in the study area is generally poor, the ecological corridors are relatively sparse and scattered, the connections between various ecological sources of the corridors are not close. Comparing different edge-adding strategies of complex network theory, the low-degree-first strategy has the most outstanding performance in the robustness test. The low-degree-first strategy was used to optimize the ecological network of the study area, 43 ecological corridors are added. After the optimization, the large and the small ecological corridors are evenly distributed to form a complete network, the optimized ecological network will be significantly more connected, resilient, and resistant to interference, the ecological flow transmission will be more efficient.


Author(s):  
Chao Wang ◽  
Weijie Chen ◽  
Yueru Xu ◽  
Zhirui Ye

For bus service quality and line capacity, one critical influencing factor is bus stop capacity. This paper proposes a bus capacity estimation method incorporating diffusion approximation and queuing theory for individual bus stops. A concurrent queuing system between public transportation vehicles and passengers can be used to describe the scenario of a bus stop. For most of the queuing systems, the explicit distributions of basic characteristics (e.g., waiting time, queue length, and busy period) are difficult to obtain. Therefore, the diffusion approximation method was introduced to deal with this theoretical gap in this study. In this method, a continuous diffusion process was applied to estimate the discrete queuing process. The proposed model was validated using relevant data from seven bus stops. As a comparison, two common methods— Highway Capacity Manual (HCM) formula and M/M/S queuing model (i.e., Poisson arrivals, exponential distribution for bus service time, and S number of berths)—were used to estimate the capacity of the bus stop. The mean absolute percentage error (MAPE) of the diffusion approximation method is 7.12%, while the MAPEs of the HCM method and M/M/S queuing model are 16.53% and 10.23%, respectively. Therefore, the proposed model is more accurate and reliable than the others. In addition, the influences of traffic intensity, bus arrival rate, coefficient of variation of bus arrival headway, service time, coefficient of variation of service time, and the number of bus berths on the capacity of bus stops are explored by sensitivity analyses.


2012 ◽  
Vol 253-255 ◽  
pp. 1776-1781
Author(s):  
Wen Hua Jiang ◽  
Xian Xiang Wang ◽  
Hang Fei Lin

Starting from several aspects of site location, site size and site layout, this document studies the urban bus stop systematically, proposes the setting principles of urban bus stop. Take Yiwu bus stops for example, which focus on the analysis of the reasonable setting of the sites, and has provided guidance for the layout of urban bus stop.


2018 ◽  
Vol 32 (05) ◽  
pp. 1850067 ◽  
Author(s):  
Michele Bellingeri ◽  
Zhe-Ming Lu ◽  
Davide Cassi ◽  
Francesco Scotognella

Complex network response to node loss is a central question in different fields of science ranging from physics, sociology, biology to ecology. Previous studies considered binary networks where the weight of the links is not accounted for. However, in real-world networks the weights of connections can be widely different. Here, we analyzed the response of real-world road traffic complex network of Beijing, the most prosperous city in China. We produced nodes removal attack simulations using classic binary node features and we introduced weighted ranks for node importance. We measured the network functioning during nodes removal with three different parameters: the size of the largest connected cluster (LCC), the binary network efficiency (Bin EFF) and the weighted network efficiency (Weg EFF). We find that removing nodes according to weighted rank, i.e. considering the weight of the links as a number of taxi flows along the roads, produced in general the highest damage in the system. Our results show that: (i) in order to model Beijing road complex networks response to nodes (intersections) failure, it is necessary to consider the weight of the links; (ii) to discover the best attack strategy, it is important to use nodes rank accounting links weight.


2016 ◽  
pp. 1660-1676 ◽  
Author(s):  
Michael Galdi ◽  
Paporn Thebpanya

In the current system, school bus stops in Howard County, Maryland are manually placed along the school bus routes based on safety, cost-efficiency, and many other variables. With such liberal placement, bus stops are sometimes placed unnecessarily. This issue is prevalent in many school districts and often results in needlessly close bus stop proximity. In this study, the authors implemented a GIS-based heuristic to assist school officials in optimizing their districts bus stop placement. They also estimated the proportion of county-wide bus stops that could be eliminated by this approach. Following the constraints determined by State and local guidelines, the ArcGIS Network Analyst Extension was used to identify unnecessary bus stops across the study area. The initial output was re-evaluated by school officials in order to determine if those bus stops would be eliminated. The results indicate that approximately 30% of the existing bus stops were marked as “candidates for elimination” by the GIS process. After a review of these candidates, it was determined that at least 15% of the total school bus stops could be eliminated. Statistical estimates lent credence to the benefit of a re-evaluation of these bus stops. The method developed in this study can easily be replicated. Hence, it may inspire other school systems to exercise the same approach. Additionally, the results provide a gateway for future studies in examining more efficient school bus routes with less travel time, as well as investigating how much the carbon footprint of school bus fleets can be reduced.


Entropy ◽  
2019 ◽  
Vol 21 (3) ◽  
pp. 300 ◽  
Author(s):  
Shuaizong Si ◽  
Bin Wang ◽  
Xiao Liu ◽  
Chong Yu ◽  
Chao Ding ◽  
...  

Alzheimer’s disease (AD) is a progressive disease that causes problems of cognitive and memory functions decline. Patients with AD usually lose their ability to manage their daily life. Exploring the progression of the brain from normal controls (NC) to AD is an essential part of human research. Although connection changes have been found in the progression, the connection mechanism that drives these changes remains incompletely understood. The purpose of this study is to explore the connection changes in brain networks in the process from NC to AD, and uncovers the underlying connection mechanism that shapes the topologies of AD brain networks. In particular, we propose a mutual information brain network model (MINM) from the perspective of graph theory to achieve our aim. MINM concerns the question of estimating the connection probability between two cortical regions with the consideration of both the mutual information of their observed network topologies and their Euclidean distance in anatomical space. In addition, MINM considers establishing and deleting connections, simultaneously, during the networks modeling from the stage of NC to AD. Experiments show that MINM is sufficient to capture an impressive range of topological properties of real brain networks such as characteristic path length, network efficiency, and transitivity, and it also provides an excellent fit to the real brain networks in degree distribution compared to experiential models. Thus, we anticipate that MINM may explain the connection mechanism for the formation of the brain network organization in AD patients.


Complexity ◽  
2020 ◽  
Vol 2020 ◽  
pp. 1-18 ◽  
Author(s):  
Vee-Liem Saw ◽  
Luca Vismara ◽  
Lock Yue Chew

We study how N intelligent buses serving a loop of M bus stops learn a no-boarding strategy and a holding strategy by reinforcement learning. The no-boarding and holding strategies emerge from the actions of stay or leave when a bus is at a bus stop and everyone who wishes to alight has done so. A reward that encourages the buses to strive towards a staggered phase difference amongst them whilst picking up passengers allows the reinforcement learning process to converge to an optimal Q-table within a reasonable amount of simulation time. It is remarkable that this emergent behaviour of intelligent buses turns out to minimise the average waiting time of commuters, in various setups where buses move with the same speed or different speeds, during busy as well as lull periods. Cooperative actions are also observed, e.g., the buses learn to unbunch.


2019 ◽  
Vol 11 (3) ◽  
pp. 803 ◽  
Author(s):  
Maria Corazza ◽  
Nicola Favaretto

Walking and transit are the backbone of sustainable mobility. Bus stops not only represent the connection between the two, but are also central in dictating the attractiveness of the latter. Accessibility of bus stops becomes, then, pivotal in increasing both attractiveness and sustainability of public transport. The paper describes a multi-step methodology to evaluate bus stops’ accessibility starting from a cluster of seven indicators describing objective and subjective features influencing passengers’ choice toward a given bus stop. The indicators are weighed by a questionnaire submitted to experts. Finally, a multicriteria analysis is developed to obtain a final score describing univocally the accessibility of each stop. Outcomes are mapped and a case study in Rome is reported as an example, with 231 bus and tram stops assessed accordingly. Results shows the relevance of the urban network and environment in evaluating the accessibility and in promoting more sustainable mobility patterns. Research innovation relies on the possibility to merge data from different fields into a specific GIS map and easily highlight for each bus stop the relationships between built environment, passengers’ comfort, and accessibility, with the concluding goal to provide advanced knowledge for further applications.


Sign in / Sign up

Export Citation Format

Share Document