Transportation Network Design considering Morning and Evening Peak-Hour Demands

Abstract EN

Previous studies of transportation network design problem (NDP) always consider one peak-hour origin-destination (O-D) demand distribution.

However, the NDP based on one peak-hour O-D demand matrix might be unable to model the real traffic patterns due to diverse traffic characteristics in the morning and evening peaks and impacts of network structure and link sensitivity.

This paper proposes an NDP model simultaneously considering both morning and evening peak-hour demands.

The NDP problem is formulated as a bilevel programming model, where the upper level is to minimize the weighted sum of total travel time for network users travelling in both morning and evening commute peaks, and the lower level is to characterize user equilibrium choice behaviors of the travelers in two peaks.

The proposed NDP model is transformed into an equivalent mixed integer linear programming (MILP), which can be efficiently solved by optimization solvers.

Numerical examples are finally performed to demonstrate the effectiveness of the developed model.

It is shown that the proposed NDP model has more promising design effect of improving network efficiency than the traditional NDP model considering one peak-hour demand and avoids the misleading selection of improved links.