WEKO3
アイテム
{"_buckets": {"deposit": "25b3094c-f5e6-4b08-afc1-03a08f4be3f7"}, "_deposit": {"created_by": 1, "id": "11111", "owners": [1], "pid": {"revision_id": 0, "type": "depid", "value": "11111"}, "status": "published"}, "_oai": {"id": "oai:kansai-u.repo.nii.ac.jp:00011111", "sets": ["1591"]}, "author_link": ["24034", "24033", "24031", "24032", "24030", "24029"], "item_9_biblio_info_7": {"attribute_name": "書誌情報", "attribute_value_mlt": [{"bibliographicIssueDates": {"bibliographicIssueDate": "2014-08", "bibliographicIssueDateType": "Issued"}, "bibliographicIssueNumber": "8", "bibliographicPageEnd": "1738", "bibliographicPageStart": "1728", "bibliographicVolumeNumber": "E97-A", "bibliographic_titles": [{"bibliographic_title": "IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences"}]}]}, "item_9_description_4": {"attribute_name": "概要", "attribute_value_mlt": [{"subitem_description": "Metaheauristic methods have been studied for combinational optimization problems for some time. Recently, a Consultant-Guided Search(CGS) has been proposed as a metaheuristic method for the Traveling Salesperson Problem(TSP). This approach is an algorithm in which a virtual person called a client creates a solution based on consultation with a virtual person called a consultant. In this research, we propose a parallel algorithm which uses the Ant Colony System(ACS) to create a solution with a consultant in a Consultant-Guided Search, and calculates an approximation solution for the TSP. Finally, we execute a computer experiment using the benchmark problems(TSPLIB). Our algorithm provides a solution with less than 2% error rate for problem instances using less than 2000 cities.", "subitem_description_type": "Other"}]}, "item_9_description_42": {"attribute_name": "資源タイプ", "attribute_value_mlt": [{"subitem_description": "Journal Article", "subitem_description_type": "Other"}]}, "item_9_full_name_3": {"attribute_name": "著者別名", "attribute_value_mlt": [{"nameIdentifiers": [{"nameIdentifier": "24032", "nameIdentifierScheme": "WEKO"}], "names": [{"name": "榎原, 博之"}]}, {"nameIdentifiers": [{"nameIdentifier": "24033", "nameIdentifierScheme": "WEKO"}], "names": [{"name": "平沼, 雄大"}]}, {"nameIdentifiers": [{"nameIdentifier": "24034", "nameIdentifierScheme": "WEKO"}], "names": [{"name": "中山, 弘基"}]}]}, "item_9_publisher_34": {"attribute_name": "出版者", "attribute_value_mlt": [{"subitem_publisher": "一般社団法人 電子情報通信学会"}]}, "item_9_relation_12": {"attribute_name": "DOI", "attribute_value_mlt": [{"subitem_relation_type": "isIdenticalTo", "subitem_relation_type_id": {"subitem_relation_type_id_text": "10.1587/transfun.e97.a.1728", "subitem_relation_type_select": "DOI"}}]}, "item_9_rights_13": {"attribute_name": "権利", "attribute_value_mlt": [{"subitem_rights": "Copyright(c)2014 The Institute of Electronics,Information and Communication Engineers"}, {"subitem_rights": "Original text is available at https://search.ieice.org/index.html"}]}, "item_9_source_id_10": {"attribute_name": "書誌レコードID", "attribute_value_mlt": [{"subitem_source_identifier": "AA10826239", "subitem_source_identifier_type": "NCID"}]}, "item_9_source_id_8": {"attribute_name": "ISSN", "attribute_value_mlt": [{"subitem_source_identifier": "09168508", "subitem_source_identifier_type": "ISSN"}, {"subitem_source_identifier": "17451337", "subitem_source_identifier_type": "ISSN"}]}, "item_9_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": "Ebara, Hiroyuki"}], "nameIdentifiers": [{"nameIdentifier": "24029", "nameIdentifierScheme": "WEKO"}, {"nameIdentifier": "50194014", "nameIdentifierScheme": "e-Rad", "nameIdentifierURI": "https://nrid.nii.ac.jp/ja/nrid/1000050194014"}, {"nameIdentifier": "0000-0002-0725-3495", "nameIdentifierScheme": "ORCID iD", "nameIdentifierURI": "https://orcid.org/0000-0002-0725-3495"}]}, {"creatorNames": [{"creatorName": "Hiranuma, Yudai"}], "nameIdentifiers": [{"nameIdentifier": "24030", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "Nakayama, Koki"}], "nameIdentifiers": [{"nameIdentifier": "24031", "nameIdentifierScheme": "WEKO"}]}]}, "item_files": {"attribute_name": "ファイル情報", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_date", "date": [{"dateType": "Available", "dateValue": "2019-05-23"}], "displaytype": "detail", "download_preview_message": "", "file_order": 0, "filename": "KU-1100-20140800-00.pdf", "filesize": [{"value": "3.1 MB"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_free", "mimetype": "application/pdf", "size": 3100000.0, "url": {"label": "KU-1100-20140800-00.pdf", "url": "https://kansai-u.repo.nii.ac.jp/record/11111/files/KU-1100-20140800-00.pdf"}, "version_id": "56f6010f-b34f-4519-89c7-9fb00236d8ce"}]}, "item_keyword": {"attribute_name": "キーワード", "attribute_value_mlt": [{"subitem_subject": "Cosultant-Guided Search", "subitem_subject_scheme": "Other"}, {"subitem_subject": "Traveling Salesperson Problem", "subitem_subject_scheme": "Other"}, {"subitem_subject": "Combinatorial Optimization Problem", "subitem_subject_scheme": "Other"}, {"subitem_subject": "Parallel Algorithm", "subitem_subject_scheme": "Other"}, {"subitem_subject": "Ant Colony Optimization", "subitem_subject_scheme": "Other"}]}, "item_language": {"attribute_name": "言語", "attribute_value_mlt": [{"subitem_language": "eng"}]}, "item_resource_type": {"attribute_name": "資源タイプ", "attribute_value_mlt": [{"resourcetype": "journal article", "resourceuri": "http://purl.org/coar/resource_type/c_6501"}]}, "item_title": "Hybrid Consultant-Guided Search for the Traveling Salesperson Problem", "item_titles": {"attribute_name": "タイトル", "attribute_value_mlt": [{"subitem_title": "Hybrid Consultant-Guided Search for the Traveling Salesperson Problem"}]}, "item_type_id": "9", "owner": "1", "path": ["1591"], "permalink_uri": "http://hdl.handle.net/10112/9428", "pubdate": {"attribute_name": "公開日", "attribute_value": "2015-11-13"}, "publish_date": "2015-11-13", "publish_status": "0", "recid": "11111", "relation": {}, "relation_version_is_last": true, "title": ["Hybrid Consultant-Guided Search for the Traveling Salesperson Problem"], "weko_shared_id": 1}
Hybrid Consultant-Guided Search for the Traveling Salesperson Problem
http://hdl.handle.net/10112/9428
http://hdl.handle.net/10112/9428cdab4646-868a-47a6-9bbc-1f4d4819f880
名前 / ファイル | ライセンス | アクション |
---|---|---|
KU-1100-20140800-00.pdf (3.1 MB)
|
|
Item type | 学術雑誌論文 / Journal Article(1) | |||||
---|---|---|---|---|---|---|
公開日 | 2015-11-13 | |||||
タイトル | ||||||
タイトル | Hybrid Consultant-Guided Search for the Traveling Salesperson Problem | |||||
言語 | ||||||
言語 | eng | |||||
資源タイプ | ||||||
資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||
資源タイプ | journal article | |||||
著者 |
Ebara, Hiroyuki
× Ebara, Hiroyuki× Hiranuma, Yudai× Nakayama, Koki |
|||||
著者別名 | ||||||
姓名 | 榎原, 博之 | |||||
著者別名 | ||||||
姓名 | 平沼, 雄大 | |||||
著者別名 | ||||||
姓名 | 中山, 弘基 | |||||
概要 | ||||||
内容記述タイプ | Other | |||||
内容記述 | Metaheauristic methods have been studied for combinational optimization problems for some time. Recently, a Consultant-Guided Search(CGS) has been proposed as a metaheuristic method for the Traveling Salesperson Problem(TSP). This approach is an algorithm in which a virtual person called a client creates a solution based on consultation with a virtual person called a consultant. In this research, we propose a parallel algorithm which uses the Ant Colony System(ACS) to create a solution with a consultant in a Consultant-Guided Search, and calculates an approximation solution for the TSP. Finally, we execute a computer experiment using the benchmark problems(TSPLIB). Our algorithm provides a solution with less than 2% error rate for problem instances using less than 2000 cities. | |||||
書誌情報 |
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences 巻 E97-A, 号 8, p. 1728-1738, 発行日 2014-08 |
|||||
ISSN | ||||||
収録物識別子タイプ | ISSN | |||||
収録物識別子 | 09168508 | |||||
ISSN | ||||||
収録物識別子タイプ | ISSN | |||||
収録物識別子 | 17451337 | |||||
書誌レコードID | ||||||
収録物識別子タイプ | NCID | |||||
収録物識別子 | AA10826239 | |||||
DOI | ||||||
関連タイプ | isIdenticalTo | |||||
識別子タイプ | DOI | |||||
関連識別子 | 10.1587/transfun.e97.a.1728 | |||||
権利 | ||||||
権利情報 | Copyright(c)2014 The Institute of Electronics,Information and Communication Engineers | |||||
権利 | ||||||
権利情報 | Original text is available at https://search.ieice.org/index.html | |||||
著者版フラグ | ||||||
出版タイプ | VoR | |||||
出版タイプResource | http://purl.org/coar/version/c_970fb48d4fbd8a85 | |||||
出版者 | ||||||
出版者 | 一般社団法人 電子情報通信学会 | |||||
キーワード | ||||||
主題Scheme | Other | |||||
主題 | Cosultant-Guided Search | |||||
キーワード | ||||||
主題Scheme | Other | |||||
主題 | Traveling Salesperson Problem | |||||
キーワード | ||||||
主題Scheme | Other | |||||
主題 | Combinatorial Optimization Problem | |||||
キーワード | ||||||
主題Scheme | Other | |||||
主題 | Parallel Algorithm | |||||
キーワード | ||||||
主題Scheme | Other | |||||
主題 | Ant Colony Optimization |