{"updated":"2025-01-22T12:39:57.346777+00:00","links":{},"id":39946,"created":"2025-01-18T23:07:10.647647+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00039946","sets":["1164:3368:3479:3482"]},"path":["3482"],"owner":"1","recid":"39946","title":["航空機・新幹線の最適乗継案内システム"],"pubdate":{"attribute_name":"公開日","attribute_value":"1987-07-15"},"_buckets":{"deposit":"926c6784-07d2-4399-86af-81d83618b5a5"},"_deposit":{"id":"39946","pid":{"type":"depid","value":"39946","revision_id":0},"owners":[1],"status":"published","created_by":1},"item_title":"航空機・新幹線の最適乗継案内システム","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"航空機・新幹線の最適乗継案内システム"},{"subitem_title":"An Optimal Transfer Sequence Scheduling System for the Airline and the Shinkansen Passengers","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"1987-07-15","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"上智大学理工学部"},{"subitem_text_value":"上智大学理工学部"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Department of Electrical and Electronic Engineering, Faculty of Science and Technology, Sophia University","subitem_text_language":"en"},{"subitem_text_value":"Department of Electrical and Electronic Engineering, Faculty of Science and Technology, Sophia University","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"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/39946/files/IPSJ-IS87015002.pdf"},"date":[{"dateType":"Available","dateValue":"1989-07-15"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-IS87015002.pdf","filesize":[{"value":"985.6 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":"38"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"d05483d9-53a5-4e36-bea3-a30af302fff4","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 1987 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"加藤誠巳"},{"creatorName":"高木, 啓三郎"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Masami, Kato","creatorNameLang":"en"},{"creatorName":"Keizaburo, Takagi","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AA11253943","subitem_source_identifier_type":"NCID"}]},"item_4_textarea_12":{"attribute_name":"Notice","attribute_value_mlt":[{"subitem_textarea_value":"SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc."}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_18gh","resourcetype":"technical report"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"わが国における代表的な公共交通機関である航空機並びに新幹線を利用して、与えられた任意の2地点間の時間的な効率の最も良い最適乗継ぎ系列の探索を行うシステムについて述べている。本システムは、第1最適系列のみならず一般に第k最適系列の探索が可能であり、また途中での宿泊を許容した経路の探索を行うことができる。対象としたのは、不定期便・臨時列車を除く国内航空路1041便、新幹線413列車であり、効率的な探索手法ならびに効率的なメモリ使用法の採用により本システムは16ビットのパーソナルコンピュータ上で動作し、計算所要時間は数十通りの最適系列を求める場合でも高々20秒程度である。","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"Recently the airline and the Shinkansen networks which are the representative rapid transportation facilities in Japan have made remarkable progress. The timetables, however, have become so complicated that a casual passenger cannot easily find the optimal sequence of train or flight connections from his origin to his destination. In this paper a system which provides not only the optimal but also the alternative schedules are proposed using a 16-bit personal computer.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"10","bibliographic_titles":[{"bibliographic_title":"情報処理学会研究報告情報システムと社会環境（IS）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"1987-07-15","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"49(1987-IS-015)","bibliographicVolumeNumber":"1987"}]},"relation_version_is_last":true,"weko_creator_id":"1"}}