ID | 15713 |
JaLCDOI | |
Sort Key | 7
|
FullText URL | |
Author |
Inouye Hiroshi
|
Abstract | 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.
|
Publication Title |
Memoirs of the School of Engineering, Okayama University
|
Published Date | 1977-01-25
|
Volume | volume11
|
Issue | issue2
|
Publisher | 岡山大学工学部
|
Publisher Alternative | School of Engineering, Okayama University
|
Start Page | 51
|
End Page | 71
|
ISSN | 0475-0071
|
NCID | AA00733903
|
Content Type |
Departmental Bulletin Paper
|
OAI-PMH Set |
岡山大学
|
language |
English
|
File Version | publisher
|
NAID | |
Eprints Journal Name | mfe
|