{"created":"2025-01-18T23:31:08.616142+00:00","updated":"2025-01-21T22:06:24.231751+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00072983","sets":["1164:2735:6337:6338"]},"path":["6338"],"owner":"10","recid":"72983","title":["部品装着機におけるノズル割当を考慮した装着順序問題に対するヒューリスティックな解法"],"pubdate":{"attribute_name":"公開日","attribute_value":"2011-02-28"},"_buckets":{"deposit":"750e8964-4a91-404a-9f0e-7da088a3f540"},"_deposit":{"id":"72983","pid":{"type":"depid","value":"72983","revision_id":0},"owners":[10],"status":"published","created_by":10},"item_title":"部品装着機におけるノズル割当を考慮した装着順序問題に対するヒューリスティックな解法","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"部品装着機におけるノズル割当を考慮した装着順序問題に対するヒューリスティックな解法"},{"subitem_title":"A Heuristic Algorithm for Placement Sequence Problem with Nozzle Assignment in a Chip Mounting Machine","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2011-02-28","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"東京農工大学"},{"subitem_text_value":"東京農工大学"},{"subitem_text_value":"東京農工大学"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Tokyo University of Agriculture and Technology","subitem_text_language":"en"},{"subitem_text_value":"Tokyo University of Agriculture and Technology","subitem_text_language":"en"},{"subitem_text_value":"Tokyo University of Agriculture and Technology","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_publisher":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"情報処理学会","subitem_publisher_language":"ja"}]},"publish_status":"0","weko_shared_id":-1,"item_file_price":{"attribute_name":"Billing file","attribute_type":"file","attribute_value_mlt":[{"url":{"url":"https://ipsj.ixsq.nii.ac.jp/record/72983/files/IPSJ-MPS11082005.pdf"},"date":[{"dateType":"Available","dateValue":"2013-02-28"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-MPS11082005.pdf","filesize":[{"value":"445.7 kB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"660","billingrole":"5"},{"tax":["include_tax"],"price":"330","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"17"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"c48acdda-6c0f-47dd-b98f-a1fbda5a0102","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2011 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"山本, 圭輔"},{"creatorName":"太田, 秀典"},{"creatorName":"中森, 眞理雄"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Keisuke, Yamamoto","creatorNameLang":"en"},{"creatorName":"Hidenori, Ohta","creatorNameLang":"en"},{"creatorName":"Mario, Nakamori","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN10505667","subitem_source_identifier_type":"NCID"}]},"item_4_textarea_12":{"attribute_name":"Notice","attribute_value_mlt":[{"subitem_textarea_value":"SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc."}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_18gh","resourcetype":"technical report"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"本論文は,電子基板の生産効率向上を目的として,多機能型部品装着機における部品の装着順序問題の解法を論じている.この問題は装着機のライン全体の動作最適化問題の部分問題であり,配送計画問題 (Vehicle Routing Problem, VRP) の一種と解釈することができる.しかしながら,部品を装着するノズルの位置が経路に影響を及ぼすため,通常の VRP に比べてより複雑な問題となっている.本論文では装着順序問題を整数計画問題として定式化し,機械の特徴を考慮した高速なアルゴリズムを提案する.そして,提案アルゴリズムが,時間をかけて探索を行った解と比較しても遜色のない結果を,実用的な時間で与えることを計算機実験により示す.","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"In this paper, we discuss algorithms for the placement sequence problem that significantly affects the performance of chip mounting machines. This problem is a kind of the Vehicle Routing Problem (VRP). However, distance between nozzles of a head in the chip mounting machine makes it more difficult than the typical VRP. We formulate the problem as an integer programming problem and propose several algorithms considering features of the machine. As a result of computational experiments, we obtain satisfactory solutions in practical time.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"6","bibliographic_titles":[{"bibliographic_title":"研究報告数理モデル化と問題解決(MPS)"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2011-02-28","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"5","bibliographicVolumeNumber":"2011-MPS-82"}]},"relation_version_is_last":true,"weko_creator_id":"10"},"id":72983,"links":{}}