Optimal Transportation Network with Discrete Entry Points in a Monocentric City
スポンサーリンク
概要
- 論文の詳細を見る
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 the 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.
- 国際大学の論文
著者
-
Yoshida Yuichiro
Assistant Professor International Development Program Graduate School Of International Relations Int
-
Yoshida Yuichiro
Assistant Professor International Development Program Graduate School Of International Relations Int
関連論文
- Optimal Transportation Network with Discrete Entry Points in a Monocentric City
- A Square Relationship between Relative Income and Price Levels among Countries
- Commuter Arrivals and Optimal Service in Rail Transit : Does Queuing Behavior at Train Stops Matter?
- Airport-Efficiency Measurement : Methodologies, Data Requirements, and Monte-Carlo Experiments