ID | 15713 |
JaLCDOI | |
Sort Key | 7
|
フルテキストURL | |
著者 |
Inouye Hiroshi
Department of Civil Engineering
|
抄録 | In this paper some computational methods of traffic assignment are proposed. At first solutions of traffic assignment by the equal travel times principle used nonlinear programmings are showed. They are a method to approximate by a quadratic programming, a method to use the SUMT transformation, a method to apply Rosen's gradient projection method and a method to apply the conjugate gradient projection method. Through a computational example the efficiency of them are compared.
To decide route flows uniquely in traffic assignment by the equal travel times principle, a method requesting route flows such that the joint probability is a maximum under supposed a priori probabilities is proposed. In case of a traffic assignment in a large scale road network, it is significant to improve the efficiency of route searches. For this purpose a technique of minimum time route search by division of a network is proposed.
|
出版物タイトル |
Memoirs of the School of Engineering, Okayama University
|
発行日 | 1977-01-25
|
巻 | 11巻
|
号 | 2号
|
出版者 | 岡山大学工学部
|
出版者(別表記) | School of Engineering, Okayama University
|
開始ページ | 51
|
終了ページ | 71
|
ISSN | 0475-0071
|
NCID | AA00733903
|
資料タイプ |
紀要論文
|
OAI-PMH Set |
岡山大学
|
言語 |
英語
|
論文のバージョン | publisher
|
NAID | |
Eprints Journal Name | mfe
|