arrow
返回

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

delete2014-07-01
delete32
PRE
AI
S
Seungkyu Ryu
A
Anthony Chen *
K
Keechoo Choi
DOI:10.1016/j.cor.2014.01.012delete
delete原文链接
delete分享
delete收藏
摘要

摘要

En 中文
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.
Keyword:
Elastic demand
User equilibrium
Gradient projection
Traffic assignment
Path-based algorithm
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

C
Computers and Operations Research
IF:
4.3
论文数:
6.5K
被引数:
2.1W

机构

U
utah state university
学者数:
271
论文数: 138
被引数: 866
U
Utah System of Higher Education
学者数:
4.6W
论文数: 4.0W
被引数: 3.2W
引用论文

引用论文

Cyclic ADP-Ribose Measurements in Rat Pancreatic Islets
err1997-02-01
err0
PREAI
errW.J. Malaisse; Y. Kanda; K. Inageda; O. Scruel; A. Sener; T. Katada
err分享
err收藏
Paramagnetic surface defects in LiMgPO4
err2019-01-25
err0
PREAI
errM O Kalinkin; R M Abashev; E V Zabolotskaya; I V Baklanova; A I Surdo; D G Kellerman
err分享
err收藏
err分享
err收藏
学者 查看更多内容