Directional lane-allocation concerning demand uncertainty

In this study, one-way restrictions are treated as a special case of lane allocation operations. The general lane allocation problem is devised as a mathematical program with complementarity constraints (MPCC). Another counterpart of the MPCC is devised to obtain a robust lane-allocation scheme that functions better against worst-case demand scenarios in order to accommodate day-to-day and within-day variations in travel demand. Solution algorithms based on active sets are proposed. Numerical examples validate the proposed model and algorithm.

Language

  • English

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 01506112
  • Record Type: Publication
  • Files: TRIS
  • Created Date: Jan 30 2014 12:48PM