The multinomial probit model has long been used in transport applications as the basis for mode- and route-choice in computing network flows, and in other choice contexts when estimating preference parameters. It is well known that computation of the probit choice probabilities presents a significant computational burden, since they are based on multivariate normal integrals. Various methods exist for computing these choice probabilities, though standard Monte Carlo is most commonly used. In this article we compare two analytical approximation methods (Mendell–Elston and Solow–Joe) with three Monte Carlo approaches for computing probit choice probabilities. We systematically investigate a wide range of parameter settings and report on the accuracy and computational efficiency of each method. The findings suggest that the accuracy and efficiency of an optimally ordered Mendell–Elston analytic approximation method offers great potential for wider use.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Analytic approximations for computing probit choice probabilities


    Contributors:

    Published in:

    Publication date :

    2014-02-07


    Size :

    21 pages




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English




    A multinomial probit analysis of shanghai commute mode choice

    Wang, Ke / Bhat, Chandra R. / Ye, Xin | Online Contents | 2022




    Evaluation of Logit and Probit Models in Mode-Choice Situation

    Ahmed Hamdy Ghareib | British Library Online Contents | 1996


    Bayesian estimation of multinomial probit models of work trip choice

    Kim, Yeonbae / Kim, Tai-Yoo / Heo, Eunnyeong | Online Contents | 2003