Showing papers on "Bus network published in 2022"

Optimization Method for Conventional Bus Stop Placement and the Bus Line Network Based on the Voronoi Diagram

Abstract: With the rapid development of the economy, the existing conventional bus transit system finds it difficult to meet people’s increasing travel needs. In addition, with the emergence and rapid development of urban rail transit, it is also necessary to integrate the existing conventional bus transit system with the rail transit system to realize the optimization of the whole public transport system. This study introduces the concept of the Voronoi diagram and uses it to divide the service area of bus stops. Taking the average walking time of regional passengers to the station as the main index, the convenience of passengers in the service area was evaluated, and a set of candidate station sites is established. Against the background of urban rail transit, a complete optimization model for a conventional bus station layout and line network was proposed. Finally, taking Wuhan East Lake High-tech Development Zone as an example, two optimization schemes for the public transport system were obtained. Compared with the status quo, the optimized scheme had obvious improvement effects on the repetition coefficient of bus lines, per capita transfer time, bus line network coverage and station service rate. This has been recognized by the local authorities, which proves the practicality and scientificity of the optimization method of this study.

Optimization for Feeder Bus Route Model Design with Station Transfer

Abstract: To fully take the advantages of conventional bus and subway, and to maximize the overall feeder efficiency of the public transport system, the topic of feeder bus route optimization is studied in this paper. Considering the origin destination demand of passenger flow between subway stations and bus stations and transfer characteristics, the objective function is established with the minimum sum of bus operation cost and passenger travel cost. Taking into account the integrity of the feeder bus route, the rationality of the route, the route capacity and the station transfer factors, the constraints of the optimization model are constructed. Based on the idea of the genetic algorithm, the solution algorithm of the optimization model is developed. The genetic algorithm and enumeration algorithm are used to solve the optimization of the feeder bus route in this case, and the accuracy and efficiency of the solution are analyzed. The influence of the number of feeder bus routes on the system in the case network is compared and discussed. We compare and analyze the differences between the original bus network and the feeder bus network in terms of bus operation cost, passenger flow demand and total passenger travel cost. The research shows that the model and algorithm can find the approximate optimal solution of the feeder bus network scheme related to the subway through fewer iterations. The number of routes in the model has little impact on the whole feeder system, and the optimization scheme using five routes is effective and reasonable in this paper. Compared with the existing bus network, the optimization scheme has obvious advantages in improving the passenger-carrying rate, reducing the per capita travel cost and improving the overall operation efficiency of the system.

A comparative study of topological analysis and temporal network analysis of a public transport system

Abstract: This research investigated accessibility and connectivity of a public transport network calculated under two equally popular analytical approaches, namely the topological network analysis and the temporal network analysis, using the bus network in Ho Chi Minh City (HCMC), Vietnam as a case study. Specifically, we presented an apple-to-apple comparison of the two approaches to answer the question “What is the degree of discrepancy and/or loss of information, if any, in analyses using the topological network approach compared to those from the supposedly more computationally demanding temporal network approach?”. Stop-based accessibility metrics as well as measures of most-used infrastructure (bus stops and bus routes) were calculated, compared, and discussed for both approaches. In calculating shortest path between stop pairs, we adapted the multi-criteria profile connection scan algorithm for paths with earliest departure earliest arrival and minimal transfers. In representing the HCMC bus network, which had 253 directed routes servicing 4350 stops, the number of nodes and the number of edges in the temporal network over a 24-hour period were a few orders of magnitude larger than those in the topological network. Computing the shortest path between all stop pairs in the temporal network over a 3-hour period took at least an order of magnitude longer than that in the topological network. While results of network accessibility and most-used infrastructure from both representations of the bus network shared some qualitative similarities, they clearly demonstrated disadvantages of the topological network approach in capturing the temporal heterogeneity of a public transport network operation.

Optimal Network Design of Battery-Powered Electric Feeder Bus with Determination of Fleet Size and Number of Chargers

