{"links":{},"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00235732","sets":["6504:11678:11697"]},"path":["11697"],"owner":"44499","recid":"235732","title":["ソルバーを用いた最長片道ルートの算出に関する考察"],"pubdate":{"attribute_name":"公開日","attribute_value":"2024-03-01"},"_buckets":{"deposit":"26e87920-8085-4b13-af6b-d4669d504b5a"},"_deposit":{"id":"235732","pid":{"type":"depid","value":"235732","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"ソルバーを用いた最長片道ルートの算出に関する考察","author_link":["644193","644194"],"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/235732/files/IPSJ-Z86-1L-02.pdf","label":"IPSJ-Z86-1L-02.pdf"},"date":[{"dateType":"Available","dateValue":"2024-07-03"}],"format":"application/pdf","filename":"IPSJ-Z86-1L-02.pdf","filesize":[{"value":"274.8 kB"}],"mimetype":"application/pdf","accessrole":"open_date","version_id":"5fe1eecc-f55e-4ab1-bea3-2a57110b1b80","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":"日本全国に2万キロ近い路線網を持つJR旅客鉄道各社で発売される片道切符の中で、最も長い一筆書きのルートはどのようなものかを表計算ソフトのソルバー機能を利用して求める。分岐の数が最も少ない四国から始め、北海道、九州、本州の順に考察する。この研究のポイントは、起点と終点をどのように決定するかということと、分岐数が多い場合にどのような制約式を作るかにある。6の字問題というJRの片道切符に関する独特のルールにより、起点と終点を入れ替えることができず、起点は稚内駅、終点は新大村駅であることが示された。切符にはルートの条件があり、実際に発券できると考えられる最長ルートを求めた。","subitem_description_type":"Other"}]},"item_22_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"248","bibliographic_titles":[{"bibliographic_title":"第86回全国大会講演論文集"}],"bibliographicPageStart":"247","bibliographicIssueDates":{"bibliographicIssueDate":"2024-03-01","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"1","bibliographicVolumeNumber":"2024"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"updated":"2025-01-19T09:32:31.348909+00:00","created":"2025-01-19T01:37:22.759784+00:00","id":235732}