4.4 Article

Efficient Algorithm for the Traffic Assignment Problem with Side Constraints

期刊

TRANSPORTATION RESEARCH RECORD
卷 2674, 期 4, 页码 129-139

出版社

SAGE PUBLICATIONS INC
DOI: 10.1177/0361198120912234

关键词

-

资金

  1. Chinese National Nature Science Foundation [71971178]
  2. Fundamental Research Funds for the Central Universities
  3. GAIA Collaborative Research Funds for Young Scholars

向作者/读者索取更多资源

The standard traffic assignment problem (TAP) is often augmented with additional constraints to address non-standard applications. These models are called TAP with side constraints (TAPSC). Despite the rising significance of TAPSC models, the ability to efficiently solve them to satisfactory precision remains limited in real-world applications. The purpose of this paper is to fill this gap by integrating a recently developed high performance TAP solver, known as the path-based Greedy algorithm, with the augmented Lagrangian multiplier (ALM) method. This paper examines how precisely the subproblems in the ALM method should be solved to optimize the overall convergence performance. It is found that insufficiently converged subproblem solutions sometimes lead to catastrophic failures, although pursuing extremely high precision could also be counterproductive. Accordingly, it is proposed to adjust the precision required to solve the subproblems based on an approximate gap measured by the augmented Lagrangian. Results of numerical experiments show that adaptively adjusting the subproblem precision limit produces a 25% speed-up compared with the algorithm with a fixed limit.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.4
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据