Abstract: This paper investigates an optimization problem regarding feeder bus network design for metro stations, based on the wide use of battery-powered electric buses. To characterize the problem,...

Node Centrality Comparison between Bus Line and Passenger Flow Networks in Beijing

Abstract: In recent decades, complex network theory has become one of the most important approaches for exploring the structure and dynamics of traffic networks. Most studies mainly focus on the static topology features of the traffic networks, and there are also increasing literature focusing on passenger flow networks. However, not much work has been completed on comparing the static networks with dynamic flow networks from the perspective of supply and demand. Therefore, this study aimed to apply the complex network approach to explore the spatial relationship between bus line organization and bus flows in Beijing. Based on the bus route data and the passenger flow data obtained from the Beijing smart bus card, this study investigated the spatial characteristics of the bus line network and the temporal bus flow networks, and presented a comparison analysis on the spatial relationship between them by using the node centrality indices, namely degree centrality, betweenness centrality and closeness centrality. The results show that the overall spatial patterns of node centralities between the bus line network and the bus flow network were similar, while there were also some differences. For weekdays, the correlation between them is higher, as calculated by the degree of centrality. For weekends, the two networks have a greater correlation measured by degree centrality and betweenness centrality. The highest coefficients of correlation between the line network and traffic network appear in the morning peak, which implies that the congestion issues during the morning peak hours might receive the highest priority in Beijing’s bus-line network planning. Our study can provide implications for policymakers to improve the public urban transport network, and thus enhance residents’ happiness.

Optimal Network Design of Battery-Powered Electric Feeder Bus with Determination of Fleet Size and Number of Chargers

Abstract: This paper investigates an optimization problem regarding feeder bus network design for metro stations, based on the wide use of battery-powered electric buses. To characterize the problem, a mixed integer programming model is formulated with the objective of minimizing the total cost of the electric feeder bus system, including the user and operator investment costs. The model considers the constraints of route length, bus stop coverage, vehicle capacity, and depot size. The solution incorporates a multiserver queuing submodel with limited system capacity to explore the relationship among the bus headway, the fleet size, and the number of depot-located chargers. Then a cost-optimized planning methodology is developed to solve these three variables for a given network. To solve the network optimization problem, a genetic algorithm that includes customized operators is developed to guide the solution evolution process. Synthetic case studies are conducted to test the model and the algorithm, and a sensitivity analysis on the important input parameters follows.

Designing Customised Bus Routes for Urban Commuters with the Existence of Multimodal Network – A Bi-Level Programming Approach

Abstract: Customised bus (CB) is a cutting-edge mean of transportation and has been implemented worldwide. To support the spread of the CB system, methodologies for CB network design have been conducted. However, a majority of them cannot be adopted directly for multi-modal transportation environment. In this paper, we proposed a bi-level programming model to fill this gap. The upper-level problem is to maximise the usage of the CB system with the limitation of operation constraints. Meanwhile, the lower-level problem is to capture the traveller’s choice by minimising traveller’s generalised cost during travel. A solving procedure via genetic algorithm is further proposed and validated via the metro data at Shanghai. The results indicated that the proposed CB route network would attract nearly 5,000 users during morning peak period under the given metro transaction data. We further studied the features of the selected routes and found that the CB network mainly served residence to commercial or industrial parks travellers and would provide travel service with fewer stops, and higher travel efficiency by travelling through expressway.

Maximizing access in transit network design

Abstract: This study adopts an Access-Oriented Design (AOD) framework for optimizing transit network design. We present and demonstrate a method to evaluate the best combination of local and express alternative transit system designs through the novel concept of ‘iso-access lines’. Two bus network system designs were explored for a greenfield development in suburban Sydney: through-routed transit lines (T-ways) with higher speeds and more direct service, but longer access and egress times, and local routes that provide additional spatial coverage. We developed scenarios with T-ways only, local routes only, and both, and computed transit access to jobs as a cumulative-opportunities measure for each scenario. Local routes offer greater overall access, while T-ways provide greater access-per-unit-cost. The optimal combination of the two was established by generating ‘iso-access’ lines and determining access-maximizing combinations for a given cost by applying production-theory principles. For 15-min access, the optimal combinations had T-way service frequency equivalent to 0.48 times that of local routes. This ratio increased to 1.45, 2.05 and 2.63 for 30-min, 45- min and 60-min access respectively. In practice, the method can be applied to determine optimal transit combinations for any given budget and desired access level.

