{"created":"2023-06-26T10:48:31.733622+00:00","id":2811,"links":{},"metadata":{"_buckets":{"deposit":"ec36dddc-2ac3-42e1-af1f-bc355c80c27c"},"_deposit":{"created_by":3,"id":"2811","owners":[3],"pid":{"revision_id":0,"type":"depid","value":"2811"},"status":"published"},"_oai":{"id":"oai:sgul.repo.nii.ac.jp:00002811","sets":[]},"author_link":["4305","4306"],"item_4_alternative_title_19":{"attribute_name":"その他のタイトル","attribute_value_mlt":[{"subitem_alternative_title":"Reducing Search Space of the Container Pre-Marshalling Problem"}]},"item_4_biblio_info_7":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"2017-03-25","bibliographicIssueDateType":"Issued"},"bibliographicPageEnd":"15","bibliographicPageStart":"9","bibliographicVolumeNumber":"4","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 discusses an efficient search method for optimal solutions of the container pre-marshalling problem by reducing the search space. This paper pursues an optimization method preserving its optimality without heuristics, while most of the existing approaches introduce heuristics for efficiency. Further, this paper demonstrates how the proposed approach surpasses heuristic approaches in both optimality and efficiency.","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":"4306","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":"2017-03-30"}],"displaytype":"detail","filename":"SK-4-009.pdf","filesize":[{"value":"329.1 kB"}],"format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","url":{"label":"SK-4-009.pdf","url":"https://sgul.repo.nii.ac.jp/record/2811/files/SK-4-009.pdf"},"version_id":"1355061d-d982-4832-b4fe-7b48981305bf"}]},"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":"NP困難","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":"NP-Hardness","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":"Reducing Search Space of the Container Pre-Marshalling Problem","subitem_title_language":"en"}]},"item_type_id":"4","owner":"3","path":["322"],"pubdate":{"attribute_name":"公開日","attribute_value":"2017-03-30"},"publish_date":"2017-03-30","publish_status":"0","recid":"2811","relation_version_is_last":true,"title":["コンテナプリマーシャリング問題における探索空間の削減"],"weko_creator_id":"3","weko_shared_id":3},"updated":"2023-07-27T03:58:10.710100+00:00"}