{"created":"2023-05-15T12:21:00.569102+00:00","id":11769,"links":{},"metadata":{"_buckets":{"deposit":"49a0b957-0b4f-410c-a14c-e80bd19a2621"},"_deposit":{"created_by":1,"id":"11769","owners":[1],"pid":{"revision_id":0,"type":"depid","value":"11769"},"status":"published"},"_oai":{"id":"oai:kansai-u.repo.nii.ac.jp:00011769","sets":["528:1588:1617:1625"]},"author_link":["28102","28099","28097","28100","28098","28096","28101"],"item_10_biblio_info_7":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"2005-03-21","bibliographicIssueDateType":"Issued"},"bibliographicPageEnd":"10","bibliographicPageStart":"1","bibliographicVolumeNumber":"47","bibliographic_titles":[{"bibliographic_title":"関西大学工学研究報告 = Technology reports of the Kansai University"}]}]},"item_10_description_4":{"attribute_name":"概要","attribute_value_mlt":[{"subitem_description":"When several items having different weights are packed into a bag, the sum weight of each packed bag needs to be constant. The problem at packing is how to determine the items to be included in a bag so that the sum weight should be closest to the desired weight. In this paper, the following two algorithms are shown; one is to solve as an optimization problem and the other is to solve as a constraint satisfaction problem. Comparing the two algorithms, their functional rolls are made clear. In order to reduce the number of items remaining in scale hoppers for a long time, a method is proposed in which each of the two algorithms can be turned over one after another. Simulation results seem to prove that the proposed method is preferable.","subitem_description_type":"Other"}]},"item_10_full_name_3":{"attribute_name":"著者別名","attribute_value_mlt":[{"nameIdentifiers":[{"nameIdentifier":"28100","nameIdentifierScheme":"WEKO"}],"names":[{"name":"村上, 佳広"}]},{"nameIdentifiers":[{"nameIdentifier":"28101","nameIdentifierScheme":"WEKO"}],"names":[{"name":"倉田, 純一"}]},{"nameIdentifiers":[{"nameIdentifier":"28102","nameIdentifierScheme":"WEKO"}],"names":[{"name":"内山, 寛信"}]}]},"item_10_publisher_34":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"関西大学工学部"}]},"item_10_source_id_10":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN00046916","subitem_source_identifier_type":"NCID"}]},"item_10_source_id_8":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"04532198","subitem_source_identifier_type":"ISSN"}]},"item_10_version_type_17":{"attribute_name":"著者版フラグ","attribute_value_mlt":[{"subitem_version_resource":"http://purl.org/coar/version/c_970fb48d4fbd8a85","subitem_version_type":"VoR"}]},"item_creator":{"attribute_name":"著者","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Murakami, Yoshihiro"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Kurata, Junichi"}],"nameIdentifiers":[{},{}]},{"creatorNames":[{"creatorName":"Uchiyama, Hironobu"}],"nameIdentifiers":[{},{}]},{"creatorNames":[{"creatorName":"Marquardt, Wolfgang"}],"nameIdentifiers":[{}]}]},"item_files":{"attribute_name":"ファイル情報","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_date","date":[{"dateType":"Available","dateValue":"2019-05-23"}],"displaytype":"detail","filename":"KU-1100-20050321-01.pdf","filesize":[{"value":"724.5 kB"}],"format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","url":{"label":"KU-1100-20050321-01.pdf","url":"https://kansai-u.repo.nii.ac.jp/record/11769/files/KU-1100-20050321-01.pdf"},"version_id":"bb5bb9e6-fb1f-4b9b-8fdf-5b0e7d69fca7"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"eng"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourcetype":"departmental bulletin paper","resourceuri":"http://purl.org/coar/resource_type/c_6501"}]},"item_title":"Reducing the Number of Long-term Items : Optimal Strategy for a Bag-packing Problem","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Reducing the Number of Long-term Items : Optimal Strategy for a Bag-packing Problem"}]},"item_type_id":"10","owner":"1","path":["1625"],"pubdate":{"attribute_name":"公開日","attribute_value":"2018-01-26"},"publish_date":"2018-01-26","publish_status":"0","recid":"11769","relation_version_is_last":true,"title":["Reducing the Number of Long-term Items : Optimal Strategy for a Bag-packing Problem"],"weko_creator_id":"1","weko_shared_id":1},"updated":"2023-05-15T15:08:34.543257+00:00"}