Towards an Optimal Bus Frequency Scheduling: When the Waiting Time Matters

Abstract: Reorganizing bus frequencies to cater for the actual travel demands can significantly save the cost of the public transport system. Many, if not all, previous studies formulate this as a bus frequency optimization problem that tries to minimize passengers’ average waiting time. On the other hand, many investigations have confirmed that the user satisfaction drops faster as the waiting time increases. Consequently, this paper studies the bus frequency optimization problem considering the user satisfaction. Specifically, for the first time to our best knowledge, we study how to schedule the buses such that the total number of passengers who could receive their bus services within the waiting time threshold can be maximized. We propose two variants of the problem, FAST and FASTCO, to cater for different application needs and prove that both are NP-hard. To solve FAST effectively and efficiently, we first present an index-based $(1-1/e)$ -approximation algorithm. By exploiting the locality property of routes in a bus network, we further propose a partition-based greedy method that achieves a $(1-\rho)(1-1/e)$ approximation ratio. Then we propose a progressive partition-based greedy method to further boost the efficiency while achieving a $(1-\rho)(1-1/e-\varepsilon)$ approximation ratio. For the FASTCO problem, two greedy-based heuristic methods are proposed. Experiments on a real city-wide bus dataset in Singapore have been conducted to verify the efficiency, effectiveness, and scalability of our methods in addressing FAST and FASTCO respectively.

Analysis of Complex Network Characteristics of Bus Stations in City: A Case Study of the Changsha-Zhuzhou-Xiangtan Urban Agglomeration

Abstract: : Based on the current situation and operation of urban bus network stops, this paper uses complex network theory to analyse the topology of the constructed network. Taking the ChangZhuTan bus network as an example, the Space-L method is selected to establish a network topology model, and the topological characteristics of different networks are analysed by calculating the static indicators of the network (degree, degree distribution, average path length, clustering coefficient, etc.). The research results show that the ChangZhuTan bus network has scale-free network characteristics, but the small-world characteristics are not obvious, and the results of the indicator calculation are consistent, which provides a reference for urban transport The results show that the ChangZhuTan bus network has scale-free network characteristics, but the small-world characteristics are not obvious, and the results are consistent with the index calculation, which puts forward reference suggestions for urban transportation planning and development.

Effect of Zero Bus Load Flow on Network Reconfiguration of Distribution Network

Abstract: In this paper, a novel Student Psychology Based Optimization (SPBO) method with Zero Bus Load Flow (ZBLF) is proposed for the optimum placement of distributed generation sources (DGs) in the 33 bus distribution network (DN) with and without the network reconfiguration. To reduce the stress on the utility, a predefined/constant energy is considered to be imported from the utility at different load levels (annual hourly load patterns). The proposed method is used in the presence of multi-objective functions for the optimum placement of DGs with and without network reconfiguration that shows a considerable reduction in active power loss and voltage deviation as well as an increment in the annual energy savings. Besides, the comparative statistical analysis shows that the proposed method scored the first rank for all the cases and all the load percentages. This confirms the superiority of the proposed method over the different existing methods available in the literature.

An Efficient Algorithm for Reliability Evaluation of the Bus Network

