DSpace Repository

Conventional Optimization Technique Based Methodology to Estimate Gap Acceptance Functions

Show simple item record

dc.contributor.author Vikram, Durgesh
dc.date.accessioned 2022-12-19T06:54:20Z
dc.date.available 2022-12-19T06:54:20Z
dc.date.issued 2020-07
dc.identifier.uri https://link.springer.com/article/10.1007/s40890-020-00106-z
dc.identifier.uri http://dspace.bits-pilani.ac.in:8080/xmlui/handle/123456789/7945
dc.description.abstract The definition of a critical gap in literature supports that it not only varies from driver to driver but also for (over) rejected gaps by a driver. In this light, multinomial probit (MNP) models were proposed in the past as gap acceptance functions. There are few methodologies available in the literature to estimate these functions. These methodologies are either computationally expensive or involve sophisticated mathematics. This is possibly one of the reasons due to which MNP models are not explored extensively as a tool to model critical gaps. Further, estimation of such gap acceptance functions always leads to maximization of likelihood functions. This paper proposes a methodology based on a conventional optimization technique for the first time to estimate the parameters of a class of gap acceptance functions. It is also shown that the estimation results match with those from another method, namely CHOMP. The proposed method turns out to be a simple yet effective one. en_US
dc.language.iso en en_US
dc.publisher Springer en_US
dc.subject Civil Engineering en_US
dc.subject Gap acceptance function en_US
dc.subject Multinomial probit model en_US
dc.subject Optimization en_US
dc.subject Unsignalized intersection en_US
dc.title Conventional Optimization Technique Based Methodology to Estimate Gap Acceptance Functions en_US
dc.type Article en_US


Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record

Search DSpace


Advanced Search

Browse

My Account