WEKO3
アイテム
{"_buckets": {"deposit": "866eac2b-cb4a-47c3-8b68-1b4d17e0b4f7"}, "_deposit": {"created_by": 3, "id": "13898", "owners": [3], "pid": {"revision_id": 0, "type": "depid", "value": "13898"}, "status": "published"}, "_oai": {"id": "oai:kindai.repo.nii.ac.jp:00013898", "sets": ["2262"]}, "author_link": ["25506", "25505"], "item_2_alternative_title_3": {"attribute_name": "その他(別言語等)のタイトル", "attribute_value_mlt": [{"subitem_alternative_title": "Optimum Allocation Method of Taxi Vehicles Using Transportation Problem Method"}]}, "item_2_biblio_info_21": {"attribute_name": "書誌情報", "attribute_value_mlt": [{"bibliographicIssueDates": {"bibliographicIssueDate": "2015-06-01", "bibliographicIssueDateType": "Issued"}, "bibliographicPageEnd": "168", "bibliographicPageStart": "163", "bibliographicVolumeNumber": "6", "bibliographic_titles": [{"bibliographic_title": "近畿大学次世代基盤技術研究所報告"}, {"bibliographic_title": "Kinki University Research Institute of Fundamental Technology for Next Generation", "bibliographic_titleLang": "en"}]}]}, "item_2_date_19": {"attribute_name": "日付 作成日", "attribute_value_mlt": [{"subitem_date_issued_datetime": "2015-07-09", "subitem_date_issued_type": "Created"}]}, "item_2_description_33": {"attribute_name": "抄録", "attribute_value_mlt": [{"subitem_description": "本稿では, タクシー稼働情報に基づき, タクシー待機場所におけるタクシー配置台数を最適化する方法について提案する. タクシー会社の顧客獲得方法は, (1)電話でのタクシー配車依頼, (2)街頭でのタクシー必要者との遭遇に大別される. 前者の課題に対して, 電話でのタクシー配車依頼件数の多い時間帯に多くのタクシーを稼働させる事を狙いに, 単位時間・タクシー1台当たりの電話での配車依頼件数を最小化するタクシー乗務員の勤務の再配置策について研究を行った. 今回は, 後者の課題に対して, タクシー待機場所からタクシー必要者への総走行距離を短縮化する事を狙いに, タクシー待機場所におけるタクシー配置台数の最適化について, 輸送型線形計画問題としてモデル化した研究結果について報告する. 実データを用いた数値実験の結果, タクシーの総走行距離を30%程度削減可能である事がわかった. [Abstract] In this paper, we propose optimum allocation method of standby taxi vehicles at taxi stands using taxi working information. There are two ways for a taxi company to get customers. One is to deliver taxi for a telephone request, and the other is to get customers on street. In previous research we researched rearrangement method of the taxi drivers working hours so as to operate many taxis with many telephone requests for the former method. For the latter method, we formulate this problem as Linear Programming problem in order to minimize the total mileage, fulfilling the taxi demand of all the allocation and maximum number restriction of taxi stands, As a result of numerical calculation, there are some improving points to change the number of standby taxi vehicles at taxi stands, and it turned out that total mileage may be reducible by 30%.", "subitem_description_type": "Abstract"}]}, "item_2_description_34": {"attribute_name": "目次", "attribute_value_mlt": [{"subitem_description": "Ⅲ.論文集", "subitem_description_type": "Other"}]}, "item_2_description_36": {"attribute_name": "内容記述", "attribute_value_mlt": [{"subitem_description": "[再録元]日本システム経営学会誌Vol31,No.2(2014) pp.201-206", "subitem_description_type": "Other"}]}, "item_2_description_37": {"attribute_name": "資源タイプ", "attribute_value_mlt": [{"subitem_description": "Departmental Bulletin Paper", "subitem_description_type": "Other"}]}, "item_2_description_41": {"attribute_name": "フォーマット", "attribute_value_mlt": [{"subitem_description": "application/pdf", "subitem_description_type": "Other"}]}, "item_2_publisher_14": {"attribute_name": "出版者 名前", "attribute_value_mlt": [{"subitem_publisher": "近畿大学次世代基盤技術研究所"}]}, "item_2_source_id_22": {"attribute_name": "ISSN", "attribute_value_mlt": [{"subitem_source_identifier": "21858802", "subitem_source_identifier_type": "ISSN"}]}, "item_2_text_15": {"attribute_name": "出版社 カナ", "attribute_value_mlt": [{"subitem_text_value": "キンキ ダイガク ジセダイ キバン ギジュツ ケンキュウショ"}]}, "item_2_text_16": {"attribute_name": "出版社 ローマ字", "attribute_value_mlt": [{"subitem_text_value": "kinki daigaku jisedai kiban gijyutsu kenkyusho"}]}, "item_2_text_17": {"attribute_name": "出版年(from)", "attribute_value_mlt": [{"subitem_text_value": "2015"}]}, "item_2_text_18": {"attribute_name": "出版年(to)", "attribute_value_mlt": [{"subitem_text_value": "6"}]}, "item_2_text_44": {"attribute_name": "ID(XooNIps)", "attribute_value_mlt": [{"subitem_text_value": "AA12517632-20150600-0163"}]}, "item_2_text_47": {"attribute_name": "日付 記録日(XooNIps)", "attribute_value_mlt": [{"subitem_text_value": "2015-07-09"}]}, "item_2_text_51": {"attribute_name": "最終更新日(XooNIps)", "attribute_value_mlt": [{"subitem_text_value": "Jul 27, 2015 09:00:00"}]}, "item_2_text_53": {"attribute_name": "登録者(XooNIps)", "attribute_value_mlt": [{"subitem_text_value": "kurepo"}]}, "item_2_text_54": {"attribute_name": "閲覧数(XooNIps)", "attribute_value_mlt": [{"subitem_text_value": "89"}]}, "item_2_text_55": {"attribute_name": "ダウンロード数(XooNIps)", "attribute_value_mlt": [{"subitem_text_value": "93"}]}, "item_2_text_56": {"attribute_name": "XooNIps_ITEM_KEY", "attribute_value_mlt": [{"subitem_text_value": "18354"}]}, "item_2_text_7": {"attribute_name": "著者(英)", "attribute_value_mlt": [{"subitem_text_language": "en", "subitem_text_value": "TANIZAKI, Takashi"}, {"subitem_text_language": "en", "subitem_text_value": ", KATAOKA, Takayuki"}]}, "item_2_text_8": {"attribute_name": "著者 所属", "attribute_value_mlt": [{"subitem_text_value": "近畿大学"}, {"subitem_text_value": "近畿大学"}]}, "item_2_text_9": {"attribute_name": "著者所属(翻訳)", "attribute_value_mlt": [{"subitem_text_value": "Kinki University"}, {"subitem_text_value": "Kinki University"}]}, "item_2_version_type_12": {"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": "谷崎, 隆士"}, {"creatorName": "タニザキ, タカシ", "creatorNameLang": "ja-Kana"}], "nameIdentifiers": [{"nameIdentifier": "25505", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "片岡, 隆之"}, {"creatorName": "カタオカ, タカユキ", "creatorNameLang": "ja-Kana"}], "nameIdentifiers": [{"nameIdentifier": "25506", "nameIdentifierScheme": "WEKO"}]}]}, "item_files": {"attribute_name": "ファイル情報", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_date", "date": [{"dateType": "Available", "dateValue": "2016-02-19"}], "displaytype": "detail", "download_preview_message": "", "file_order": 0, "filename": "AA12517632-20150600-0163.pdf", "filesize": [{"value": "20.9 MB"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_free", "mimetype": "application/pdf", "size": 20900000.0, "url": {"label": "AA12517632-20150600-0163.pdf", "url": "https://kindai.repo.nii.ac.jp/record/13898/files/AA12517632-20150600-0163.pdf"}, "version_id": "66e09b9e-827a-44d6-b97f-f5dfae8adda2"}]}, "item_keyword": {"attribute_name": "キーワード", "attribute_value_mlt": [{"subitem_subject": "optimum allocation", "subitem_subject_scheme": "Other"}, {"subitem_subject": "taxi company", "subitem_subject_scheme": "Other"}, {"subitem_subject": "linear programming", "subitem_subject_scheme": "Other"}, {"subitem_subject": "service productivity", "subitem_subject_scheme": "Other"}]}, "item_language": {"attribute_name": "言語", "attribute_value_mlt": [{"subitem_language": "jpn"}]}, "item_resource_type": {"attribute_name": "資源タイプ", "attribute_value_mlt": [{"resourcetype": "departmental bulletin paper", "resourceuri": "http://purl.org/coar/resource_type/c_6501"}]}, "item_title": "〈再録論文〉事例研究 : タクシー待機場所におけるタクシー配置台数の最適化", "item_titles": {"attribute_name": "タイトル", "attribute_value_mlt": [{"subitem_title": "〈再録論文〉事例研究 : タクシー待機場所におけるタクシー配置台数の最適化"}]}, "item_type_id": "2", "owner": "3", "path": ["2262", "3848"], "permalink_uri": "https://kindai.repo.nii.ac.jp/records/13898", "pubdate": {"attribute_name": "公開日", "attribute_value": "2015-07-27"}, "publish_date": "2015-07-27", "publish_status": "0", "recid": "13898", "relation": {}, "relation_version_is_last": true, "title": ["〈再録論文〉事例研究 : タクシー待機場所におけるタクシー配置台数の最適化"], "weko_shared_id": -1}
〈再録論文〉事例研究 : タクシー待機場所におけるタクシー配置台数の最適化
https://kindai.repo.nii.ac.jp/records/13898
https://kindai.repo.nii.ac.jp/records/138985a125c02-a7be-4ff7-a3ee-cc41efcf64b0
名前 / ファイル | ライセンス | アクション |
---|---|---|
AA12517632-20150600-0163.pdf (20.9 MB)
|
|
Item type | ☆紀要論文 / Departmental Bulletin Paper(1) | |||||
---|---|---|---|---|---|---|
公開日 | 2015-07-27 | |||||
タイトル | ||||||
タイトル | 〈再録論文〉事例研究 : タクシー待機場所におけるタクシー配置台数の最適化 | |||||
その他(別言語等)のタイトル | ||||||
その他のタイトル | Optimum Allocation Method of Taxi Vehicles Using Transportation Problem Method | |||||
著者 |
谷崎, 隆士
× 谷崎, 隆士× 片岡, 隆之 |
|||||
言語 | ||||||
言語 | jpn | |||||
キーワード | ||||||
主題 | optimum allocation, taxi company, linear programming, service productivity | |||||
資源タイプ | ||||||
資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||
資源タイプ | departmental bulletin paper | |||||
著者(英) | ||||||
en | ||||||
TANIZAKI, Takashi | ||||||
著者(英) | ||||||
en | ||||||
, KATAOKA, Takayuki | ||||||
著者 所属 | ||||||
近畿大学 | ||||||
著者 所属 | ||||||
近畿大学 | ||||||
著者所属(翻訳) | ||||||
Kinki University | ||||||
著者所属(翻訳) | ||||||
Kinki University | ||||||
版 | ||||||
出版タイプ | VoR | |||||
出版タイプResource | http://purl.org/coar/version/c_970fb48d4fbd8a85 | |||||
出版者 名前 | ||||||
出版者 | 近畿大学次世代基盤技術研究所 | |||||
書誌情報 |
近畿大学次世代基盤技術研究所報告 en : Kinki University Research Institute of Fundamental Technology for Next Generation 巻 6, p. 163-168, 発行日 2015-06-01 |
|||||
ISSN | ||||||
収録物識別子タイプ | ISSN | |||||
収録物識別子 | 21858802 | |||||
抄録 | ||||||
内容記述タイプ | Abstract | |||||
内容記述 | 本稿では, タクシー稼働情報に基づき, タクシー待機場所におけるタクシー配置台数を最適化する方法について提案する. タクシー会社の顧客獲得方法は, (1)電話でのタクシー配車依頼, (2)街頭でのタクシー必要者との遭遇に大別される. 前者の課題に対して, 電話でのタクシー配車依頼件数の多い時間帯に多くのタクシーを稼働させる事を狙いに, 単位時間・タクシー1台当たりの電話での配車依頼件数を最小化するタクシー乗務員の勤務の再配置策について研究を行った. 今回は, 後者の課題に対して, タクシー待機場所からタクシー必要者への総走行距離を短縮化する事を狙いに, タクシー待機場所におけるタクシー配置台数の最適化について, 輸送型線形計画問題としてモデル化した研究結果について報告する. 実データを用いた数値実験の結果, タクシーの総走行距離を30%程度削減可能である事がわかった. [Abstract] In this paper, we propose optimum allocation method of standby taxi vehicles at taxi stands using taxi working information. There are two ways for a taxi company to get customers. One is to deliver taxi for a telephone request, and the other is to get customers on street. In previous research we researched rearrangement method of the taxi drivers working hours so as to operate many taxis with many telephone requests for the former method. For the latter method, we formulate this problem as Linear Programming problem in order to minimize the total mileage, fulfilling the taxi demand of all the allocation and maximum number restriction of taxi stands, As a result of numerical calculation, there are some improving points to change the number of standby taxi vehicles at taxi stands, and it turned out that total mileage may be reducible by 30%. | |||||
目次 | ||||||
内容記述タイプ | Other | |||||
内容記述 | Ⅲ.論文集 | |||||
内容記述 | ||||||
内容記述タイプ | Other | |||||
内容記述 | [再録元]日本システム経営学会誌Vol31,No.2(2014) pp.201-206 | |||||
フォーマット | ||||||
内容記述タイプ | Other | |||||
内容記述 | application/pdf |