Abstract: The bus network is widely used in industrial automation and avionics systems due to its many advantages. Network reliability is an important indicator of the bus network design and analysis. However, the widely used reliability evaluation method is not capable of dealing with the bus network. In this paper, we model the bus network without redundancy and the bus network with redundancy, propose the algorithms to calculate the two-terminal reliability and the k-terminal reliability of the bus network with redundancy, and verify the effectiveness of the algorithms in three scenarios. The experimental results show that when the reliability of the link reaches 0.9, the two-terminal reliability of the bus network with redundancy of six terminal nodes, eight terminal nodes, and ten terminal nodes is 40.95%, 52.17%, and 61.26% higher than that of the bus network without redundancy, respectively; k-terminal reliability is 61.26%, 74.58%, and 83.32% higher than that of the bus network without redundancy, respectively. The bus network with redundancy increases the communication paths for data exchange between devices, and has higher reliability than the bus network without redundancy. The algorithms proposed in this paper provide an effective solution for the reliability evaluation of the bus network. It perfects the reliability evaluation system of the network with different topology architectures.

Design and algorithm implementation of public traffic transfer model based on weighted directed graph

Abstract: The bus was the priority travel mode for most citizens in the urban public transportation network. The research of bus transfer and query algorithm, the design of a system that can run on the Android platform and can query bus information promptly and accurately has become a realistic application requirement. In this paper, in terms of the issue of public transport transfer query and transfer, a weighted directed graph was adopted to describe the bus network. The public transport transfer matrix was constructed by a weighted directed graph based on the bus network. According to the actual test, the bus route display, the query of the route and the query of the transfer scheme could be achieved by the designed algorithm, which proved that the algorithm was effective.

Intelligent Accidental Detection and Prevention System for Car using Can FD Protocol

Abstract: Controller Area Network with Flexible Data Rate (CAN FD) is a vehicle bus standard protocol designed especially for automotive application. By using CAN FD Bus protocol, ECUs (Electronic control units) of vehicles can communicate with each other. It is a high speed, bandwidth efficient network. In order to reduce point to point wiring harness in vehicle automation, CAN FD is suggested as a means for data communication within the vehicle environment. The benefits of CAN FD bus based network over traditional point to point schemes will offer increased flexibility and expandability for future technology insertions units. We have designed five nodes, 4-sensor nodes and 1-Bus monitor nodes. Sensor nodes and Bus monitor nodes are communicating with each other through CAN FD Bus. Bus monitor node collects all messages present on the CAN FD Bus and transmits to the PC by using the UART interface. The CAN FD monitor window is designed using Visual Studio.net which allows the time oriented buffering of CAN FD messages and visualization of the BUS data at the package level.

Performance Analysis of the Bus Topology Network for Effectual Data Distribution

Abstract: Stability, reliability, efficiency, and dependability necessitate a higher performance feature-based system in Ethernet LAN to meet the prevalent emergent technology of 5G and beyond 5G in the domain of networking. LAN technology has experienced the most progression since it came to reality. Despite its ability to achieve promising performance, the technology still keeps some topology characteristics that have a greater influence on its performance. This paper, therefore, addresses the high packet loss experienced in bus topology by investigating the performance of bus topology in four practical scenarios consisting of 10, 20, 30, and 40 nodes. In some applications, traffic was cautiously selected and configured in the application configuration to generate traffic for the modeling. These include HTTP, FTP, email, and databases before they were finally defined in the profile configuration. Substantial global and object statistics such as delay (sec), traffic-sent (bits/sec), traffic-received (bits/sec) for global, and throughput (bits/sec) for global were considered as network metrics for simulation in the OPNET environment. The results obtained proved that as the number of nodes increased, more traffic (bits/sec) were sent and received, more messages were delivered (bits/sec), the delay (sec) was lowered, but greater bit errors per packet were experienced in the network, thus making the bus topology not very suitable for a larger network.

Feeder Bus Reformation for an Urban Rail Project: The Case of Khon Kaen City, Thailand

