{"updated":"2025-01-19T23:52:07.702861+00:00","links":{},"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00193601","sets":["6164:6165:6640:9657"]},"path":["9657"],"owner":"44499","recid":"193601","title":["カンファレンスプログラム編成のための局所探索法 ～初期解生成と近傍交換の改良～"],"pubdate":{"attribute_name":"公開日","attribute_value":"2018-06-27"},"_buckets":{"deposit":"e354c1f5-09b5-47de-984a-60be3592e154"},"_deposit":{"id":"193601","pid":{"type":"depid","value":"193601","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"カンファレンスプログラム編成のための局所探索法 ～初期解生成と近傍交換の改良～","author_link":["454023"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"カンファレンスプログラム編成のための局所探索法 ～初期解生成と近傍交換の改良～"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"コンテンツクリエーション","subitem_subject_scheme":"Other"}]},"item_type_id":"18","publish_date":"2018-06-27","item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_18_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"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/193601/files/IPSJ-DICOMO2018174.pdf","label":"IPSJ-DICOMO2018174.pdf"},"date":[{"dateType":"Available","dateValue":"2020-06-27"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-DICOMO2018174.pdf","filesize":[{"value":"477.4 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":"44"}],"accessrole":"open_date","version_id":"f555e07c-0181-4592-a0e4-b753d085a81d","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2018 by the Information Processing Society of Japan"}]},"item_18_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"田岡, 智志"}],"nameIdentifiers":[{}]}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_5794","resourcetype":"conference paper"}]},"item_18_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"多種多様な制約条件を満たす必要があるカンファレンスプログラムの編成には多\n大な労力と時間がかかる．理論的にも，この編成を行うセッションスケジューリ\nング問題は，最適化問題の一つであり，NP-困難であることが知られている．これ\nまでに，筆者らは解の質が高く高速にカンファレンスプログラムを編成する局所\n探索法を提案した．本稿では，論文の帰属分野に整合するセッション配置に重点\nを置いた初期解生成法や近傍交換法を組込むことで局所探索法の改良を行い，その有効性を計算機実験により示す．","subitem_description_type":"Other"}]},"item_18_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"1167","bibliographic_titles":[{"bibliographic_title":"マルチメディア，分散協調とモバイルシンポジウム2018論文集"}],"bibliographicPageStart":"1161","bibliographicIssueDates":{"bibliographicIssueDate":"2018-06-27","bibliographicIssueDateType":"Issued"},"bibliographicVolumeNumber":"2018"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"id":193601,"created":"2025-01-19T00:58:49.048566+00:00"}