An improved efficiency of the Frank-Wolfe algorithm for network traffic assignment
| dc.citation.epage | 825 | en_US |
| dc.citation.spage | 822 | en_US |
| dc.citation.volume | 7A-B | en_US |
| dc.contributor.author | Cho, Hsun-Jung | en_US |
| dc.contributor.author | Chen, Yu-Kuang | en_US |
| dc.contributor.department | 運輸與物流管理系 註：原交通所+運管所 | zh_TW |
| dc.contributor.department | Department of Transportation and Logistics Management | en_US |
| dc.date.accessioned | 2014-12-08T15:25:01Z | |
| dc.date.available | 2014-12-08T15:25:01Z | |
| dc.date.issued | 2006 | en_US |
| dc.description.abstract | 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. | en_US |
| dc.identifier.isbn | 978-90-04-15542-8 | en_US |
| dc.identifier.issn | 1573-4196 | en_US |
| dc.identifier.journal | RECENT PROGRESS IN COMPUTATIONAL SCIENCES AND ENGINEERING, VOLS 7A AND 7B | en_US |
| dc.identifier.uri | https://ir.lib.nycu.edu.tw/handle/11536/17397 | |
| dc.identifier.wosnumber | WOS:000254378800188 | |
| dc.language.iso | en_US | en_US |
| dc.subject | Frank-Wolfe algorithm | en_US |
| dc.subject | traffic assignment | en_US |
| dc.subject | user equilibrium | en_US |
| dc.title | An improved efficiency of the Frank-Wolfe algorithm for network traffic assignment | en_US |
| dc.type | Proceedings Paper | en_US |
Files
License bundle
1 - 1 of 1
Loading...
- Name:
- license.txt
- Size:
- 1.71 KB
- Format:
- Item-specific license agreed to upon submission
- Description: