You do not have permission to edit this page, for the following reason:

You are not allowed to execute the action you have requested.


You can view and copy the source of this page.

x
 
1
2
== Abstract ==
3
4
Shared autonomous taxi systems (SATS) are being regarded as a promising means of improving travel flexibility. Each shared autonomous taxi (SAT) requires very precise traffic information to independently and accurately select its route. In this study, taxis were replaced with ride-sharing autonomous vehicles, and the potential benefits of utilizing collected travel-time information for path finding in the new taxi system examined. Specifically, four categories of available SATs for every taxi request were considered: currently empty, expected-empty, currently sharable, and expected-sharable. Two simulation scenarios—one based on historical traffic information and the other based on real-time traffic information—were developed to examine the performance of information use in a SATS. Interestingly, in the historical traffic information-based scenario, the mean travel time for taxi requests and private vehicle users decreased significantly in the first several simulation days and then remained stable as the number of simulation days increased. Conversely, in the real-time information-based scenario, the mean travel time was constant. As the SAT fleet size increased, the total travel time for taxi requests significantly decreased, and convergence occurred earlier in the historical information-based scenario. The results demonstrate that historical traffic information is better than real-time traffic information for path finding in SATS.
5
6
Document type: Article
7
8
== Full document ==
9
<pdf>Media:Draft_Content_413487911-beopen1008-6134-document.pdf</pdf>
10
11
12
== Original document ==
13
14
The different versions of the original document can be found in:
15
16
* [http://downloads.hindawi.com/journals/jat/2018/8919721.pdf http://downloads.hindawi.com/journals/jat/2018/8919721.pdf] under the license https://creativecommons.org/licenses/by
17
18
* [http://dx.doi.org/10.1155/2018/8919721 http://dx.doi.org/10.1155/2018/8919721] under the license cc-by
19
20
* [http://downloads.hindawi.com/journals/jat/2018/8919721.pdf http://downloads.hindawi.com/journals/jat/2018/8919721.pdf],
21
: [http://downloads.hindawi.com/journals/jat/2018/8919721.xml http://downloads.hindawi.com/journals/jat/2018/8919721.xml],
22
: [http://dx.doi.org/10.1155/2018/8919721 http://dx.doi.org/10.1155/2018/8919721] under the license http://creativecommons.org/licenses/by/4.0
23
24
* [http://dx.doi.org/10.1155/2018/8919721 http://dx.doi.org/10.1155/2018/8919721],
25
: [https://doaj.org/toc/0197-6729 https://doaj.org/toc/0197-6729],
26
: [https://doaj.org/toc/2042-3195 https://doaj.org/toc/2042-3195] under the license http://creativecommons.org/licenses/by/4.0/
27
28
* [https://www.hindawi.com/journals/jat/2018/8919721 https://www.hindawi.com/journals/jat/2018/8919721],
29
: [http://downloads.hindawi.com/journals/jat/2018/8919721.pdf http://downloads.hindawi.com/journals/jat/2018/8919721.pdf],
30
: [https://academic.microsoft.com/#/detail/2885531863 https://academic.microsoft.com/#/detail/2885531863]
31

Return to 238,295i.

Back to Top

Document information

Published on 01/01/2018

Volume 2018, 2018
DOI: 10.1155/2018/8919721
Licence: Other

Document Score

0

Views 0
Recommendations 0

Share this document

claim authorship

Are you one of the authors of this document?