Abstract: The ability to use public transportation should be available throughout the whole service area and the public transportation network should be well connected. This research compared the potential coverage of a feeder bus network in support of urban rail transportation, as well as the impact of future transit network plans on public transportation accessibility in the city of Khoan Kaen, Thailand. The performance of the public transportation system was predicted based on multimodal transport and the completed urban rail public transportation plan, as projected in the year 2036, in order to fill gaps in the existing feeder bus network. The feasibility and characteristics of the route reformation policy concept should provide an effective feeder network for the urban rail system. A comparative study was conducted on stakeholder impact for a three-fold scenario: 1) separate individual lines for bus routes; 2) both forms of feeder bus networks (conventional and reformed); and 3) access to three designated utility areas from the entire feeder bus network. In this scenario, the most effective urban mobility support was provided by public facilities combined with a major roadway directly connecting to the designated positions. The time used on the extended bus route network increased by around 11% on average for the entire trip, while accessibility increased by approximately 67.75%, 47.9%, and 43.68% for the entire multimodal transport network. These analytical results make a significant contribution to future knowledge on urban transformation through urban mass transit projects. The contribution of land acquisition was significant. Also, the demand-responsive connection approach used in this study can be adopted to determine feeder bus reformation options, particularly in emerging economies.

Exploring the Complexity of Urban Bus Network, a Perspective from the Bus Frequency Data

Abstract: AbstractThe topology and properties of public transport networks (PTNs) are an important focus of public transportation planning, but the bus frequency data is rarely considered in the study of PTN. This paper builds bus stop network and bus transit network with a new perspective: time-varying bus lines’ frequency. Based on these two types of network model, we investigate Nanjing PTN, analyzing the static topological properties and time-varying characteristics of it. Both networks, especially bus stop network, are small-world networks. The weighted bus stop network has 1581 nodes and 2355 edges. The weighted bus transit network has 50352 edges, which shows that the average transfer time of Nanjing PTN is 1.9. This network also reveals that although the average waiting time varies by 8.9 min at the most, the travel plan of passengers at different times does not change significantly. 92% of the nodes have no significant change in the betweenness centrality at different times. We take bus frequency into the consideration of evaluation and optimization of PTN, and it is exemplified that the bus frequency data plays an important role in it.KeywordsPublic transport networkWeighted complex network analysisTopological analysisBus frequency

Secure Communication between Arduinos using Controller Area Network(CAN) Bus

Abstract: Present-day vehicles have numerous Electronic Control Units (ECUs) and they communicate with each other over a network known as the Controller Area Network(CAN) bus. In this way, the CAN bus is a fundamental component of intra-vehicle communication. The CAN bus was designed without focusing on communication security and in this way it is vulnerable to many cyber attacks. As the vehicles are always connected to the Internet, the CAN bus is remotely accessible and could be hacked. To secure the communication between ECUs and defend against these cyber attacks, we apply a Hash Message Authentication Code(HMAC) to automotive data and demonstrate the CAN bus communication between two ECUs using Arduino UNO and MCP2515 CAN bus module.

Design and Analysis of Reduced-Connection Multiple Bus Systems: A Probabilistic Approach.

Abstract: In the dissertation we have proposed the first systematic and formal approach to reduce connectivity of general purpose multiple bus systems. The approach is based on a probabilistic technique. The hypothesis on which this dissertation is based stipulates that bus connectivity in multiple bus systems can be much reduced by removing connections which are only needed for highly improbable request patterns. With this approach, performance comparable to that of the original multiple bus system could be achieved while significantly reducing memory bus connectivity. The new architecture thus obtained (Probabilistically load reduced connection multiple bus system, or PRMB in short) might have different possible configurations each possibly with a different bus connectivity cost. We have studied the possible relationship among different possible configurations of PRMB systems and proposed an algorithm that determines the one with minimum memory-bus connectivity cost for a given performance level. Our analysis results strongly supported our hypothesis. The queuing problem for PRMB systems is a complicated one because of its unique modeling requirements. An interesting and innovative modification of aggregation technique has been developed to solve queuing problem taking into account bus contention in PRMB system. We have utilized the proposed approximate technique to determine the system throughput. We have also simulated the queuing networks without applying any approximations. Comparison of analytical results with simulation data indicated that our approximate method could accurately be used to model such queuing networks. The results indicated that our hypothesis is valid when queues are utilized. We have proposed another variant of the PRMB system which attempts to reduce the connectivity cost from both the processor side and the memory side. Our results indicated that, except under certain specific conditions, this variant of PRMB system did not offer any cost improvement over the original version. It is quite possible that PRMB system is so efficient that further reduction may not be possible without sacrificing some performance. The technique presented in this dissertation is of very general nature and could possibly be applied to other types of networks as well.

