01698259

Component

The column generation (CG) algorithm has been widely applied to traffic assignment problems due to its capability of circumventing path enumeration. Incorporating bounded rationality (BR) and dynamics, this paper proposes four tolerance-based strategies for extending the CG algorithm to the bounded rational dynamic user equilibrium model (BR-DUE): (i) a tolerance-based minimum disutility path search strategy is developed to allow travelers seeking satisfactory paths; (ii) a self-adjusted convergence threshold strategy is applied for fast convergence at the intermediate iterations; (iii) a varied temporal resolution scheme, combining exploration and exploitation, is suggested to assign flows to narrow time regions rather than to the whole time horizon; and (iv) a path search skipping strategy is introduced by comparing the lower bound of travel disutility and the minimum disutility of used time-dependent paths. With these strategies, an efficient tolerance-based column generation (TBCG) algorithm for BR-DUE is developed. Numerical examples are provided to illustrate the efficiency of the TBCG algorithm, of which the speedup factor is around two compared with using the orginal CG algorithm.

This paper was sponsored by TRB committee ADB30 Standing Committee on Transportation Network Modeling Alternate title: Tolerance-based Strategies for Extending the Column Generation Algorithm to the Bounded Rational Dynamic User Equilibrium Problem.

19-04357

English

6p

2019

Transportation Research Board 98th Annual Meeting

Digital/other

Figures; References; Tables

Algorithms; Traffic assignment

Bounded rationality framework; Column generation; Dynamic user equilibrium

Highways; Planning and Forecasting

Transportation Research Board Annual Meeting 2019 Paper #19-04357

TRIS, TRB, ATRI

Dec 7 2018 9:50AM