A modified gradient projection algorithm for solving the elastic demand traffic assignment problem

被引：28

作者：

Ryu, Seungkyu ^{[1
]}

Chen, Anthony ^{[1
]}

Choi, Keechoo ^{[2
]}

机构：

[1] Utah State Univ, Dept Civil & Environm Engn, Logan, UT 84322 USA

[2] Ajou Univ, Dept Transportat Engn, Suwon 442749, South Korea

来源：

COMPUTERS & OPERATIONS RESEARCH | 2014年 / 47卷

基金：

新加坡国家研究基金会;

关键词：

Elastic demand; User equilibrium; Gradient projection; Traffic assignment; Path-based algorithm; USER EQUILIBRIUM PROBLEM; NETWORK;

D O I：

10.1016/j.cor.2014.01.012

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

This paper develops a path-based traffic assignment algorithm for solving the elastic demand traffic assignment problem (EDTAP). A modified path-based gradient projection (GP) method combined with a column generation is suggested for solving the equivalent excess-demand reformulation of the problem in which the elastic demand problem is reformulated as a fixed demand problem through an appropriate modification of network representation. Numerical results using a set of real transportation networks are provided to demonstrate the efficiency of the modified GP algorithm for solving the excess-demand formulation of the EDTAP. In addition, a sensitivity analysis is conducted to examine the effects of the scaling parameter used in the elastic demand function on the estimated total demand, number of generated paths, number of used paths, and computational efforts of the modified GP algorithm. Published by Elsevier Ltd.

引用

页码：61 / 71

页数：11

共 32 条

[1]

Aashtiani H. Z., 1979, THESIS MIT CAMBRIDGE

[2]

[Anonymous], 1996, TRANSPORTATION RES R

[3] An efficient method to compute traffic assignment problems with elastic demands [J].