Regarding the one-way restriction as a special case of the lane-allocation operation, this study formulates the general lane-allocation problem as a mathematical program with complementarity constraints (MPCC). Recognising the day-to-day and within-day travel demand variations, another counterpart of the MPCC is formulated to obtain a robust lane-allocation scheme that performs better against a set of worst-case demand scenarios. Solution algorithms based on active sets are proposed to address the problems by sequentially solving some relaxed-MPCC and a binary knapsack problem. Numerical examples are presented to validate the proposed model and algorithm.


    Access

    Access via TIB


    Export, share and cite



    Title :

    Directional lane-allocation concerning demand uncertainty


    Contributors:

    Published in:

    Publication date :

    2013-12-01


    Size :

    8 pages




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English




    Directional lane‐allocation concerning demand uncertainty

    Zhang, Lihui / Zhong, Shaopeng | Wiley | 2013

    Free access

    Reconfigurable Capacity Allocation Under Uncertainty of Product Demand

    Pasek, Z. J. | British Library Conference Proceedings | 2004



    Lane detection using directional random walks

    Luo-Wei Tsai, / Jun-Wei Hsieh, / Chi-Hung Chuang, et al. | IEEE | 2008


    Lane Detection Using Directional Random Walks

    Luo-Wei, T. / Hsieh, J. | British Library Conference Proceedings | 2008