Hits:

Indexed by:期刊论文

Date of Publication:2013-12-01

Journal:IET INTELLIGENT TRANSPORT SYSTEMS

Included Journals:SCIE、EI、Scopus

Volume:7

Issue:4

Page Number:380-387

ISSN No.:1751-956X

Key Words: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

Abstract: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.