Bus bridging has been widely used to connect stations affected by urban rail transit disruptions. This paper designs bus bridging routes for passengers in case of urban rail transit disruption. The types of urban rail transit disruption between Origin-Destination stations are summarized, and alternative bus bridging routes are listed. First, the feasible route generation method is established. Feasible routes for each pair of the disruption Origin-Destination stations include urban rail transit transfer, direct bus bridging, and indirect bus bridging. Then the feasible route generation model with the station capacity constraint is established. The k-short alternative routes are generated to form the bus bridging routes. Lastly, by considering the bus bridging resource constraints, the final bus bridging routes are obtained by merging and filtering the initial bridging routes. Numerical results of an illustrative network show that the bus bridging routes generated from the proposed model can significantly reduce travel delay of blocked passengers, and it is necessary to maintain the number of passengers in the urban rail transit below the station capacity threshold for ensuring a feasible routing design. One more important finding of this work is that the direct bridging route is preferred for short travel distances, while the indirect bridging route is preferred for longer travel distances. After the bridging bus routes are taken, the passenger’s total travel time is significantly lower than when no measures are taken. However, after the capacity constraint of a station is considered, the passenger’s total travel time will be increased by 3.49% compared with not considering a capacity constraint.
Predicting traffic operational condition is crucial to urban transportation planning and management. A large variety of algorithms were proposed to improve the prediction accuracy. However, these studies were mainly based on complete data and did not discuss the vulnerability of massive data missing. And applications of these algorithms were in high-cost under the constraints of high quality of traffic data collecting in real-time on the large-scale road networks. This paper aims to deduce the traffic operational conditions of the road network with a small number of critical segments based on taxi GPS data in Xi’an city of China. To identify these critical segments, we assume that the states of floating cars within different road segments are correlative and mutually representative and design a heuristic algorithm utilizing the attention mechanism embedding in the graph neural network (GNN). The results show that the designed model achieves a high accuracy compared to the conventional method using only two critical segments which account for 2.7% in the road networks. The proposed method is cost-efficient which generates the critical segments scheme that reduces the cost of traffic information collection greatly and is more sensible without the demand for extremely high prediction accuracy. Our research has a guiding significance on cost saving of various information acquisition techniques such as route planning of floating car or sensors layout.
To determine which graphic and color combination for a 3-dimensional visual illusion speed reduction marking scheme presents the best visual stimulus, five parameters were designed. According to the Balanced Incomplete Blocks-Law of Comparative Judgment, three schemes, which produce strong stereoscopic impressions, were screened from the 25 initial design schemes of different combinations of graphics and colors. Three-dimensional experimental simulation scenes of the three screened schemes were created to evaluate four different effects according to a semantic analysis. The following conclusions were drawn: schemes with a red color are more effective than those without; the combination of red, yellow and blue produces the best visual stimulus; a larger area from the top surface and the front surface should be colored red; and a triangular prism should be painted as the graphic of the marking according to the stereoscopic impression and the coordination of graphics with the road.
The world is currently seeing frequent local outbreaks of epidemics, such as COVID-19 and Monkeypox. Preventing further propagation of the outbreak requires prompt implementation of control measures, and a critical step is to quickly infer patient zero. This backtracking task is challenging for two reasons. First, due to the sudden emergence of local epidemics, information recording the spreading process is limited. Second, the spreading process has strong randomness. To address these challenges, we tailor a gnn-based model to establish the inverse statistical association between the current and initial state implicitly. This model uses contact topology and the current state of the local population to determine the possibility that each individual could be patient zero. We benchmark our model on data from important epidemiological models on five real temporal networks, showing performance significantly superior to previous methods. We also demonstrate that our method is robust to missing information about contact structure or current state. Further, we find the individuals assigned higher inferred possibility by model are closer to patient zero in terms of core number and the activity sequence recording the times at which the individual had contact with other nodes.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.