WEKO3
アイテム
{"_buckets": {"deposit": "7c899844-6942-4ee3-b44e-bf58a7117f21"}, "_deposit": {"created_by": 16, "id": "1750", "owners": [16], "pid": {"revision_id": 0, "type": "depid", "value": "1750"}, "status": "published"}, "_oai": {"id": "oai:oacis.repo.nii.ac.jp:00001750", "sets": ["371", "372", "373"]}, "author_link": ["2892", "2897", "2890", "2895", "2896"], "item_3_biblio_info_6": {"attribute_name": "書誌情報", "attribute_value_mlt": [{"bibliographicIssueDates": {"bibliographicIssueDate": "2016", "bibliographicIssueDateType": "Issued"}, "bibliographicIssueNumber": "3", "bibliographicPageStart": "JAMDSM0041", "bibliographicVolumeNumber": "10", "bibliographic_titles": [{"bibliographic_title": "Journal of Advanced Mechanical Design, Systems, and Manufacturing"}]}]}, "item_3_description_4": {"attribute_name": "抄録", "attribute_value_mlt": [{"subitem_description": "In this paper, we propose a heuristic algorithm for a container loading problem for logistic platforms, which is the problem for the Challenge Renault/ESICUP 2015. The three-dimensional container loading problem involves packing a set of cuboid items into bins so as to minimize the total volume used. In this paper, we propose an effective approach to solve this problem based on a greedy strategy. We first generate high-quality stacks that consist of some items and then pack these stacks on the floor of bins, considering the resulting problem as a two-dimensional bin packing problem. The proposed algorithm is tested on a series of instances provided for the challenge. The computational results show that the proposed algorithm performs well on these instances. ", "subitem_description_type": "Abstract"}]}, "item_3_description_63": {"attribute_name": "研究課題番号", "attribute_value_mlt": [{"subitem_description": "15K16293", "subitem_description_type": "Other"}]}, "item_3_publisher_32": {"attribute_name": "出版者", "attribute_value_mlt": [{"subitem_publisher": "日本機械学会"}]}, "item_3_relation_11": {"attribute_name": "DOI", "attribute_value_mlt": [{"subitem_relation_type_id": {"subitem_relation_type_id_text": "https://doi.org/10.1299/jamdsm.2016jamdsm0041", "subitem_relation_type_select": "DOI"}}]}, "item_3_relation_13": {"attribute_name": "情報源", "attribute_value_mlt": [{"subitem_relation_name": [{"subitem_relation_name_text": "Publisher\u0027s Version/PDF (OpenAccess)"}], "subitem_relation_type_id": {"subitem_relation_type_id_text": "https://doi.org/10.1299/jamdsm.2016jamdsm0041", "subitem_relation_type_select": "DOI"}}, {"subitem_relation_name": [{"subitem_relation_name_text": "日本機械学会"}], "subitem_relation_type_id": {"subitem_relation_type_id_text": "https://www.jsme.or.jp/", "subitem_relation_type_select": "URI"}}, {"subitem_relation_name": [{"subitem_relation_name_text": "KAKEN研究課題: 組合せ最適化問題に対する多点探索型メタ戦略の開発"}], "subitem_relation_type_id": {"subitem_relation_type_id_text": "https://kaken.nii.ac.jp/ja/grant/KAKENHI-PROJECT-15K16293/", "subitem_relation_type_select": "URI"}}, {"subitem_relation_name": [{"subitem_relation_name_text": "研究代表者: 橋本 英樹 (東京海洋大学)"}], "subitem_relation_type_id": {"subitem_relation_type_id_text": "https://nrid.nii.ac.jp/ja/nrid/1000070548114/", "subitem_relation_type_select": "URI"}}]}, "item_3_relation_28": {"attribute_name": "論文ID(NAID)", "attribute_value_mlt": [{"subitem_relation_type_id": {"subitem_relation_type_id_text": "130005161644", "subitem_relation_type_select": "NAID"}}]}, "item_3_source_id_7": {"attribute_name": "ISSN", "attribute_value_mlt": [{"subitem_source_identifier": "1881-3054", "subitem_source_identifier_type": "ISSN"}]}, "item_3_subject_62": {"attribute_name": "件名", "attribute_value_mlt": [{"subitem_subject": "科学研究費研究成果", "subitem_subject_scheme": "Other"}]}, "item_3_subject_64": {"attribute_name": "科学研究費研究課題", "attribute_value_mlt": [{"subitem_subject": "組合せ最適化問題に対する多点探索型メタ戦略の開発", "subitem_subject_scheme": "Other"}]}, "item_access_right": {"attribute_name": "アクセス権", "attribute_value_mlt": [{"subitem_access_right": "metadata only access", "subitem_access_right_uri": "http://purl.org/coar/access_right/c_14cb"}]}, "item_creator": {"attribute_name": "著者", "attribute_type": "creator", "attribute_value_mlt": [{"creatorNames": [{"creatorName": "Iwasawa, Hiroki"}], "nameIdentifiers": [{"nameIdentifier": "2896", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "Hu, Yannan"}], "nameIdentifiers": [{"nameIdentifier": "2892", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "Hashimoto, Hideki"}], "nameIdentifiers": [{"nameIdentifier": "2890", "nameIdentifierScheme": "WEKO"}, {"nameIdentifier": "70548114", "nameIdentifierScheme": "e-Rad", "nameIdentifierURI": "https://kaken.nii.ac.jp/ja/search/?qm=70548114"}]}, {"creatorNames": [{"creatorName": "Imahori, Shinji "}], "nameIdentifiers": [{"nameIdentifier": "2897", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "Yagiura, Mutsunori"}], "nameIdentifiers": [{"nameIdentifier": "2895", "nameIdentifierScheme": "WEKO"}]}]}, "item_keyword": {"attribute_name": "キーワード", "attribute_value_mlt": [{"subitem_subject": "Container loading", "subitem_subject_scheme": "Other"}, {"subitem_subject": "Bin packing", "subitem_subject_scheme": "Other"}, {"subitem_subject": "Greedy strategy", "subitem_subject_scheme": "Other"}, {"subitem_subject": "Challenge Renault/ESICUP", "subitem_subject_scheme": "Other"}]}, "item_language": {"attribute_name": "言語", "attribute_value_mlt": [{"subitem_language": "eng"}]}, "item_resource_type": {"attribute_name": "資源タイプ", "attribute_value_mlt": [{"resourcetype": "journal article", "resourceuri": "http://purl.org/coar/resource_type/c_6501"}]}, "item_title": "A heuristic algorithm for the container loading problem with complex loading constraints", "item_titles": {"attribute_name": "タイトル", "attribute_value_mlt": [{"subitem_title": "A heuristic algorithm for the container loading problem with complex loading constraints"}]}, "item_type_id": "3", "owner": "16", "path": ["371", "372", "373"], "permalink_uri": "https://oacis.repo.nii.ac.jp/records/1750", "pubdate": {"attribute_name": "公開日", "attribute_value": "2019-06-03"}, "publish_date": "2019-06-03", "publish_status": "0", "recid": "1750", "relation": {}, "relation_version_is_last": true, "title": ["A heuristic algorithm for the container loading problem with complex loading constraints"], "weko_shared_id": -1}
A heuristic algorithm for the container loading problem with complex loading constraints
https://oacis.repo.nii.ac.jp/records/1750
https://oacis.repo.nii.ac.jp/records/1750707f35b7-06da-4f4f-a097-83d99768a792
Item type | 学術雑誌論文 / Journal Article(1) | |||||
---|---|---|---|---|---|---|
公開日 | 2019-06-03 | |||||
タイトル | ||||||
タイトル | A heuristic algorithm for the container loading problem with complex loading constraints | |||||
言語 | ||||||
言語 | eng | |||||
キーワード | ||||||
主題 | Container loading, Bin packing, Greedy strategy, Challenge Renault/ESICUP | |||||
資源タイプ | ||||||
資源タイプ | journal article | |||||
アクセス権 | ||||||
アクセス権 | metadata only access | |||||
著者 |
Iwasawa, Hiroki
× Iwasawa, Hiroki× Hu, Yannan× Hashimoto, Hideki× Imahori, Shinji× Yagiura, Mutsunori |
|||||
書誌情報 |
Journal of Advanced Mechanical Design, Systems, and Manufacturing 巻 10, 号 3, p. JAMDSM0041, 発行日 2016 |
|||||
抄録 | ||||||
内容記述 | In this paper, we propose a heuristic algorithm for a container loading problem for logistic platforms, which is the problem for the Challenge Renault/ESICUP 2015. The three-dimensional container loading problem involves packing a set of cuboid items into bins so as to minimize the total volume used. In this paper, we propose an effective approach to solve this problem based on a greedy strategy. We first generate high-quality stacks that consist of some items and then pack these stacks on the floor of bins, considering the resulting problem as a two-dimensional bin packing problem. The proposed algorithm is tested on a series of instances provided for the challenge. The computational results show that the proposed algorithm performs well on these instances. | |||||
ISSN | ||||||
収録物識別子タイプ | ISSN | |||||
収録物識別子 | 1881-3054 | |||||
DOI | ||||||
識別子タイプ | DOI | |||||
関連識別子 | https://doi.org/10.1299/jamdsm.2016jamdsm0041 | |||||
情報源 | ||||||
関連識別子 | https://doi.org/10.1299/jamdsm.2016jamdsm0041 | |||||
関連名称 | Publisher's Version/PDF (OpenAccess) | |||||
情報源 | ||||||
関連識別子 | https://www.jsme.or.jp/ | |||||
関連名称 | 日本機械学会 | |||||
情報源 | ||||||
関連識別子 | https://kaken.nii.ac.jp/ja/grant/KAKENHI-PROJECT-15K16293/ | |||||
関連名称 | KAKEN研究課題: 組合せ最適化問題に対する多点探索型メタ戦略の開発 | |||||
情報源 | ||||||
関連識別子 | https://nrid.nii.ac.jp/ja/nrid/1000070548114/ | |||||
関連名称 | 研究代表者: 橋本 英樹 (東京海洋大学) | |||||
件名 | ||||||
主題 | 科学研究費研究成果 | |||||
論文ID(NAID) | ||||||
識別子タイプ | NAID | |||||
関連識別子 | 130005161644 | |||||
出版者 | ||||||
出版者 | 日本機械学会 | |||||
科学研究費研究課題 | ||||||
主題 | 組合せ最適化問題に対する多点探索型メタ戦略の開発 | |||||
研究課題番号 | ||||||
内容記述 | 15K16293 |