An improved efficiency of the Frank-Wolfe algorithm for network traffic assignment

檔案

本條目沒有附加檔案。

日期

2006

期刊名稱

RECENT PROGRESS IN COMPUTATIONAL SCIENCES AND ENGINEERING, VOLS 7A AND 7B

卷期與頁次

第 7A-B 卷,頁 822–825

ISSN

1573-4196

ISBN

978-90-04-15542-8

語言

英文

摘要

Frank-Wolfe (denoted as F-W) algorithm has already been pointed out that the wrong traffic assignment will occur when parsing the statc of user equilibrium (denoted as UE). Besides, to obviate the non-UE paths by path data structure has been demonstrated to accelerate the rate of convergent speed. Therefore, how to decide a suitable threshold to shift. the flow from the Don-UE path to the other paths of the same origin-destination (denoted as OD) pair becomes a very important issue to enhance the rate of convergence. In this paper, an adequate threshold is proposed.

所屬典藏

會議論文
顯示完整詮釋資料 統計資料

引用此條目

Cho, H.-J., & Chen, Y.-K. (2006). An improved efficiency of the Frank-Wolfe algorithm for network traffic assignment. RECENT PROGRESS IN COMPUTATIONAL SCIENCES AND ENGINEERING, VOLS 7A AND 7B, 7A-B, 822–825. https://ir.lib.nycu.edu.tw/handle/11536/17397

BibTeX RIS

引用文字依 APA 第 7 版格式自動產生,使用前請再核對。

分享

永久網址:https://ir.lib.nycu.edu.tw/handle/11536/17397