{"created":"2023-06-23T12:12:21.557496+00:00","id":358,"links":{},"metadata":{"_buckets":{"deposit":"c5c24450-b1d3-4628-a0da-c9ef7f859cd3"},"_deposit":{"created_by":14,"id":"358","owners":[14],"pid":{"revision_id":0,"type":"depid","value":"358"},"status":"published"},"_oai":{"id":"oai:iuj.repo.nii.ac.jp:00000358","sets":["1"]},"author_link":["562","563"],"item_10002_biblio_info_7":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"2002-01-01","bibliographicIssueDateType":"Issued"},"bibliographic_titles":[{},{"bibliographic_title":"Economics & Management Series","bibliographic_titleLang":"en"}]}]},"item_10002_description_5":{"attribute_name":"抄録","attribute_value_mlt":[{"subitem_description":"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.","subitem_description_type":"Abstract"}]},"item_creator":{"attribute_name":"著者","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"吉田, 雄一朗"}],"nameIdentifiers":[{"nameIdentifier":"562","nameIdentifierScheme":"WEKO"}]},{"creatorNames":[{"creatorName":"Yoshida, Yuichiro","creatorNameLang":"en"}],"nameIdentifiers":[{"nameIdentifier":"563","nameIdentifierScheme":"WEKO"}]}]},"item_files":{"attribute_name":"ファイル情報","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_date","date":[{"dateType":"Available","dateValue":"2017-02-15"}],"displaytype":"detail","filename":"EMS_2002_03.pdf","filesize":[{"value":"1.2 MB"}],"format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","url":{"label":"EMS_2002_03","url":"https://iuj.repo.nii.ac.jp/record/358/files/EMS_2002_03.pdf"},"version_id":"ec07b8ab-4e75-4c76-b57c-166d5992e9d0"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourcetype":"departmental bulletin paper","resourceuri":"http://purl.org/coar/resource_type/c_6501"}]},"item_title":"Optimal Transportation Network with Discrete Entry Points in a Monocentric City","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Optimal Transportation Network with Discrete Entry Points in a Monocentric City"},{"subitem_title":"Optimal Transportation Network with Discrete Entry Points in a Monocentric City","subitem_title_language":"en"}]},"item_type_id":"10002","owner":"14","path":["1"],"pubdate":{"attribute_name":"公開日","attribute_value":"2002-01-01"},"publish_date":"2002-01-01","publish_status":"0","recid":"358","relation_version_is_last":true,"title":["Optimal Transportation Network with Discrete Entry Points in a Monocentric City"],"weko_creator_id":"14","weko_shared_id":-1},"updated":"2023-06-23T12:32:41.743962+00:00"}