{"links":{},"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00220648","sets":["6504:11035:11037"]},"path":["11037"],"owner":"44499","recid":"220648","title":["相乗りを考慮したMin-Max型タクシー配車問題"],"pubdate":{"attribute_name":"公開日","attribute_value":"2022-02-17"},"_buckets":{"deposit":"ae4645c2-9eab-449e-b515-b4318c472831"},"_deposit":{"id":"220648","pid":{"type":"depid","value":"220648","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"相乗りを考慮したMin-Max型タクシー配車問題","author_link":["577315","577314","577313"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"相乗りを考慮したMin-Max型タクシー配車問題"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"ソフトウェア科学・工学","subitem_subject_scheme":"Other"}]},"item_type_id":"22","publish_date":"2022-02-17","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/220648/files/IPSJ-Z84-2M-01.pdf","label":"IPSJ-Z84-2M-01.pdf"},"date":[{"dateType":"Available","dateValue":"2022-10-22"}],"format":"application/pdf","filename":"IPSJ-Z84-2M-01.pdf","filesize":[{"value":"589.7 kB"}],"mimetype":"application/pdf","accessrole":"open_date","version_id":"f5eb76c6-4b89-4eb3-8560-b8abb1505eed","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2022 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":"近年、タクシー事業が縮小傾向にある中、タクシー車両を有効活用するために相乗りタクシーが注目されている。相乗りすることにより交通渋滞の緩和、燃料の節約など社会、環境にとって多くのメリットがある。相乗りを考慮したタクシー配車問題における従来の研究では、タクシーの総移動距離を最小化することを目的としていたが、最も長い距離を走ったタクシーの距離（最長経路）を最小化する問題についてはあまり研究されていない。そのため本研究では、最長経路を最小化するために、貪欲法とタブー探索法を組み合わせた手法を提案する。計算機実験の結果、提案手法は従来手法よりも最長経路を削減することができた。","subitem_description_type":"Other"}]},"item_22_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"368","bibliographic_titles":[{"bibliographic_title":"第84回全国大会講演論文集"}],"bibliographicPageStart":"367","bibliographicIssueDates":{"bibliographicIssueDate":"2022-02-17","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"1","bibliographicVolumeNumber":"2022"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"created":"2025-01-19T01:20:40.850586+00:00","updated":"2025-01-19T14:29:12.420097+00:00","id":220648}