NEW SOLUTION ALGORITHMS FOR ASYMMETRIC TRAFFIC ASSIGNMENT MODEL

NCUIR > Engineering College > Graduate Institute of Civil Engineering > journal & Dissertation > Item 987654321/26336

Please use this identifier to cite or link to this item: http://ir.lib.ncu.edu.tw/handle/987654321/26336

Title:	NEW SOLUTION ALGORITHMS FOR ASYMMETRIC TRAFFIC ASSIGNMENT MODEL
Authors:	CHEN,HK;WANG,CY;BOYCE,DE
Contributors:	土木工程研究所
Keywords:	VARIATIONAL-INEQUALITIES;COMPLEMENTARITY-PROBLEMS;EQUILIBRIUM PROBLEMS;NETWORK-EQUILIBRIUM;STABILITY
Date:	1995
Issue Date:	2010-06-29 17:11:05 (UTC+8)
Publisher:	中央大學
Abstract:	The asymmetric traffic assignment model can improve the traditional traffic assignment model by adopting detailed network representation and more realistic asymmetric cost functions. The diagonalization, streamlined diagonalization, and projection methods are three widely mentioned solution algorithms for solving asymmetric traffic assignment models. The diagonalization and streamlined diagonalization methods have the advantage of requiring less computer memory but typically require greater computational time. The projection method has the advantage of converging more rapidly but requires a large computer memory. In order to balance computer memory and computational time, we propose two new algorithms; i.e., hybrid and streamlined hybrid methods. According to our case study, the proposed algorithms show their superiority over the diagonalization and streamlined diagonalization methods in terms of computational time, and over the projection method in terms of computer memory Both new algorithms can handle small or medium networks sized asymmetric traffic assignment problems on personal computers.
Relation:	JOURNAL OF THE CHINESE INSTITUTE OF ENGINEERS
Appears in Collections:	[Graduate Institute of Civil Engineering] journal & Dissertation

Files in This Item:

File	Description	Size	Format
index.html		0Kb	HTML	488	View/Open

社群 sharing

Loading...