{"created":"2023-07-27T07:46:55.421332+00:00","id":21412,"links":{},"metadata":{"_buckets":{"deposit":"8a8ad911-df70-45e7-bfb8-38ca06d01da0"},"_deposit":{"created_by":20,"id":"21412","owners":[20],"pid":{"revision_id":0,"type":"depid","value":"21412"},"status":"published"},"_oai":{"id":"oai:doshisha.repo.nii.ac.jp:00021412","sets":["4251:8393:8394:8395:8410","8:3372:3812:3827"]},"author_link":["17743","15621","17744"],"item_1693811493084":{"attribute_name":"出版タイプ","attribute_value_mlt":[{"subitem_version_resource":"http://purl.org/coar/version/c_970fb48d4fbd8a85","subitem_version_type":"VoR"}]},"item_1694490770713":{"attribute_name":"権利者情報","attribute_value_mlt":[{"nameIdentifiers":[{"nameIdentifier":"DA03974933","nameIdentifierScheme":"AID"}],"rightHolderNames":[{"rightHolderLanguage":"ja","rightHolderName":"同志社大学理工学研究所"},{"rightHolderLanguage":"en","rightHolderName":"Science and Engineering Research Institute of Doshisha University"}]}]},"item_1_alternative_title_2":{"attribute_name":"その他（別言語等）のタイトル","attribute_value_mlt":[{"subitem_alternative_title":"最短経路問題を用いたネットワークシンプレックス法のMATLABへの実装","subitem_alternative_title_language":"ja"},{"subitem_alternative_title":"サイタン ケイロ モンダイ オ モチイタ ネットワーク シンプレックスホウ ノ マトラブ エノ ジッソウ","subitem_alternative_title_language":"ja-Kana"}]},"item_1_biblio_info_14":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"2011-07-31","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"2","bibliographicPageEnd":"106","bibliographicPageStart":"99","bibliographicVolumeNumber":"52","bibliographic_titles":[{"bibliographic_title":"同志社大学理工学研究報告","bibliographic_titleLang":"ja"},{"bibliographic_title":"The Science and Engineering Review of Doshisha University","bibliographic_titleLang":"en"}]}]},"item_1_description_12":{"attribute_name":"抄録","attribute_value_mlt":[{"subitem_description":"本論文の主題は,最少費用粒問題の解法アルゴリズムであるネットワークシンプレックス法をMATLABへ実装することである.最小費用流問題とは,与えられた需要条件と容量条件の下で,コストが最少であるフローをみつける問題である.この問題は実社会の問題に広く応用がある問題であるにも関わらず,知られている解法アルゴリズムは少ない.ネットワークシンプレックス法はもっとも効率的なものであるが,多くの部分アルゴリズムから構成されており,きわめて複雑なアルゴリズムである.従って,実装は容易ではなく,部分アルゴリズムの組み合わせにおいて多様性がある.本論文においては,最短経路問題の解法アルゴリズムであるダイクストラ法やフロイド・ワーシャル法を部分アルゴリズムとして効率的に用いたネットワークシンプレックス法の実装を提案する.本実装は,非常に効率的であるとは言い難いが,グラフ理論における様々なアルゴリズムに対する知識を少ししか必要としない理解しやすい実装となっている.","subitem_description_language":"ja","subitem_description_type":"Abstract"},{"subitem_description":"The main theme of the present paper is an implementation of the Network Simplex Algorithm for solving the minimum cost flow problem to MATLAB. The minimum cost flow problem is the problem for finding the minimum cost flow which satisfies the given capacity conditions and the demand and supply conditions. Although it is known to have a wide application to real fields, there have been known a few algorithms for solving the minimum cost flow problem. The Network Simplex Algorithm is known as the most efficient one, but it is a very complicated algorithm consisting of lots of sub-algorithms. So the implementation of the algorithm is not easy and it has varieties of combinations of sub-algorithms. In the present paper, we provide an implementation of the Network Simplex Algorithm using algorithms for the shortest path problems such as the Dijkstra algorithm or the Floyd-Warshall algorithm efficiently as sub-algorithms. We cannot say that the present implementation is quite efficient but it is easy to understand and requires a little knowledge about algorithms on graph theory.","subitem_description_language":"en","subitem_description_type":"Abstract"}]},"item_1_description_25":{"attribute_name":"フォーマット","attribute_value_mlt":[{"subitem_description":"application/pdf","subitem_description_type":"Other"}]},"item_1_identifier_registration":{"attribute_name":"ID登録","attribute_value_mlt":[{"subitem_identifier_reg_text":"10.14988/pa.2017.0000012465","subitem_identifier_reg_type":"JaLC"}]},"item_1_publisher_15":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"同志社大学理工学研究所","subitem_publisher_language":"ja"}]},"item_1_publisher_16":{"attribute_name":"出版者（英）","attribute_value_mlt":[{"subitem_publisher":"Science and Engineering Research Institute of Doshisha University","subitem_publisher_language":"en"}]},"item_1_relation_24":{"attribute_name":"関連サイト","attribute_value_mlt":[{"subitem_relation_name":[{"subitem_relation_name_language":"ja","subitem_relation_name_text":"掲載刊行物所蔵情報へのリンク ／ Link to Contents"}],"subitem_relation_type":"isFormatOf","subitem_relation_type_id":{"subitem_relation_type_id_text":"https://doors.doshisha.ac.jp/opac/opac_link/bibid/SB00960326/?lang=0","subitem_relation_type_select":"URI"}}]},"item_1_source_id_17":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"00368172","subitem_source_identifier_type":"PISSN"}]},"item_1_source_id_19":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN00165868","subitem_source_identifier_type":"NCID"}]},"item_1_subject_27":{"attribute_name":"日本十進分類法","attribute_value_mlt":[{"subitem_subject":"417","subitem_subject_scheme":"NDC"}]},"item_1_text_8":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_language":"ja","subitem_text_value":"青山, 直路 / Graduate School of Life and Medical Sciences, Doshisha University"},{"subitem_text_language":"ja","subitem_text_value":"渡邊, 芳英 / 同志社大学理工学部数理システム学科教授"},{"subitem_text_language":"ja","subitem_text_value":"伊藤, 利明 / 同志社大学生命医科学部医工学科教授"}]},"item_1_text_9":{"attribute_name":"著者所属（英）","attribute_value_mlt":[{"subitem_text_language":"en","subitem_text_value":"Dosihsha University"}]},"item_access_right":{"attribute_name":"アクセス権","attribute_value_mlt":[{"subitem_access_right":"open access","subitem_access_right_uri":"http://purl.org/coar/access_right/c_abf2"}]},"item_creator":{"attribute_name":"著者","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"青山, 直路","creatorNameLang":"ja"},{"creatorName":"アオヤマ, ナオミチ","creatorNameLang":"ja-Kana"},{"creatorName":"Aoyama, Naomichi","creatorNameLang":"en"}],"nameIdentifiers":[{"nameIdentifier":"17743","nameIdentifierScheme":"WEKO"},{"nameIdentifier":"9000018513412","nameIdentifierScheme":"CiNii ID","nameIdentifierURI":"http://ci.nii.ac.jp/nrid/9000018513412"}]},{"creatorNames":[{"creatorName":"渡邊, 芳英","creatorNameLang":"ja"},{"creatorName":"ワタナベ, ヨシヒデ","creatorNameLang":"ja-Kana"},{"creatorName":"Watanabe, Yoshihide","creatorNameLang":"en"}],"nameIdentifiers":[{"nameIdentifier":"15621","nameIdentifierScheme":"WEKO"},{"nameIdentifier":"1000050127742","nameIdentifierScheme":"CiNii ID","nameIdentifierURI":"http://ci.nii.ac.jp/nrid/1000050127742"},{"nameIdentifier":"50127742","nameIdentifierScheme":"e-Rad","nameIdentifierURI":"https://kaken.nii.ac.jp/ja/search/?qm=50127742"},{"nameIdentifier":"DA13048779","nameIdentifierScheme":"AID","nameIdentifierURI":"https://ci.nii.ac.jp/author/DA13048779"}]},{"creatorNames":[{"creatorName":"伊藤, 利明","creatorNameLang":"ja"},{"creatorName":"イトウ, トシアキ","creatorNameLang":"ja-Kana"},{"creatorName":"Itoh, Toshiaki","creatorNameLang":"en"}],"nameIdentifiers":[{"nameIdentifier":"17744","nameIdentifierScheme":"WEKO"},{"nameIdentifier":"1000060201927","nameIdentifierScheme":"CiNii ID","nameIdentifierURI":"http://ci.nii.ac.jp/nrid/1000060201927"},{"nameIdentifier":"60201927","nameIdentifierScheme":"e-Rad","nameIdentifierURI":"https://kaken.nii.ac.jp/ja/search/?qm=60201927"},{"nameIdentifier":"DA05926818","nameIdentifierScheme":"AID","nameIdentifierURI":"https://ci.nii.ac.jp/author/DA05926818"}]}]},"item_files":{"attribute_name":"ファイル情報","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_date","date":[{"dateType":"Available","dateValue":"2011-08-22"}],"displaytype":"detail","filename":"023052020002.pdf","filesize":[{"value":"4.6 MB"}],"format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","url":{"label":"023052020002.pdf","url":"https://doshisha.repo.nii.ac.jp/record/21412/files/023052020002.pdf"},"version_id":"ac37be23-c012-4930-80bb-3bd5adbf74f5"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"有向グラフ","subitem_subject_language":"ja","subitem_subject_scheme":"Other"},{"subitem_subject":"ネットワーク","subitem_subject_language":"ja","subitem_subject_scheme":"Other"},{"subitem_subject":"最短経路問題","subitem_subject_language":"ja","subitem_subject_scheme":"Other"},{"subitem_subject":"最少費用流問題","subitem_subject_language":"ja","subitem_subject_scheme":"Other"},{"subitem_subject":"ネットワーク・シンプレックス法","subitem_subject_language":"ja","subitem_subject_scheme":"Other"},{"subitem_subject":"digraph","subitem_subject_language":"en","subitem_subject_scheme":"Other"},{"subitem_subject":"network","subitem_subject_language":"en","subitem_subject_scheme":"Other"},{"subitem_subject":"shortest path problem","subitem_subject_language":"en","subitem_subject_scheme":"Other"},{"subitem_subject":"minimum cost flow","subitem_subject_language":"en","subitem_subject_scheme":"Other"},{"subitem_subject":"network simplex algorithm","subitem_subject_language":"en","subitem_subject_scheme":"Other"}]},"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":"最短路問題を用いたネットワークシンプレックス法のMATLABへの実装","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"最短路問題を用いたネットワークシンプレックス法のMATLABへの実装","subitem_title_language":"ja"},{"subitem_title":"サイタンロ モンダイ オ モチイタ ネットワーク シンプレックスホウ ノ MATLAB エノ ジッソウ","subitem_title_language":"ja-Kana"},{"subitem_title":"Implementation of the network simplex algorithm to MATLAB by way of the shortest path problem","subitem_title_language":"en"}]},"item_type_id":"1","owner":"20","path":["3827","8410"],"pubdate":{"attribute_name":"PubDate","attribute_value":"2011-08-22"},"publish_date":"2011-08-22","publish_status":"0","recid":"21412","relation_version_is_last":true,"title":["最短路問題を用いたネットワークシンプレックス法のMATLABへの実装"],"weko_creator_id":"20","weko_shared_id":-1},"updated":"2023-12-06T00:28:41.695295+00:00"}