{"created":"2023-06-26T10:48:35.593753+00:00","id":2895,"links":{},"metadata":{"_buckets":{"deposit":"20f4a57a-7ef4-4c99-99c7-731efc7e8c21"},"_deposit":{"created_by":3,"id":"2895","owners":[3],"pid":{"revision_id":0,"type":"depid","value":"2895"},"status":"published"},"_oai":{"id":"oai:sgul.repo.nii.ac.jp:00002895","sets":[]},"author_link":["2350","2351"],"item_4_alternative_title_19":{"attribute_name":"その他のタイトル","attribute_value_mlt":[{"subitem_alternative_title":"Efficient Computation of the Container Pre-Marshalling Problem with a Proof Method of the Impossibility of Solutions"}]},"item_4_biblio_info_7":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"2018-03-20","bibliographicIssueDateType":"Issued"},"bibliographicPageEnd":"15","bibliographicPageStart":"7","bibliographicVolumeNumber":"5","bibliographic_titles":[{"bibliographic_title":"札幌学院大学総合研究所紀要 = Proceedings of the Research institute of Sapporo Gakuin University"}]}]},"item_4_description_4":{"attribute_name":"抄録","attribute_value_mlt":[{"subitem_description":"　本論文は，組み合わせ最適化問題の一つであるコンテナプリマーシャリング問題（CPMP）の最適解を効率的に得るための手法を提案する．この手法は，CPMP の計算中に現れる特定の状態に対して，ある特定の解集合の存在不可能性を判定する．この判定結果を用いることで特定の問題の計算効率を改善できることを示す．\n　This paper proposes an efficient method for optimal solutions of the container premarshalling problem (CPMP). The method determines the possibility of a certain class of solutions to a certain class of CPMPs. This paper shows that the class of CPMPs can be efficiently solved by using the proposed method.","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"}]},"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":"2018-04-10"}],"displaytype":"detail","filename":"SK-5-007.pdf","filesize":[{"value":"497.5 kB"}],"format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","url":{"label":"SK-5-007.pdf","url":"https://sgul.repo.nii.ac.jp/record/2895/files/SK-5-007.pdf"},"version_id":"d152354b-8844-4d1c-8f11-0218a227302f"}]},"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":"Combinational 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":"Optimization","subitem_subject_language":"en","subitem_subject_scheme":"Other"},{"subitem_subject":"Impossibility Proof Method","subitem_subject_language":"en","subitem_subject_scheme":"Other"},{"subitem_subject":"Logistics","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":"Efficient Computation of the Container Pre-Marshalling Problem with a Proof Method of the Impossibility of Solutions","subitem_title_language":"en"}]},"item_type_id":"4","owner":"3","path":["332"],"pubdate":{"attribute_name":"公開日","attribute_value":"2018-04-10"},"publish_date":"2018-04-10","publish_status":"0","recid":"2895","relation_version_is_last":true,"title":["解存在不可能性の証明法を用いたコンテナプリマーシャリング問題の効率的な計算"],"weko_creator_id":"3","weko_shared_id":3},"updated":"2023-07-27T03:57:32.913894+00:00"}