Impact of Drivers’ Waiting Time on the Gap Acceptance at Median, Uncontrolled T-Intersections

2022 ◽  
pp. 149-166
Author(s):  
Adrian Barchański
Keyword(s):  
Waiting Time ◽  
Gap Acceptance

Study on Pedestrian Risk Exposure at Unsignalized Intersection in a Country with Extreme Vehicle Heterogeneity and Poor Lane Discipline

2017 ◽  
Vol 2634 (1) ◽  
pp. 69-77 ◽  
Author(s):  
Bhupali Dutta ◽  
Vinod Vasudevan
Keyword(s):  
Waiting Time ◽  
Urban Traffic ◽  
Heterogeneous Traffic ◽  
Gap Acceptance ◽  
Vehicle Type ◽  
Unsignalized Intersections ◽  
Road Users ◽  
The Right ◽  
Pedestrian Crossing ◽  
Two Wheeler

The pedestrian is an integral element in the urban road infrastructure. Extreme vehicle heterogeneity, poor lane discipline, lack of adequate infrastructure, and road users’ poor understanding of the right-of-way and yielding make Indian roads extremely dangerous for pedestrians, especially at intersections. Since motorists, in general, do not yield to pedestrians at unsignalized intersections, pedestrians are forced to wait. When the waiting time exceeds a particular threshold, a pedestrian may attempt an unsafe crossing by accepting rolling gaps. The motivation behind this research paper was to understand the effect of waiting time on pedestrian rolling gap acceptance behavior at unsignalized intersections in India under heterogeneous traffic. This paper presents a study on pedestrian crossing behavior at unsignalized intersections in an urban traffic environment that used the survival analysis approach. The field data were collected from six sites in the city of Kanpur, India. The results show that rolling gap acceptance behavior is affected by various factors, such as pedestrian demographic characteristics, approaching vehicle features, and pedestrian group composition. Male pedestrians behave more aggressively and undertake unsafe street crossings. When pedestrians are part of a group, they do not accept rolling gaps easily. One interesting finding of the study is that when the approaching vehicle type is a two-wheeler or when vehicles are not in a platoon, the probability of accepting a rolling gap decreases.

Predictors of waiting time for liver TX: A three-year experience

2001 ◽  
Vol 120 (5) ◽  
pp. A370-A370
Author(s):  
C BOBROWSKI ◽  
H GHADIMPOOR ◽  
M STENECK ◽  
X ROGIERS ◽  
C BROELSCH ◽  
...  
Keyword(s):  
Waiting Time

A two unit standby redundant system with standby failure and repair waiting time

Optimization ◽  
1973 ◽  
Vol 4 (6) ◽  
pp. 453-462
Author(s):  
L. Cunningham ◽  
N. Singh
Keyword(s):  
Waiting Time ◽  
Redundant System

A quantitative continuity theorem for the mean stationary waiting time in GI/GI/1

Optimization ◽  
1976 ◽  
Vol 7 (4) ◽  
pp. 595-599
Author(s):  
M. Kotzturek ◽  
D. Stoyan
Keyword(s):  
Waiting Time ◽  
Continuity Theorem ◽  
The Mean ◽  
Stationary Waiting Time

Effects of Waiting Time on Treatment Engagement

2014 ◽  
Author(s):  
A.M.L. Westin ◽  
C.L. Barksdale ◽  
S.H. Stephan
Keyword(s):  
Waiting Time ◽  
Treatment Engagement

Superfast TB test slashes waiting time

Nature ◽  
2010 ◽  
Author(s):  
Apoorva Mandavilli
Keyword(s):  
Waiting Time

Task Scheduling Algorithm based on Resources Segregation in Cloud Environment

2018 ◽  
pp. 96-101
Author(s):  
Shailendra Raghuvanshi ◽  
Priyanka Dubey
Keyword(s):  
Load Balancing ◽  
Task Scheduling ◽  
Waiting Time ◽  
Virtual Machines ◽  
Scheduling Algorithm ◽  
Cloud Environment ◽  
Task Scheduling Algorithm ◽  
Machine Utilization ◽  
Independent Tasks ◽  
Optimal Machine

Load balancing of non-preemptive independent tasks on virtual machines (VMs) is an important aspect of task scheduling in clouds. Whenever certain VMs are overloaded and remaining VMs are under loaded with tasks for processing, the load has to be balanced to achieve optimal machine utilization. In this paper, we propose an algorithm named honey bee behavior inspired load balancing, which aims to achieve well balanced load across virtual machines for maximizing the throughput. The proposed algorithm also balances the priorities of tasks on the machines in such a way that the amount of waiting time of the tasks in the queue is minimal. We have compared the proposed algorithm with existing load balancing and scheduling algorithms. The experimental results show that the algorithm is effective when compared with existing algorithms. Our approach illustrates that there is a significant improvement in average execution time and reduction in waiting time of tasks on queue using workflowsim simulator in JAVA.

Sign in / Sign up

Export Citation Format

Share Document