Generalized gap acceptance models for unsignalized intersections

Abhishek, Marko A.A. Boon (Corresponding author), Michel Mandjes

Research output: Contribution to journalArticleAcademicpeer-review

12 Downloads (Pure)

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 /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.

Original languageEnglish
Pages (from-to)385-409
Number of pages25
JournalMathematical Methods of Operations Research
Volume89
Issue number3
Early online date18 Mar 2019
DOIs
Publication statusPublished - 1 Jun 2019

Fingerprint

Intersection
Minor
Driver
Merging
Model
Batch Arrivals
Acceptance
Queueing Model
Queue Length
Queue
Roads
Series
Dependent
Evaluation
Arbitrary
Modeling

Keywords

  • Gap acceptance with impatience
  • Merging time
  • Priority-controlled intersection
  • Queueing theory
  • Stochastic capacity analysis
  • Unsignalized intersection

Cite this

@article{592c2dedf6af468c97aa4bb9fe68594f,
title = "Generalized gap acceptance models for unsignalized intersections",
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 /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 = "Gap acceptance with impatience, Merging time, Priority-controlled intersection, Queueing theory, Stochastic capacity analysis, Unsignalized intersection",
author = "Abhishek and Boon, {Marko A.A.} and Michel Mandjes",
year = "2019",
month = "6",
day = "1",
doi = "10.1007/s00186-019-00662-0",
language = "English",
volume = "89",
pages = "385--409",
journal = "Mathematical Methods of Operations Research",
issn = "1432-2994",
publisher = "Physica-Verlag",
number = "3",

}

Generalized gap acceptance models for unsignalized intersections. / Abhishek, ; Boon, Marko A.A. (Corresponding author); Mandjes, Michel.

In: Mathematical Methods of Operations Research, Vol. 89, No. 3, 01.06.2019, p. 385-409.

Research output: Contribution to journalArticleAcademicpeer-review

TY - JOUR

T1 - Generalized gap acceptance models for unsignalized intersections

AU - Abhishek,

AU - Boon, Marko A.A.

AU - Mandjes, Michel

PY - 2019/6/1

Y1 - 2019/6/1

N2 - 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 /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.

AB - 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 /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.

KW - Gap acceptance with impatience

KW - Merging time

KW - Priority-controlled intersection

KW - Queueing theory

KW - Stochastic capacity analysis

KW - Unsignalized intersection

UR - http://www.scopus.com/inward/record.url?scp=85063209651&partnerID=8YFLogxK

U2 - 10.1007/s00186-019-00662-0

DO - 10.1007/s00186-019-00662-0

M3 - Article

AN - SCOPUS:85063209651

VL - 89

SP - 385

EP - 409

JO - Mathematical Methods of Operations Research

JF - Mathematical Methods of Operations Research

SN - 1432-2994

IS - 3

ER -