{"created":"2023-06-26T10:48:47.035395+00:00","id":3128,"links":{},"metadata":{"_buckets":{"deposit":"0540c5ba-a0a7-4fed-9d6f-daa4c2ac34a6"},"_deposit":{"created_by":3,"id":"3128","owners":[3],"pid":{"revision_id":0,"type":"depid","value":"3128"},"status":"published"},"_oai":{"id":"oai:sgul.repo.nii.ac.jp:00003128","sets":[]},"author_link":["2350","2351"],"item_4_alternative_title_19":{"attribute_name":"その他のタイトル","attribute_value_mlt":[{"subitem_alternative_title":"Software Framework Design for Fast Enumeration of Optimal Solutions to Combinatorial Optimization Problems"}]},"item_4_biblio_info_7":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"2021-03-20","bibliographicIssueDateType":"Issued"},"bibliographicPageEnd":"78","bibliographicPageStart":"67","bibliographicVolumeNumber":"8","bibliographic_titles":[{"bibliographic_title":"札幌学院大学総合研究所紀要 = Proceedings of the Research institute of Sapporo Gakuin University"}]}]},"item_4_description_4":{"attribute_name":"抄録","attribute_value_mlt":[{"subitem_description":"　解法が確立していない問題を解くためのソフトウェア開発では，プログラムの仕様の変更が頻繁に起こることがある．本論文は，頻繁な仕様変更に対応しながら正しくて効率的なプログラムを開発するためのフレームワークを提案する．本研究の特徴は，プログラムの部品を書き換えルールで表現し，仕様から正しい書き換えルールを生成・集積してプログラムを構成することである．このことによってプログラムの効率と正しさの両立が可能になる．フレームワークの適用例としてコンテナ・プリマーシャリング問題の最適解を高速列挙するプログラムの開発プロセスを扱う．","subitem_description_type":"Abstract"},{"subitem_description":"　Frequent revision of program specifications can occur in software development to solve problems of which well-established solutions have yet to be found. This paper proposes a framework for software development to efficiently enumerate optimal solutions to combinatorial optimization problems; the framework copes with the frequent specification changes. A peculiarity of this study is that we represent each program component as a correct rewriting rule, which is generated from a specification and accumulates in a program. The peculiarity enables us to manage both efficiency and correctness of a program. This paper demonstrates a software development process to efficiently enumerate optimal solutions to a container pre-marshalling problem as an application example of the ramework.","subitem_description_type":"Abstract"}]},"item_4_description_40":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"subitem_description":"Bulletin","subitem_description_type":"Other"}]},"item_4_description_5":{"attribute_name":"内容記述","attribute_value_mlt":[{"subitem_description":"情報科学","subitem_description_type":"Other"},{"subitem_description":"Information Sciences","subitem_description_type":"Other"},{"subitem_description":"論文","subitem_description_type":"Other"}]},"item_4_full_name_3":{"attribute_name":"著者別名","attribute_value_mlt":[{"nameIdentifiers":[{"nameIdentifier":"2351","nameIdentifierScheme":"WEKO"}],"names":[{"name":"KOIKE, Hidekatsu"}]}]},"item_4_publisher_33":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"札幌学院大学総合研究所 = Research Institute of Sapporo Gakuin University"}]},"item_4_source_id_8":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"2188-4897","subitem_source_identifier_type":"ISSN"}]},"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":"2021-04-21"}],"displaytype":"detail","filename":"SK-8-067.pdf","filesize":[{"value":"5.7 MB"}],"format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","url":{"label":"SK-8-067.pdf","url":"https://sgul.repo.nii.ac.jp/record/3128/files/SK-8-067.pdf"},"version_id":"0bdce080-bdac-4294-abb3-be2f22186edf"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"組合せ最適化","subitem_subject_scheme":"Other"},{"subitem_subject":"コンテナ・プリマーシャリング問題","subitem_subject_scheme":"Other"},{"subitem_subject":"列挙","subitem_subject_scheme":"Other"},{"subitem_subject":"ソフトウェアフレームワーク","subitem_subject_scheme":"Other"},{"subitem_subject":"ロジスティクス","subitem_subject_scheme":"Other"},{"subitem_subject":"Combinatorial Optimization","subitem_subject_language":"en","subitem_subject_scheme":"Other"},{"subitem_subject":"Container Pre-Marshalling Problem","subitem_subject_language":"en","subitem_subject_scheme":"Other"},{"subitem_subject":"Enumeration","subitem_subject_language":"en","subitem_subject_scheme":"Other"},{"subitem_subject":"Logistics","subitem_subject_language":"en","subitem_subject_scheme":"Other"},{"subitem_subject":"Software Framework","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":"組合せ最適化問題の最適解を高速列挙するためのソフトウェアフレームワーク設計","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"組合せ最適化問題の最適解を高速列挙するためのソフトウェアフレームワーク設計"},{"subitem_title":"Software Framework Design for Fast Enumeration of Optimal Solutions to Combinatorial Optimization Problems","subitem_title_language":"en"}]},"item_type_id":"4","owner":"3","path":["360"],"pubdate":{"attribute_name":"公開日","attribute_value":"2021-04-21"},"publish_date":"2021-04-21","publish_status":"0","recid":"3128","relation_version_is_last":true,"title":["組合せ最適化問題の最適解を高速列挙するためのソフトウェアフレームワーク設計"],"weko_creator_id":"3","weko_shared_id":3},"updated":"2023-07-27T03:56:47.060097+00:00"}