TY - JOUR
T1 - Lane-Based Optimization for Macroscopic Network Configuration Designs
AU - Wong, C. K.
AU - Liu, Yi
PY - 2017/7/19
Y1 - 2017/7/19
N2 - Lane markings (arrows) at individual intersections serve as interfaces to connect upstream and downstream intersections in signal-controlled networks. Demand flows from origins to destinations may need to pass through a series of intersections. If lane markings are not well established to ban turns at intersections, then paths connecting origin and destination (OD) pairs could be inefficient. Due to indirect connections, road users need to take longer paths to reach their destinations. Conventionally, network configurations are fixed inputs for network analysis. In the present study, concepts of the lane-based designs for individual signalized intersections are extended for signal-controlled network designs. Taking OD demand flows as inputs, the proposed algorithm will optimize all lane markings and assigned lane flows on approach lanes. Paths (flows) will then be optimized by linking up the optimized lane markings across upstream and downstream intersections. Traffic signal settings at individual intersections will be optimized simultaneously by maximizing the reserve capacity for the entire OD demand flow matrix. The problem is formulated as a Binary-Mixed-Integer-Linear-Program (BMILP) and a standard branch-and-bound routine is applied to solve for global optimum solutions. A numerical example using a 4-intersection network will be given to demonstrate the effectiveness of the proposed design methodology.
AB - Lane markings (arrows) at individual intersections serve as interfaces to connect upstream and downstream intersections in signal-controlled networks. Demand flows from origins to destinations may need to pass through a series of intersections. If lane markings are not well established to ban turns at intersections, then paths connecting origin and destination (OD) pairs could be inefficient. Due to indirect connections, road users need to take longer paths to reach their destinations. Conventionally, network configurations are fixed inputs for network analysis. In the present study, concepts of the lane-based designs for individual signalized intersections are extended for signal-controlled network designs. Taking OD demand flows as inputs, the proposed algorithm will optimize all lane markings and assigned lane flows on approach lanes. Paths (flows) will then be optimized by linking up the optimized lane markings across upstream and downstream intersections. Traffic signal settings at individual intersections will be optimized simultaneously by maximizing the reserve capacity for the entire OD demand flow matrix. The problem is formulated as a Binary-Mixed-Integer-Linear-Program (BMILP) and a standard branch-and-bound routine is applied to solve for global optimum solutions. A numerical example using a 4-intersection network will be given to demonstrate the effectiveness of the proposed design methodology.
UR - http://www.scopus.com/inward/record.url?scp=85027234195&partnerID=8YFLogxK
UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-85027234195&origin=recordpage
U2 - 10.1155/2017/1257569
DO - 10.1155/2017/1257569
M3 - 21_Publication in refereed journal
VL - 2017
JO - Discrete Dynamics in Nature and Society
JF - Discrete Dynamics in Nature and Society
SN - 1026-0226
M1 - 1257569
ER -