{"id":229933,"updated":"2025-01-19T11:21:24.457290+00:00","links":{},"created":"2025-01-19T01:29:23.467128+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00229933","sets":["6504:11436:11440"]},"path":["11440"],"owner":"44499","recid":"229933","title":["Lévy Flightを用いたACOアルゴリズムによる制約充足問題の解法"],"pubdate":{"attribute_name":"公開日","attribute_value":"2023-02-16"},"_buckets":{"deposit":"aa025ded-26e0-4d51-923b-6f6ef66c942f"},"_deposit":{"id":"229933","pid":{"type":"depid","value":"229933","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"Lévy Flightを用いたACOアルゴリズムによる制約充足問題の解法","author_link":["618563","618562","618561"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Lévy Flightを用いたACOアルゴリズムによる制約充足問題の解法"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"人工知能と認知科学","subitem_subject_scheme":"Other"}]},"item_type_id":"22","publish_date":"2023-02-16","item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_22_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"拓大"},{"subitem_text_value":"拓大"},{"subitem_text_value":"拓大"}]},"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/229933/files/IPSJ-Z85-7Q-03.pdf","label":"IPSJ-Z85-7Q-03.pdf"},"date":[{"dateType":"Available","dateValue":"2023-11-17"}],"format":"application/pdf","filename":"IPSJ-Z85-7Q-03.pdf","filesize":[{"value":"457.7 kB"}],"mimetype":"application/pdf","accessrole":"open_date","version_id":"a16906a3-83fe-473b-b77c-86dcd8954840","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2023 by the Information Processing Society of Japan"}]},"item_22_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"小梛, 拓真"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"水野, 一徳"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"鈴木, 陽介"}],"nameIdentifiers":[{}]}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_5794","resourcetype":"conference paper"}]},"item_22_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN00349328","subitem_source_identifier_type":"NCID"}]},"item_22_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"近年，大規模なCSPを解決するための手法の一つとして，蟻コロニー最適化(ACO)が注目されている．ACOは，CSPに対しての有効性が実験的に示されているものの，解決困難な問題が存在している．その原因として，大規模な組み合わせ問題において，局所最適解に陥ってしまうことが考えられる．そこで，局所最適解を回避するためにLévy Flightを用いたACOアルゴリズムであるLévy ACOに注目した．本研究では，このLévy ACOのパラメータの一部を，探索進度に応じて動的に調整を行う方法を提案する．また，解決困難なCSPに焦点を当てた実験を行い，CSPに対する提案手法の有効性を実験的に確認する．","subitem_description_type":"Other"}]},"item_22_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"272","bibliographic_titles":[{"bibliographic_title":"第85回全国大会講演論文集"}],"bibliographicPageStart":"271","bibliographicIssueDates":{"bibliographicIssueDate":"2023-02-16","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"1","bibliographicVolumeNumber":"2023"}]},"relation_version_is_last":true,"weko_creator_id":"44499"}}