Generalized gap acceptance models for unsignalized intersections
Abhishek (),
Marko A. A. Boon () and
Michel Mandjes ()
Additional contact information
Abhishek: University of Amsterdam
Marko A. A. Boon: Eindhoven University of Technology
Michel Mandjes: University of Amsterdam
Mathematical Methods of Operations Research, 2019, vol. 89, issue 3, No 3, 385-409
Abstract:
Abstract This paper contributes to the modeling and analysis of unsignalized intersections. In classical gap acceptance models vehicles on the minor road accept any gap greater than the critical gap, and reject gaps below this threshold, where the gap is the time between two subsequent vehicles on the major road. The main contribution of this paper is to develop a series of generalizations of existing models, thus increasing the model’s practical applicability significantly. First, we incorporate driver impatience behavior while allowing for a realistic merging behavior; we do so by distinguishing between the critical gap and the merging time, thus allowing multiple vehicles to use a sufficiently large gap. Incorporating this feature is particularly challenging in models with driver impatience. Secondly, we allow for multiple classes of gap acceptance behavior, enabling us to distinguish between different driver types and/or different vehicle types. Thirdly, we use the novel M $$^X$$ X /SM2/1 queueing model, which has batch arrivals, dependent service times, and a different service-time distribution for vehicles arriving in an empty queue on the minor road (where ‘service time’ refers to the time required to find a sufficiently large gap). This setup facilitates the analysis of the service-time distribution of an arbitrary vehicle on the minor road and of the queue length on the minor road. In particular, we can compute the mean service time, thus enabling the evaluation of the capacity for the minor road vehicles.
Keywords: Unsignalized intersection; Priority-controlled intersection; Merging time; Gap acceptance with impatience; Stochastic capacity analysis; Queueing theory (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)
Downloads: (external link)
http://link.springer.com/10.1007/s00186-019-00662-0 Abstract (text/html)
Access to the full text of the articles in this series is restricted.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:mathme:v:89:y:2019:i:3:d:10.1007_s00186-019-00662-0
Ordering information: This journal article can be ordered from
http://www.springer.com/economics/journal/00186
DOI: 10.1007/s00186-019-00662-0
Access Statistics for this article
Mathematical Methods of Operations Research is currently edited by Oliver Stein
More articles in Mathematical Methods of Operations Research from Springer, Gesellschaft für Operations Research (GOR), Nederlands Genootschap voor Besliskunde (NGB)
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().