Time-varying lane-based capacity reversibility for traffic management

Ampol Karoonsoontawong, Dung Ying Lin

研究成果: Article同行評審

36 引文 斯高帕斯(Scopus)

摘要

This article presents a new bi-level formulation for time-varying lane-based capacity reversibility problem for traffic management. The problem is formulated as a bi-level program where the lower level is the cell-transmission-based user-optimal dynamic traffic assignment (UODTA). Due to its Non-deterministic Polynomial-time hard (NP-hard) complexity, the genetic algorithm (GA) with the simulation-based UODTA is adopted to solve multiorigin multidestination problems. Four GA variations are proposed. GA1 is a simple GA. GA2, GA3, and GA4 with a jam-density factor parameter (JDF) employ time-dependent congestion measures in their decoding procedures. The four algorithms are empirically tested on a grid network and compared based on solution quality, convergence speed, and central processing unit (CPU) time. GA3 with JDF of 0.6 appears best on the three criteria. On the Sioux Falls network, GA3 with JDF of 0.7 performs best. The GA with the appropriate inclusion of problem-specific knowledge and parameter calibration indeed provides excellent results when compared with the simple GA.

原文English
頁(從 - 到)632-646
頁數15
期刊Computer-Aided Civil and Infrastructure Engineering
26
發行號8
DOIs
出版狀態Published - 2011 十一月 1

All Science Journal Classification (ASJC) codes

  • 土木與結構工程
  • 電腦科學應用
  • 電腦繪圖與電腦輔助設計
  • 計算機理論與數學

指紋

深入研究「Time-varying lane-based capacity reversibility for traffic management」主題。共同形成了獨特的指紋。

引用此