{"created":"2025-01-19T01:37:23.154113+00:00","updated":"2025-01-19T09:32:25.600330+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00235736","sets":["6504:11678:11697"]},"path":["11697"],"owner":"44499","recid":"235736","title":["家庭訪問の経路作成に向けた時間枠付き巡回セールスマン問題の拡張"],"pubdate":{"attribute_name":"公開日","attribute_value":"2024-03-01"},"_buckets":{"deposit":"1e185064-7333-4a65-979c-55cfad043434"},"_deposit":{"id":"235736","pid":{"type":"depid","value":"235736","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"家庭訪問の経路作成に向けた時間枠付き巡回セールスマン問題の拡張","author_link":["644205","644204"],"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":"22","publish_date":"2024-03-01","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":"甲南大"}]},"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/235736/files/IPSJ-Z86-1L-06.pdf","label":"IPSJ-Z86-1L-06.pdf"},"date":[{"dateType":"Available","dateValue":"2024-07-03"}],"format":"application/pdf","filename":"IPSJ-Z86-1L-06.pdf","filesize":[{"value":"202.5 kB"}],"mimetype":"application/pdf","accessrole":"open_date","version_id":"273853fd-23c6-4721-8f89-a747abb552e6","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2024 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":[{}]}]},"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":"時間枠付き巡回セールスマン問題とは、いくつかの都市と各都市間の移動時間が与えられたとき、各地点での時間枠を満たしながら、全ての都市を一度ずつ訪問して、最初の都市に戻る巡回路のうち、総移動時間が最小となるものを求める問題である。一方、家庭訪問の経路作成とは、教師が担当学級の全生徒の家庭を訪問期間中に、希望日時を満たしながら訪問する経路のうち、終了時刻が最小になる経路を作成する問題である。本研究では、時間枠付き巡回セールスマン問題を複数日にわたる経路を扱えるように拡張して、家庭訪問の経路作成に対する混合整数計画問題による厳密解法と、焼きなまし法による近似解法を提案する。","subitem_description_type":"Other"}]},"item_22_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"256","bibliographic_titles":[{"bibliographic_title":"第86回全国大会講演論文集"}],"bibliographicPageStart":"255","bibliographicIssueDates":{"bibliographicIssueDate":"2024-03-01","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"1","bibliographicVolumeNumber":"2024"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"id":235736,"links":{}}