Optimal Transportation Network with Discrete Entry Points in a Monocentric City

Yuichiro Yoshida

No EMS_2002_03, Working Papers from Research Institute, International University of Japan

Abstract: Then 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.

Pages: 25 pages
Date: 2002-01
References: Add references at CitEc
Citations:

Downloads: (external link)
https://www.iuj.ac.jp/workingpapers/index.cfm?File=EMS_2002_03.pdf First version, 2002 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:iuj:wpaper:ems_2002_03

Access Statistics for this paper

More papers in Working Papers from Research Institute, International University of Japan 777 Kokusai-cho, Minami Uonuma0-shi, Niigata 949-7277 JAPAN. Contact information at EDIRC.
Bibliographic data for series maintained by Kazumi Imai, Office of Academic Affairs ().