Directional lane-allocation concerning demand uncertainty

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.