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

• NAGAE Takeshi

  東北大学 工学研究科

• AKAMATSU Takashi

  東北大学 情報科学研究科

• SHIMIZU Ren

  SCSK株式会社

• FU Haoran

  東北大学情報科学研究科

Bibliographic Information

Other Title

• 経路・出発時刻同時選択型の動的利用者均衡配分の求解法：二次計画問題アプローチ

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.

Journal

• Journal of Japan Society of Civil Engineers, Ser. D3 (Infrastructure Planning and Management)

  Journal of Japan Society of Civil Engineers, Ser. D3 (Infrastructure Planning and Management) 76 (3), 264-281, 2020

  Japan Society of Civil Engineers

Keywords

• dynamic user equilibrium
• simultaneous departure time and route choice model
• mixed linear complementarity problem
• quadratic programming
• Frank-Wolfe algorithm

Details

• CRID: 1390567172574268288
• NII Article ID: 130007906255
• DOI: 10.2208/jscejipm.76.3_264
• ISSN: 21856540
• Web Site: https://www.jstage.jst.go.jp/article/jscejipm/76/3/76_264/_pdf
• Text Lang: ja
• Data Source:
  • JaLC
  • Crossref
  • CiNii Articles
  • KAKEN
• Abstract License Flag: Disallowed