A circuit simulation technique for congested network traffic assignment problem

檔案

本條目沒有附加檔案。

日期

2007

期刊名稱

COMPUTATION IN MODERN SCIENCE AND ENGINEERING VOL 2, PTS A AND B

卷期與頁次

第 2 卷,頁 993–996

ISSN

0094-243X

ISBN

978-0-7354-0476-2

語言

英文

摘要

The relation between electrical circuit and traffic network has been proposed by Sasaki and Inouye, but they proposed link cost function is a linear function which cannot present the congestion situation. Cho and Huang extended the link cost function to a nonlinear function which can explain the congested network. In this paper, we proposed a foremost and novel approach to solve the traffic assignment problem (TAP) by simulating the electrical circuit network which consists of nonlinear link cost function models. Comparing with the solutions of Frank-Wolfe algorithm, the simulation results are nearly identical. Thus, the simulation of a network circuit model can be applied to solve network traffic assignment problems. Finally, two examples are proposed, and the results confirmed that electrical circuit simulation is workable in solving congested network traffic assignment problems.

所屬典藏

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

引用此條目

Cho, H.-J., & Huang, H. (2007). A circuit simulation technique for congested network traffic assignment problem. COMPUTATION IN MODERN SCIENCE AND ENGINEERING VOL 2, PTS A AND B, 2, 993–996. https://ir.lib.nycu.edu.tw/handle/11536/8701

BibTeX RIS

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

分享

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