{"created":"2023-05-25T05:23:09.779007+00:00","id":574,"links":{},"metadata":{"_buckets":{"deposit":"e1124ff6-c3a1-43fa-a5ce-fa6d1f900f58"},"_deposit":{"created_by":3,"id":"574","owners":[3],"pid":{"revision_id":0,"type":"depid","value":"574"},"status":"published"},"_oai":{"id":"oai:yamagata.repo.nii.ac.jp:00000574","sets":["34:36"]},"author_link":["2453","2454"],"item_3_alternative_title_18":{"attribute_name":"その他の言語のタイトル","attribute_value_mlt":[{"subitem_alternative_title":"Traffic Assugnment in the Highway Networks"}]},"item_3_alternative_title_19":{"attribute_name":"タイトル（ヨミ）","attribute_value_mlt":[{"subitem_alternative_title":"ドウロモウ ニオケル コウツウリュウ ハイブン"}]},"item_3_biblio_info_6":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"1972-01-20","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"1","bibliographicPageEnd":"145","bibliographicPageStart":"129","bibliographicVolumeNumber":"12","bibliographic_titles":[{"bibliographic_title":"山形大学紀要.工学"}]}]},"item_3_description_42":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"subitem_description":"論文(Article)","subitem_description_type":"Other"}]},"item_3_description_5":{"attribute_name":"内容記述","attribute_value_mlt":[{"subitem_description":"When a traffic assignment minimizes total travel time, O-D flows are assigned optimum in the networks. It is reported how to minimize total travel timie. The highway netwerks are represented by a directed graph, G(V, E, T), where V, E and T represent sets of nodes, branches and functions of travel time of the branches respectively. The travel time of a branch e_k is a function 0f the traffiC Volume, so it is given by T_k (α_k). The capacity of e_k is C(e_k). If we assume W_k(α_k) as follows ;　W_k(α_k) = d (T_k(α_k).α_k)/dα_k,　then dW_k(α_k)/dα_k is obtained to be positive in 0　If V = {v_i}, E = {e_k}, then e_k = (v_i, v_j) is a directed branch from v_t to v_j, where v_i represents initial node and v_j terminal node respectively. G_i is a subgraph of G. If there is no directed cycle and only one node which is not a terminal node for all branches in the subgraph, then G_t is defined a unididirectional graph. The author studies the elegant solution to minimize total travel time in G_t when a unidirectional graph is selected suitably. When someunidirectional graphs are obtained from the set of chains which have shorter travel time, the traffic assignments are computed for some of G_i, and the optimum assignment is selected so a traftic assignment that have minimum total travel time among them.","subitem_description_type":"Other"}]},"item_3_full_name_3":{"attribute_name":"著者別名","attribute_value_mlt":[{"nameIdentifiers":[{"nameIdentifier":"2454","nameIdentifierScheme":"WEKO"}],"names":[{"name":"Saishu,  Kazuo"}]}]},"item_3_publisher_32":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"山形大学"}]},"item_3_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN00242991","subitem_source_identifier_type":"NCID"}]},"item_3_text_33":{"attribute_name":"出版者（ヨミ）","attribute_value_mlt":[{"subitem_text_value":"ヤマガタ ダイガク"}]},"item_3_text_34":{"attribute_name":"別言語の出版者","attribute_value_mlt":[{"subitem_text_value":"Yamagata University"}]},"item_3_text_43":{"attribute_name":"資源タイプ・ローカル","attribute_value_mlt":[{"subitem_text_value":"紀要論文"}]},"item_3_text_44":{"attribute_name":"資源タイプ・NII","attribute_value_mlt":[{"subitem_text_value":"Departmental Bulletin Paper"}]},"item_3_text_45":{"attribute_name":"資源タイプ・DCMI","attribute_value_mlt":[{"subitem_text_value":"text"}]},"item_3_text_46":{"attribute_name":"資源タイプ・ローカル表示コード","attribute_value_mlt":[{"subitem_text_value":"2"}]},"item_creator":{"attribute_name":"著者","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"最首,  和雄"}],"nameIdentifiers":[{}]}]},"item_files":{"attribute_name":"ファイル情報","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_date","date":[{"dateType":"Available","dateValue":"2015-08-21"}],"displaytype":"detail","filename":"kiyoue-12-1-11-1_merged.pdf","filesize":[{"value":"689.5 kB"}],"format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","url":{"label":"kiyoue-12-1-11-1_merged.pdf","url":"https://yamagata.repo.nii.ac.jp/record/574/files/kiyoue-12-1-11-1_merged.pdf"},"version_id":"3186b684-644e-45db-941c-f171baefc5a3"}]},"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":"道路網における交通流配分","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"道路網における交通流配分"}]},"item_type_id":"3","owner":"3","path":["36"],"pubdate":{"attribute_name":"公開日","attribute_value":"2007-09-06"},"publish_date":"2007-09-06","publish_status":"0","recid":"574","relation_version_is_last":true,"title":["道路網における交通流配分"],"weko_creator_id":"3","weko_shared_id":-1},"updated":"2023-05-25T07:15:42.569926+00:00"}