Intelligent Transportation Planning System Based on Urban Network Topology Modeling and Remote Sensing Data Analysis

Abstract: This article first studies the road general route planning problem, analyzes the urban road dynamic road network model modeling problem. Proposes a multi-path planning algorithm based on urban network topology modeling, and establishes bus network transfers and stops the two network models describe the practical significance of each feature parameter of the network model mapping the complex public transportation network. And choose the conventional public transportation network of remote sensing data analysis as the research sample, starting from the two aspects of bus transfer and bus station, establish the bus transfer network model and bus station network model.

Evaluation of Bus Operation Efficiency Based on Data Acquisition and CCR Model-Take Xi'an City As An Example

Abstract: The article collects the daily passenger flow of 10 selected bus lines during peak hours through the “vehicle investigation”, then process the data to eliminate useless data. To support the national “bus first” policy, the operation efficiency of bus routes is evaluated. This essay introduces the DEA index evaluation system to frame out the five influencing factors of road transportation, i.e the line attribute, transportation capacity, passenger feedback, etc. Ten bus lines in Xi'an are selected, combined with the known network parameters and map ranging function, using the ratio of input and output indicators of CCR formula, then simplify it to a linear planning model. Finally, matlab programming algorithm is used to determine the efficiency value of each bus line, then put forward suggestions for improvement of the lines that have not achieve effectiveness.

Study on the spatio-temporal distribution characteristics of bus full-load ratio under big data

Abstract: In view of the demand for the information of full-load rate in bus dispatching and the inaccuracy of calculating the full-load rate in big data environment, a full-load rate estimation model based on bus big data is constructed, combining the IC card information of bus, bus GPS information, bus station information and bus information, this paper deduces the bus station from the boarding station of the passengers, and puts forward the calculation method of the index of bus full load rate based on the IC card of bus, the real-time estimation of full-load ratio and the analysis of the space-time distribution of the full-load ratio are realized, the characteristics of the space-time distribution of the high-load ratio lines in a certain area are revealed, and the key bus corridors in a certain area are explored. Through case analysis, it is found that, compared with the traditional survey method, the calculation of bus full load ratio based on bus IC card information can find more accurate maximum passenger flow section and get more accurate calculation results, the calculation process is more efficient and can save manpower effectively. It can provide reference for the same city to calculate the index of city bus full load rate and analyze the characteristics of city bus passengers.

Bus Transportation Network Optimization in Competition of Two Bus Companies Starting with Similar/Different Routes

Abstract: This paper focuses on the bus transportation network optimization where two bus companies complete with each other to increase the number of passengers and analyzes how their networks change when the initial routes of two bus companies are similar or different. The intensive simulation of the competition of bus companies have revealed that (1) the similar initial route networks promote the companies to compete to increase the number of their passengers from the common passengers, while the different initial route networks promote them to increase that of their own passengers separately; and (2) the topology of the optimized route network composed of two bus companies does not drastically change in both similar and different initial bus routes.

Design of MIL-1394 bus simulation card

Abstract: In the development of MIL-1394 (Military 1394) products, users need to buy simulation equipment withdifferent functions when building simulation network. It is not only expensive,but also a burden for users to be familiar with the configuration mode and application interface of different equipment. Combined with IEEE-1394B (Institute of Electronic Engineers 1394b) and SAE AS5643 (Society of Automotive Engineers Aerospace Standard 5643) protocols, this paper designs a Mil-1394 bus four node simulation card, which is used to simulate the functions of CC (Control Computer) and RN (Remote Node) nodes in 1394 bus. It has four independent 1394 nodes and supports bus data recording error injection and other functions to realize the data transmission of 1394 bus network.