東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Dynamic Rideshare Optimized Matching...

Ghoseiri, Keivan.

FindBook

Google Book

Amazon

博客來

Dynamic Rideshare Optimized Matching problem.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Dynamic Rideshare Optimized Matching problem./
作者:	Ghoseiri, Keivan.
面頁冊數:	248 p.
附註:	Source: Dissertation Abstracts International, Volume: 74-03(E), Section: A.
Contained By:	Dissertation Abstracts International74-03A(E).
標題:	Transportation. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3543179
ISBN:	9781267718457

Dynamic Rideshare Optimized Matching problem.
Ghoseiri, Keivan.

Dynamic Rideshare Optimized Matching problem. - 248 p.

Source: Dissertation Abstracts International, Volume: 74-03(E), Section: A.

Thesis (Ph.D.)--University of Maryland, College Park, 2012.

This item is not available from ProQuest Dissertations & Theses.

This dissertation develops a Dynamic Rideshare Optimized Matching (DROM) model and solution that is aimed at identifying suitable matches between passengers requesting rideshare services with appropriate drivers available to carpool for credits and HOV lane privileges. DROM receives passengers and drivers' information and preferences continuously over time and maximizes the overall system performance subject to ride availability, capacity, rider and driver time window constraints, and detour and relocation distances while considering users' preferences. The research develops a spatial, temporal, and hierarchical decomposition solution strategy that leads to the heuristic solution procedure. Three-Spherical Heuristic Decomposition Model (TSHDM). Quality and validity tests for the TSHDM algorithm are done by comparison of results between the exact and implemented algorithm solutions and major sensitivity analyses using the technique of Regression Analysis on all of the related parameters in the model are conducted to thoroughly investigate the properties of the proposed model and solution algorithm. A case study is constructed to analyze the model and TSHDM behaviors on a road network of northwest metropolitan area of Baltimore city. The study shows that however DROM is a very complicated and challenging problem from both mathematical formulation and solution algorithm perspectives, it is possible to implement a dynamic rideshare system using appropriate technical tools and social networking media. Major sensitivity analysis conducted on several parameters and variables affecting the model shows that most influencing factors for the rate of success in the rideshare system are, in order of importance: number of participating drivers, number of stops, area size, and number of participating riders. The study also shows rate of success for the rideshare system is highly dependent to the matched routes connecting directly points of origin and destination for participating riders and also increasing the number of connections from one to two which requires two consecutive change of rides for a rider has the least impact on the rate of success.

ISBN: 9781267718457Subjects--Topical Terms:

555912
Transportation.

Dynamic Rideshare Optimized Matching problem.
LDR:03125nmm a2200301 4500 001 2073126
005 20160914074009.5
008 170521s2012 ||||||||||||||||| ||eng d
020 $a 9781267718457
035 $a (MiAaPQ)AAI3543179
035 $a AAI3543179
040 $a MiAaPQ $c MiAaPQ
100 1 $a Ghoseiri, Keivan. $3 3188355
245 1 0 $a Dynamic Rideshare Optimized Matching problem.
300 $a 248 p.
500 $a Source: Dissertation Abstracts International, Volume: 74-03(E), Section: A.
500 $a Adviser: Ali Haghani.
502 $a Thesis (Ph.D.)--University of Maryland, College Park, 2012.
506 $a This item is not available from ProQuest Dissertations & Theses.
520 $a This dissertation develops a Dynamic Rideshare Optimized Matching (DROM) model and solution that is aimed at identifying suitable matches between passengers requesting rideshare services with appropriate drivers available to carpool for credits and HOV lane privileges. DROM receives passengers and drivers' information and preferences continuously over time and maximizes the overall system performance subject to ride availability, capacity, rider and driver time window constraints, and detour and relocation distances while considering users' preferences. The research develops a spatial, temporal, and hierarchical decomposition solution strategy that leads to the heuristic solution procedure. Three-Spherical Heuristic Decomposition Model (TSHDM). Quality and validity tests for the TSHDM algorithm are done by comparison of results between the exact and implemented algorithm solutions and major sensitivity analyses using the technique of Regression Analysis on all of the related parameters in the model are conducted to thoroughly investigate the properties of the proposed model and solution algorithm. A case study is constructed to analyze the model and TSHDM behaviors on a road network of northwest metropolitan area of Baltimore city. The study shows that however DROM is a very complicated and challenging problem from both mathematical formulation and solution algorithm perspectives, it is possible to implement a dynamic rideshare system using appropriate technical tools and social networking media. Major sensitivity analysis conducted on several parameters and variables affecting the model shows that most influencing factors for the rate of success in the rideshare system are, in order of importance: number of participating drivers, number of stops, area size, and number of participating riders. The study also shows rate of success for the rideshare system is highly dependent to the matched routes connecting directly points of origin and destination for participating riders and also increasing the number of connections from one to two which requires two consecutive change of rides for a rider has the least impact on the rate of success.
590 $a School code: 0117.
650 4 $a Transportation. $3 555912
650 4 $a Operations research. $3 547123
650 4 $a Systems science. $3 3168411
690 $a 0709
690 $a 0796
690 $a 0790
710 2 $a University of Maryland, College Park. $b Civil Engineering. $3 1025664
773 0 $t Dissertation Abstracts International $g 74-03A(E).
790 $a 0117
791 $a Ph.D.
792 $a 2012
793 $a English
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3543179