A QUADRATIC PROGRAMMING APPROACH FOR SOLVING A DYNAMIC USER EQUILIBRIUM WITH SIMULTANEOUS DEPARTURE TIME AND ROUTE CHOICE

Abstract

 In this article, we develop a novel numerical method for solving dynamic user equilibrium traffic assignment model with simultaneous departure time and route choice (DUE-SDR) model. We first formulate the DUE-SDR model on either a one-to-many or a many-to-one network with a point-queue model as a mixed linear complementarity problem (MLCP). Our analyses reveals that the MLCP reduced to a quadratic programming (QP), which enables us to obtain the DUE-SDR assignment by solving the equivalent QP by using the conventional Frank-Wolfe algorithm. Several numerical examples exhibit that the proposed method solves the DUE-SDR model with about 20,000 unknown variables in a practical time.