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.
Directional lane‐allocation concerning demand uncertainty
IET Intelligent Transport Systems ; 7 , 4 ; 380-387
2013-12-01
8 pages
Article (Journal)
Electronic Resource
English
lane‐allocation operation , mathematical program with complementarity constraints , active sets , directional lane‐allocation , MPCC , robust lane‐allocation scheme , knapsack problems , mathematical programming , within‐day travel demand variations , binary knapsack problem , road traffic , worst‐case demand scenarios , demand uncertainty
Reconfigurable Capacity Allocation Under Uncertainty of Product Demand
British Library Conference Proceedings | 2004
|Lane detection using directional random walks
IEEE | 2008
|Lane Detection Using Directional Random Walks
British Library Conference Proceedings | 2008
|