点击次数：

论文类型：期刊论文

发表时间：2013-12-01

发表刊物：IET INTELLIGENT TRANSPORT SYSTEMS

收录刊物：SCIE、EI、Scopus

卷号：7

期号：4

页面范围：380-387

ISSN号：1751-956X

关键字：knapsack problems; mathematical programming; road traffic; directional lane-allocation; demand uncertainty; lane-allocation operation; mathematical program with complementarity constraints; MPCC; within-day travel demand variations; robust lane-allocation scheme; worst-case demand scenarios; active sets; binary knapsack problem

摘要：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.