| Summary: | 碩士 === 中原大學 === 電機工程研究所 === 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
|
|---|
