Multi-hop Routing Methods for Ridesharing Systems
碩士 === 中原大學 === 資訊工程研究所 === 99 === Ridesharing aims at finding drivers and passengers with the same traveling needs. With ridesharing, a driver can take passengers to their respective destinations and passengers can share the expense. In this way, both kinds of users save their traveling costs, and...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2011
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/85954004097373166391 |
| Summary: | 碩士 === 中原大學 === 資訊工程研究所 === 99 === Ridesharing aims at finding drivers and passengers with the same traveling needs. With ridesharing, a driver can take passengers to their respective destinations and passengers can share the expense. In this way, both kinds of users save their traveling costs, and the number of vehicles on the road is also reduced. Currently most of the ridesharing systems require that the route of a driver must contain the starting point and the destination of a passenger. However, in reality they do not necessarily coincide and accordingly people lose the opportunity of ridesharing. This paper proposes to add a mechanism of multi-hop transfer into the ridesharing system such that the passengers reach their destinations more easily and the available seats on the route are occupied as more as possible. We allow a passenger to choose as the goal between the multi-hop transfer path with the shortest travel time and the path with the lowest amount of payment. In addition to the ways of searching the optimal answer, we also design various strategies for finding the first answer of good quality. They are further integrated into an approach that searches the near-optimal answer with early termination based on the needs of passengers. Experiment results show that the approach after integration can balance between the quality of answer and execution time.
|
|---|