WEKO3
アイテム
Optimal Transportation Network with Discrete Entry Points in a Monocentric City
https://iuj.repo.nii.ac.jp/records/358
https://iuj.repo.nii.ac.jp/records/3587aa9e885-7db4-4777-80ff-c24a6035bd15
名前 / ファイル | ライセンス | アクション |
---|---|---|
![]() |
|
Item type | 紀要論文 / Departmental Bulletin Paper(1) | |||||
---|---|---|---|---|---|---|
公開日 | 2002-01-01 | |||||
タイトル | ||||||
タイトル | Optimal Transportation Network with Discrete Entry Points in a Monocentric City | |||||
タイトル | ||||||
タイトル | Optimal Transportation Network with Discrete Entry Points in a Monocentric City | |||||
言語 | en | |||||
言語 | ||||||
言語 | jpn | |||||
資源タイプ | ||||||
資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||
資源タイプ | departmental bulletin paper | |||||
著者 |
吉田, 雄一朗
× 吉田, 雄一朗× Yoshida, Yuichiro |
|||||
抄録 | ||||||
内容記述タイプ | Abstract | |||||
内容記述 | The purpose of this paper is to find an optimal commuting network in a two-dimensional city. In their commuting to the business district, households choose between two modes of travel: road and rail. Road is slow but densely provided. Rail is fast, however, unlike the previous literature, it is only accessible from discrete points, namely, stations. This generates a new question: where to locate stations optimally. This paper provides a general algorithm to solve for optimal network of a city as well as solutions under specific assumptions on the household's utility function and city shape. The paper then analyzes comparative statics of a population change. | |||||
書誌情報 |
en : Economics & Management Series 発行日 2002-01-01 |