{"updated":"2025-01-23T01:15:31.995882+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00013388","sets":["581:729:736"]},"path":["736"],"owner":"1","recid":"13388","title":["遺伝的局所探索法によるジョブショップスケジューリング問題の解法"],"pubdate":{"attribute_name":"公開日","attribute_value":"1997-06-15"},"_buckets":{"deposit":"3d516a5b-ae57-4ee6-baf4-d07652e38936"},"_deposit":{"id":"13388","pid":{"type":"depid","value":"13388","revision_id":0},"owners":[1],"status":"published","created_by":1},"item_title":"遺伝的局所探索法によるジョブショップスケジューリング問題の解法","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"遺伝的局所探索法によるジョブショップスケジューリング問題の解法"},{"subitem_title":"Job - Shop Scheduling by Genetic Local Search","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"論文","subitem_subject_scheme":"Other"}]},"item_type_id":"2","publish_date":"1997-06-15","item_2_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"NTTコミュニケーション科学研究所"},{"subitem_text_value":"NTTコミュニケーション科学研究所"}]},"item_2_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"NTT Communication Science Laboratories","subitem_text_language":"en"},{"subitem_text_value":"NTT Communication Science Laboratories","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"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/13388/files/IPSJ-JNL3806006.pdf"},"date":[{"dateType":"Available","dateValue":"1999-06-15"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-JNL3806006.pdf","filesize":[{"value":"1.6 MB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"660","billingrole":"5"},{"tax":["include_tax"],"price":"330","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"8"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"8459fd2a-f3a8-4f49-b685-959769d8d85c","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 1997 by the Information Processing Society of Japan"}]},"item_2_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"山田, 武士"},{"creatorName":"中野, 良平"}],"nameIdentifiers":[{}]}]},"item_2_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Takeshi, Yamada","creatorNameLang":"en"},{"creatorName":"Ryohei, Nakano","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_2_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN00116647","subitem_source_identifier_type":"NCID"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_6501","resourcetype":"journal article"}]},"item_2_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"1882-7764","subitem_source_identifier_type":"ISSN"}]},"item_2_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"ジョブショップスケジューリング問題（JSSP）はNP?困難な組合せ最適化問題の中でも特に難しい問題の1つとされている．本論文では，JSSPの近似解法として，局所近傍探索と遺伝的アルゴリズム（GA）との組合せによる多段階探索交叉GA (MSXF?GA）を提案する．MSXF?GAは，アクティブスケジュールのクリティカルブロック（CB）上の作業の移動に基づく近傍であるアクティブCB近傍に基づく近傍探索と，問題空間の距離と近傍構造に基づく交叉である多段階探索交叉（MSXF）を用いたGAから構成される．さらに，アクティブスケジュールに対し「スケジュールの反転」という概念を導入し，与えられた問題に適した方向を適応的に選択する機構を取り入れて，解法の高速化を図る．MSXF?GAを含むいくつかの解法をジョブショップスケジューリング問題（JSSP）のベンチマーク問題に適用したところ，高品質の解が高速かつ安定して求まるという，MSXF?GAの優れた性能が明らかになった．","subitem_description_type":"Other"}]},"item_2_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"The job-shop scheduling problem(JSSP) is one of the most difficult NP-hard combinatorial optimization problems.In this paper,an approximation method for JSSP called MSXF-GA is proposed using local neighborhood search and evolutionary computation,especially Genetic Algorithms(GA).MSXF-GA is composed by a neighborhood search that uses active CB neighborhood based on an active scheduler and operation permutations on the critical path,and Multi-Step Grossover Fusion(MSXF) that utilizes a neighborhood structure and a distance measure in the search space.The \"reversal of the direction\" of an active schedule is also introduced and MSXF-GA can adaptively select an appropriate direction for a given problem.Experimental results showed such a promising performance of MSXF-GA that it quickly found near optimal schedules in most cases.","subitem_description_type":"Other"}]},"item_2_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"1138","bibliographic_titles":[{"bibliographic_title":"情報処理学会論文誌"}],"bibliographicPageStart":"1126","bibliographicIssueDates":{"bibliographicIssueDate":"1997-06-15","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"6","bibliographicVolumeNumber":"38"}]},"relation_version_is_last":true,"item_2_alternative_title_2":{"attribute_name":"その他タイトル","attribute_value_mlt":[{"subitem_alternative_title":"人工知識と認知科学"}]},"weko_creator_id":"1"},"created":"2025-01-18T22:47:29.221237+00:00","id":13388,"links":{}}