このアイテムのアクセス数: 31
このアイテムのファイル:
ファイル | 記述 | サイズ | フォーマット | |
---|---|---|---|---|
mfeku_32_2_223.pdf | 648.38 kB | Adobe PDF | 見る/開く |
完全メタデータレコード
DCフィールド | 値 | 言語 |
---|---|---|
dc.contributor.author | IIDA, Yasunori | en |
dc.date.accessioned | 2023-03-28T09:06:29Z | - |
dc.date.available | 2023-03-28T09:06:29Z | - |
dc.date.issued | 1970-09-10 | - |
dc.identifier.uri | http://hdl.handle.net/2433/280819 | - |
dc.description.abstract | In this paper, first, the author will comment on the principles of traffic assignment used generally so far, that is, the principle of minimizing total travel times, of equal travel times, and of travel times ratio. Secondarily, new assignment methods will be proposed respectively according to those principles, on the assumption that the travel times along any road section depends linearly upon the traffic volume at that section. But in this second point, the discussion is confined to computational procedure of those system solutions. | en |
dc.language.iso | eng | - |
dc.publisher | Faculty of Engineering, Kyoto University | en |
dc.publisher.alternative | 京都大学工学部 | ja |
dc.subject.ndc | 500 | - |
dc.title | Traffic Assignments in Road Network with Flow Dependent Travel Times | en |
dc.type | departmental bulletin paper | - |
dc.type.niitype | Departmental Bulletin Paper | - |
dc.identifier.ncid | AA00732503 | - |
dc.identifier.jtitle | Memoirs of the Faculty of Engineering, Kyoto University | en |
dc.identifier.volume | 32 | - |
dc.identifier.issue | 2 | - |
dc.identifier.spage | 223 | - |
dc.identifier.epage | 235 | - |
dc.textversion | publisher | - |
dc.sortkey | 08 | - |
dc.address | Department of Transportation Engineering | en |
dcterms.accessRights | open access | - |
dc.identifier.pissn | 0023-6063 | - |
出現コレクション: | Vol.32 Part 2 |

このリポジトリに保管されているアイテムはすべて著作権により保護されています。