Open AccessDirectional lane‐allocation concerning demand uncertainty
Author(s) -
Zhang Lihui,
Zhong Shaopeng
Publication year - 2013
Publication title -
iet intelligent transport systems
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.579
H-Index - 45
eISSN - 1751-9578
pISSN - 1751-956X
DOI - 10.1049/iet-its.2011.0217
Subject(s) - knapsack problem , mathematical optimization , complementarity (molecular biology) , computer science , scheme (mathematics) , set (abstract data type) , operations research , mathematics , mathematical analysis , genetics , biology , programming language
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.