Passenger Search Techniques for Ridesharing Systems
碩士 === 中原大學 === 資訊工程研究所 === 99 === Ridesharing has the great opportunity to reduce the consumption of energy and the emission of harmful gases, and to let people share the traffic costs with others. Most of the current ridesharing systems simply provide a number of candidates for users to choose. Ti...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | en_US |
Published: |
2011
|
Online Access: | http://ndltd.ncl.edu.tw/handle/65965935815250794823 |
id |
ndltd-TW-099CYCU5392034 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-099CYCU53920342015-10-13T20:23:26Z http://ndltd.ncl.edu.tw/handle/65965935815250794823 Passenger Search Techniques for Ridesharing Systems 共乘系統之乘客搜尋技術 Chieh Yen 嚴傑 碩士 中原大學 資訊工程研究所 99 Ridesharing has the great opportunity to reduce the consumption of energy and the emission of harmful gases, and to let people share the traffic costs with others. Most of the current ridesharing systems simply provide a number of candidates for users to choose. Time-consuming negotiation often discourages people from ridesharing. We propose a novel approach that assigns users to form ridesharing groups according to their routes and payments. Under our payment scheme, the passengers who share rides on the same route will equally share the expense with the driver. Given a driver, our goal is to find a group of passengers who will pay the driver the most. For the prompt response to an online system, our approach aims for the near-optimal group, where the available seats on the entire route are occupied by passengers as many as possible. Compared with the previous methods, the experiment results show that our approach incurs a little overhead but obtains answers of better quality, measured by the total saving of the driver, under various parameter settings. Yi-Hung Wu 吳宜鴻 2011 學位論文 ; thesis 58 en_US |
collection |
NDLTD |
language |
en_US |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 中原大學 === 資訊工程研究所 === 99 === Ridesharing has the great opportunity to reduce the consumption of energy and the emission of harmful gases, and to let people share the traffic costs with others. Most of the current ridesharing systems simply provide a number of candidates for users to choose. Time-consuming negotiation often discourages people from ridesharing. We propose a novel approach that assigns users to form ridesharing groups according to their routes and payments. Under our payment scheme, the passengers who share rides on the same route will equally share the expense with the driver. Given a driver, our goal is to find a group of passengers who will pay the driver the most. For the prompt response to an online system, our approach aims for the near-optimal group, where the available seats on the entire route are occupied by passengers as many as possible. Compared with the previous methods, the experiment results show that our approach incurs a little overhead but obtains answers of better quality, measured by the total saving of the driver, under various parameter settings.
|
author2 |
Yi-Hung Wu |
author_facet |
Yi-Hung Wu Chieh Yen 嚴傑 |
author |
Chieh Yen 嚴傑 |
spellingShingle |
Chieh Yen 嚴傑 Passenger Search Techniques for Ridesharing Systems |
author_sort |
Chieh Yen |
title |
Passenger Search Techniques for Ridesharing Systems |
title_short |
Passenger Search Techniques for Ridesharing Systems |
title_full |
Passenger Search Techniques for Ridesharing Systems |
title_fullStr |
Passenger Search Techniques for Ridesharing Systems |
title_full_unstemmed |
Passenger Search Techniques for Ridesharing Systems |
title_sort |
passenger search techniques for ridesharing systems |
publishDate |
2011 |
url |
http://ndltd.ncl.edu.tw/handle/65965935815250794823 |
work_keys_str_mv |
AT chiehyen passengersearchtechniquesforridesharingsystems AT yánjié passengersearchtechniquesforridesharingsystems AT chiehyen gòngchéngxìtǒngzhīchéngkèsōuxúnjìshù AT yánjié gòngchéngxìtǒngzhīchéngkèsōuxúnjìshù |
_version_ |
1718047357240606720 |