A route planning system for people transportation with multiple drivers
碩士 === 中原大學 === 電機工程研究所 === 106 === In organizing outdoor activities, sometimes there will be arrangements for car sharing. How to arrange this multi-driver and passengers path planning problem such that all people can reach their destination in the shortest time is a troublesome and time-consuming...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | zh-TW |
Published: |
2018
|
Online Access: | http://ndltd.ncl.edu.tw/handle/s75s2h |
id |
ndltd-TW-106CYCU5442003 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-106CYCU54420032019-05-16T00:15:32Z http://ndltd.ncl.edu.tw/handle/s75s2h A route planning system for people transportation with multiple drivers 基於多人駕駛之人員交通路線規劃系統 Chuen-Ping Wang 王淳平 碩士 中原大學 電機工程研究所 106 In organizing outdoor activities, sometimes there will be arrangements for car sharing. How to arrange this multi-driver and passengers path planning problem such that all people can reach their destination in the shortest time is a troublesome and time-consuming job. In this thesis, we focus on this multi-driver and passengers path planning problem. Giving all people''s addresses and the destination, we propose an appropriate algorithm to find the best arrangement which uses Google Maps API to calculate the distances and driving times. We also generate the road map for each driver and the corresponding passengers. When the number of people increase, the calculations of best arrangement can lead to a tremendous amount of computation. In such a case, we also propose a simplified algorithm that achieves nearly the best performance with only a small amount of computation Jia-Yin Wang 王佳盈 2018 學位論文 ; thesis 51 zh-TW |
collection |
NDLTD |
language |
zh-TW |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 中原大學 === 電機工程研究所 === 106 === In organizing outdoor activities, sometimes there will be arrangements for car sharing. How to arrange this multi-driver and passengers path planning problem such that all people can reach their destination in the shortest time is a troublesome and time-consuming job. In this thesis, we focus on this multi-driver and passengers path planning problem. Giving all people''s addresses and the destination, we propose an appropriate algorithm to find the best arrangement which uses Google Maps API to calculate the distances and driving times. We also generate the road map for each driver and the corresponding passengers. When the number of people increase, the calculations of best arrangement can lead to a tremendous amount of computation. In such a case, we also propose a simplified algorithm that achieves nearly the best performance with only a small amount of computation
|
author2 |
Jia-Yin Wang |
author_facet |
Jia-Yin Wang Chuen-Ping Wang 王淳平 |
author |
Chuen-Ping Wang 王淳平 |
spellingShingle |
Chuen-Ping Wang 王淳平 A route planning system for people transportation with multiple drivers |
author_sort |
Chuen-Ping Wang |
title |
A route planning system for people transportation with multiple drivers |
title_short |
A route planning system for people transportation with multiple drivers |
title_full |
A route planning system for people transportation with multiple drivers |
title_fullStr |
A route planning system for people transportation with multiple drivers |
title_full_unstemmed |
A route planning system for people transportation with multiple drivers |
title_sort |
route planning system for people transportation with multiple drivers |
publishDate |
2018 |
url |
http://ndltd.ncl.edu.tw/handle/s75s2h |
work_keys_str_mv |
AT chuenpingwang arouteplanningsystemforpeopletransportationwithmultipledrivers AT wángchúnpíng arouteplanningsystemforpeopletransportationwithmultipledrivers AT chuenpingwang jīyúduōrénjiàshǐzhīrényuánjiāotōnglùxiànguīhuàxìtǒng AT wángchúnpíng jīyúduōrénjiàshǐzhīrényuánjiāotōnglùxiànguīhuàxìtǒng AT chuenpingwang routeplanningsystemforpeopletransportationwithmultipledrivers AT wángchúnpíng routeplanningsystemforpeopletransportationwithmultipledrivers |
_version_ |
1719162845029990400 |