TW201248540A - A fare of vehicle agreement system and method thereof - Google Patents

A fare of vehicle agreement system and method thereof Download PDF

Info

Publication number
TW201248540A
TW201248540A TW100118885A TW100118885A TW201248540A TW 201248540 A TW201248540 A TW 201248540A TW 100118885 A TW100118885 A TW 100118885A TW 100118885 A TW100118885 A TW 100118885A TW 201248540 A TW201248540 A TW 201248540A
Authority
TW
Taiwan
Prior art keywords
price
passenger
vehicle
communication device
server
Prior art date
Application number
TW100118885A
Other languages
Chinese (zh)
Inventor
Jen-Chang Wu
Original Assignee
Shih Pi Ta Technology Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Shih Pi Ta Technology Ltd filed Critical Shih Pi Ta Technology Ltd
Priority to TW100118885A priority Critical patent/TW201248540A/en
Publication of TW201248540A publication Critical patent/TW201248540A/en

Links

Landscapes

  • Traffic Control Systems (AREA)

Abstract

A fare of a vehicle agreement method to dispatch a car for a client is disclosed. The client has a first communication apparatus. A second communication apparatus is disposed in the car. The first communication apparatus and the second communication apparatus couple with a dispatching apparatus for set a first price and a second price respectively. the dispatching apparatus sends the second price to the second communication apparatus when the second price is less than or equal to the first price. A response is sent to the dispatching apparatus from the second communication apparatus based on the first price. The dispatching apparatus dispatches the car to take the client based on the response.

Description

201248540 六、發明說明·· 【發明所屬之技術領域】 是有關於— : = :由遣系統及其操作方法’且特別 惠合意之派⑽統及其操作=機進行車資或車資折扣優 【先前技術】 其传= Γ遣系統中’以計程車派遣系統為例, ㈣、由#車業者(例如車隊)提供個人派車服務,可供乘 或網路來叫車。而在計程車之行車控制中叫 户技骑車戒息後,派車員使用無線電廣播方式聯絡所有正 ^㈣派車中心、錢的計程車駕馱,由派車員廣播搭車地 點,並由最短到達時間開始詢問,由駕駛自行評估是否可 在所詢問要求的到達時間到辆搭車地點,並主動回 覆載客意願,而選定一台計程車至搭乘地點載客。近年來, 亦有计程車隊發展出在車隊所屬之全部計程車上皆配置衛 星定位系統的方式,並結合行動通訊網路(如:GSM)將行 車位置座標傳送給行車控制中心,再由行車控制中心伺服 器來記錄車程資料,因此在接收到叫車訊息以取得乘客之 搭乘地點資訊後,係可藉由各車輕的行車位置來選定指派 並通知距離搭乘地點最近的車輛前往載客、或選定詢問最 近的數輛車之最短可到達時間來決定派那一部車前往。 然而,由於習知計程車派遣系統,乘客在搭乘計程車 刖並無法得知哪一台計程車刖在服務,因此,即使計程車 司機基於本身之狀況,例如’因為長時間無人搭乘而有意 201248540 降價進行服務’亦無法事前讓有意搭乘 息,而增加其載客量,且對於乘客而言,亦僅此訊 資進行搭乘,並無法享受到優惠。 犯以全額車 因此’如何讓司機可依本身狀況來 :度,並與乘客間預先依此達成搭乘協議,即=;、: 務中一追求之目標。 卩成為派遣服 【發明内容】 明之—目的即是在提供—種讓司機可依本身㈣ 或料條件來決定車f及其_幅度之方法料置身狀况 本^之另—目的即是在提供—種讓乘 車月”先與司機就車資達成協議之方法與裝置。十程 用於係在提供-種車資媒合方法,係 該乘客就該次‘遣:::::載-乘客前,由該司機與 機==二乘客具有-第-通訊裝置,該司 裝置與該派車二服%:通法至少包含:讓該第-通訊 接以他器通訊連 小於或等於該第一價第二價錢;當該第二價錢 發出一回庫僂、、1 據第一價錢,該第二通訊裝置 車飼服器二::載車:^ 在實知例中,該第一通訊展置為一行動電話、-電 201248540 話、一手持式裝置或一電腦,該第二通訊裝置為一車載模 組。 、 在一實施例中,該第一價錢以及該第二價錢為對應一 路線之固定價錢或是一折扣優惠。 f一實施例中,該方法更包括:當該第二價錢大於該 第一價錢時,該派車伺服器要求該第一通訊裝置重新設定 一第一價錢。 在一實施例中,當該派車伺服器將該第一價錢傳送給 該第二通訊裝置時’更傳送該乘客欲前往之目的地。 在一實施例中,該派車伺服器派遣該司機承載該乘 客,更包括:派遣與該乘客最近之司機承載該乘客,或派 遣最短時間到達該乘客位置之司機承載該乘客。 根據本發明之另—態樣係在提供—種車資媒合系統, 係建置於-派遣中心中,用在派遣_司機承載-乘客前, 提供該司機與該乘客就該次派遣服務之車資進行媒合,其 中該乘客具有—第—通訊裝置,該司機具有—第二通訊裝 置,該系統至少包含:―競·服器;-應答飼服器,鵪 接該競價寵H,其+該第—通訊裝置可與該應答伺服器 通訊連接’以於該競價伺服ϋ上設H價錢,以及該 第二通訊裝置可與該應答伺服器通訊連接,以於該該競價 飼服器上設定n錢;以及—資料庫健H,搞接該 f答伺服器,用以儲存該第—價錢以及該第二價錢,其中 當該第二價錢小於或等於該第—價錢時,該競價舰器將 該第-價錢傳送給該第三通訊裝置,並根據該第二通訊裝 置發出之一回應,派遣該司機承載該乘客。 201248540 在一實施例中,該應答伺服器,更包括:一互動式語 音應答伺服器以及一網路服務伺服器,其中該互動式語音 應答伺服器提供第一通訊裝置以及該第二通訊裝置以互動 語音之方式輸入該第一價錢以及該第二價錢,該網路服務 伺服器提供第一通訊裝置以及該第二通訊裝置以網路連線 之方式與該網路服務飼服器之網頁上輸入該第一價錢以及 該第二價錢。 在一實施例中,該第一通訊裝置為一行動電話、一電 話、一手持式裝置或一電腦,該第二通訊裝置為一車載模 組。 在一實施例中,更包括一無線基地台,該第二通訊裝 置透過該無線基地台與該競價伺服器耦接。 在一實施例中’當該第二價錢大於該第一價錢時,該 競價伺服器透過該應答伺服器’要求該第一通訊裝置重新 設定一第一價錢。 在一實施例中,該第一價錢以及該第二價錢為對應一 路線之固定價錢或是一折扣優惠。 在一實施例中,當該競價伺服器將該第一價錢傳送給 該第二通訊裝置時,更傳送該乘客欲前往之目的地。 在一實施例中,該競價伺服器派遣與該乘客最近之司 機承載該乘客,或派遣最短時間到達該乘客位置之司機承 載該乘客。 綜合上述所言,由於車資的價格決定是浮動的,可由 司機主動依據本身的條件以及當時的狀態決定是否接受乘 客k出之折扣優惠或固定價格,而非僅能被動接受固定之 201248540 折扣優惠,因此可提昇司機承接意願,而對乘客而言,若 不趕時間,可靜候一司機願以較優惠之價格進行服務,而 不必總是付出全額之乘車代價,而提昇其搭乘之意願。因 此,本發明之方法與裝置可達到乘客與司機雙赢之目標。 【實施方式】 參閱第1圖所示為根據本發明一實施例之車資媒合流 程圖。當本流程開始時,為了讓司機與乘客間可先就車資 或折扣優惠進行合意,因此本發明於步驟101,會先讓乘 客與司機就其可接收之車資或折扣優惠進行設定。在一實 施例中,每一台計程車上之車載模組都有一特定的識別號 碼,因此司機可將車載模組的識別號碼作為其識別號碼, 並依此識別號碼於派遣中心進行設定,換言之,當設定完 成後,依此識別號碼,派遣中心即可得知對應司機其設定 之車資或折扣優惠,並依此進行派遣媒合。而司機可透過 車載模組、互動式語音應答(Interactive voice response,IVR) 或是由派遣中心之設定人員以人工輸入之方式於終端機上 進行定。另一方面,乘客可以透過互動式語音應答系統打 電話到派遣中心進行設定,或是乘客可以透過電話轉接到 派遣中心之設定人員以人工輸入之方式於終端機上進行設 定,或是透過行動裝置或電腦以有線或無線之方式網路連 線到派遣中心於設定網頁上直接進行設定,其中,一乘客 可簡單設定固定的價格(如100元),或是固定的折扣優惠 數字(如7折),而若是常搭計程車,一乘客亦可根據計程 車之需求程度來進行優惠時段設定,例如:7:00〜9:30之上 8 201248540 班時段,計程車需求程度高,因此僅先以折扣優惠7折進 行媒合,若媒合不成,即直接改以無折扣之方式進行媒合, 而於9:30〜17 : 00非上下班時段,計程車需求程度降低, 則可以漸進之方式進行媒合,先以折扣優惠7折進行媒 合,若媒合不成,再以8折、9折至無折扣漸進進行媒合。 而在另一實施例中,一乘客亦可根據天候狀況造成計程車 需求程度不同來進行時段設定,例如,下雨天,先以折扣 優惠7折進行媒合,若媒合不成,即直接改以無折扣之方 式進行媒合。然,值得注意的是,乘客或司機之設定方式 並不以上述之方法為限。而乘客之上述設定,在一實施例 中,可依乘客之來電號碼事先儲存於派遣中心之乘客資料 庫伺服器内,等到乘客叫車時,直接從乘客資料庫伺服器 内抓取,而不需在行設定。而在另一實施例中,上述之設 定亦可於叫車時根據當時之狀況再行設定,而不預先儲存 於乘客資料庫伺服器内。 當設定完成後,乘客若有搭車需求時,其即可於步驟 102連線派遣中心要求叫車服務。而叫車之方法,可透過 互動式語音應答系統進行叫車、或打電話到派遣中心由服 務人員進行叫車、或是透過行動裝置或電腦以有線或無線 之方式網路連線到派遣中心進行叫車。 此時,於步驟103,會根據乘客之來電號碼於乘客資 料庫伺服器内進行搜尋,以找尋該乘客對應之車資或折扣 優惠設定。並於步驟104,檢測該乘客是否有設定固定價 格或起始固定折扣優惠。若乘客並未設定固定價格,且對 現在時段亦未特殊設定起始之折扣優惠,則於步驟105, 201248540 優惠’在一實施例令,可提—音 J社使用者選擇,如:可接受折扣優惠 媒: 按⑴;可接受折扣優惠8折進行媒合,按(2進=“ 折扣優惠9折進行媒合,按(). ,了接又 媒合,按⑷I ¥(3),可料缺扣優惠進行 載 ,辨。在一實施例中,當本發明之流程收== 復土、, 組上,由司機決定是否依址新知 進行t接。而在另—實施例中,亦可只挑選單一車載 模組進行傳送。雖然折扣優A魏到料車載_上,t ::仍然可以選擇是否承接,換言之,刪有最後:決 優惠:=在斷是否有司機承諾依此折扣 备此時間週期终了時’仍未有司機 = =會==任:司機願以此折扣優惠承接乘客:依: 惠,以提昇司機之承接音:再:詢:乘客:否調整折扣優 選單供使用者選擇,如實施例中,可提供語音 按⑴;調整折扣優惠為:為=行媒合’ 扣優惠為無折扣優惠進行媒人:丁;; * ’调整折 折扣優惠,而不再詢問這個區,所搓合的 ]聚客。此外,在另一實施例中,本 201248540 發明之流程亦可根據乘客於步驟101設定之優惠時段進行 調整,例^於7:〇〇〜9:30之上班時段,先以折扣優惠7折進 行媒合,若媒合不成,即直接改以無折扣之方式進行媒合, 而不再次進行詢問乘客。當折扣優惠難完成後,本流程 會再次執行步冑106’將此起始折扣優惠訊息傳送至鄰近 車載模組’供司機決定是^依此新設定之折扣優惠進行承 接。上述之步驟106至步驟⑽會重複進行直至完成價格 之撮合。 此外’若於步驟107中判斷有司機承諾依此折扣優惠 ,行承接時,本發明之流程會執行步㉟1G9,其中若僅為 單-司機應答願意承接’騎知該司機前往載客,而若有 f數個司機應答願意承接,則由距離搭乘地點最近的車輛 則往載客,或由最短時間可到達搭乘地點的車輛前往載 客’或派遣在職域第—個報班的司機承载該乘客。 另一方面 右於步驟104,判斷出該乘客有設定固定 本絲會於步驟m,將此狀價格與使用此固定 ^欲前狀目的傳送轉近車載模組,由司機決定是否 =固疋&格進行轉,其中可依距離遠近將此複數個車 便:辨。而在"施例中,亦可只 钱模組進仃傳送’然司機仍然可否承 接換吕之,司機具有最後之決定權。 格進行二T本?程會判斷是否有司機承諾依此固定價 此時間週貫施例中,例如可設定—時間週期,當 程會判斷盘:時,仍未有司機透過車载模組應答,本流 马無任何司機願以此蚊價格承接乘客,依此將 201248540 執行步驟112,本流程會再次詢問乘客是否調整固定價格, 以提昇司機之承接意願。在一實施例中,可根據路程之遠 近以及司機可能願意承接之固定價格給乘客參考,以提昇 撮合之機會。當固定價格調整完成後,本流程會再次執行 步驟110,將此固定價格訊息傳送至鄰近車載模組,供司 機決定是否依此新設定之固定價格進行承接。上述之步驟 110至步驟112會重複進行直至完成價格之撮合。 另一方,面若於步驟111中判斷有司機承諾依此折固 定價格進行承接時,本發明之流程會執行步驟113,其中 若僅為單一司機應答願意承接,則通知該司機前往載客, 而若有複數個司機應答願意承接,則由距離搭乘地點最近 的車輛前往載客,或由最短時間可到達搭乘地點的車輛前 往載客。最後於步驟114結束此流程。 根據上述之流程,由於車資的價格決定是浮動的,可 由司機主動依據本身的條件以及當時的狀態決定是否接受 乘客提出之折扣優惠或固定價格,而非僅能被動接受固定 之折扣優惠,因此可提昇司機承接意願,而對乘客而言, 若不趕時間,可靜候一司機願以較優惠之價格進行服務, 而不必總是付出全額之乘車代價,而提昇其搭乘之意願。 因此,本發明之方法可達到乘客與司機雙赢之目標。 參閱第2圖所示為一乘客利用本發明之流程進行折扣 優惠叫車之一較佳實施例。於本實施例中,乘客之設定是 於進線叫車時再為決定,而司機就其可接收之車資或折扣 優惠已先進行設定。當設定完成後,派遣中心為進行車隊 之折扣優惠管理,於一實施例中,可於司機識別號碼前增 201248540 設一分類代碼,並依此分類代碼傳送對應乘客之設定折扣 優惠,例如:願意接受折扣優惠7折之司機,其識別號碼 前增設一分類代碼「7」;願意接受折扣優惠8折之司機, 其識別號碼前增設一分類代碼「8」;願意接受折扣優惠9 折之司機,其識別號碼前增設一分類代碼「9」;而不願意 接受折扣優惠之司機,其識別號碼前增設一分類代碼 「10」。依此識別號碼,派遣中心即可得知對應司機其設定 之車資或折扣優惠,並依此進行派遣媒合。 於步驟2(Π,乘客進線叫車。並於步驟202,乘客可以 透過互動式語音應答系統打,或是透過電話轉接到派遣中 心之設定人員,或是透過行動裝置或電腦以有線或無線之 方式網路連線到派遣中心,來輸入其上車地點以及設定折 扣優惠。當設定完成後,派遣中心即會根據乘客之設定進 行最近地點符合折扣優惠之空車來進行派遣。在一實施例 中,若乘客設定之折扣優惠為7折,此時派遣中心於步驟 2 0 3會搜尋在此最近地點區域中識別號碼前有一分類代碼 為「7」之司機。若乘客設定之折扣優惠為8折,此時接受 折扣優惠為7折之司機亦會接受乘客設定之折扣優惠8 折,因此派遣中心於步驟204會搜尋在此最近地點區域中 具有分類代碼小於或等於「8」之司機。若乘客設定之折扣 優惠為9折,此時接受折扣優惠為7折以及8折之司機亦 會接受乘客設定之折扣優惠9折,因此派遣中心於步驟205 會搜尋在此最近地點區域中具有分類代碼小於或等於「9」 之司機。若乘客設定之折扣優惠為無折扣,此時接受折扣 優惠為7折、8折以及9折之司機亦會接受乘客設定之無 13 201248540 折扣優惠,因此派遣中心於步驟206會搜尋在此 • 區域中所有分類代碼之司機。 ‘,, . 接著於步驟207將此乘客設定之折扣優惠訊息以及搭 載地點傳送給至對應之車載模組。並於步驟2〇8了由司^ 決定是否依此折扣優惠進行承接,其中若僅為單一司機應 答願意承接,則通知該司機前往載客,而若有複數個司& 應答願意承接,則由距離搭乘地點最近的車輛前往载客, 或由最短時間可到達搭乘地點的車輛前往载客,或派遣在 該區域第一個報班的司機承載該乘客。若無任何司機願以 此折扣優惠承接乘客,將執行步驟210,回報在此折扣優 惠下叫車不成功,會再次執行步驟2〇2詢問乘客是否調整 折扣優惠,以提昇司機之承接意願。此外,若有司機承諾 依此折扣優惠進行承接時,本發明之流程會執行步驟1〇9\ 其中若僅為單-司機應答願意承接,將執行步驟2〇9,回 報在此折扣優惠下叫車成功,並將對應之車號告知乘客。 第3圖所示為根據本發明一實施例用以執行本發明車 資媒合之系統圖。本發明之系統包括:一互動式語音應答 (Interactive voice response,IVR)伺服器 3〇卜一網路服務伺 服器302、一資料庫伺服器303、一競價伺服器3〇4以及一 客服人員終端機305。其中互動式語音應答(Imeractive voice response,NR)伺服器3〇1提供乘客透過行動電話 308或-般電話3〇9連線來進行叫車服務。網路服務词服 器3〇2提供乘客透過手持式衷置⑽或電腦311經由網路 .312連線來進行叫車服務。客服人員終端機305連接互動 . 式語音應答伺服11 3G卜提供乘客透過派遣中心之服務人 14 201248540 員進行人工叫車服務。資料庫伺服器303,儲存有乘客以 及司機設定之車資或折扣優惠,玎根據乘客之來電號媽搜 尋該乘客設定之車資或折扣優惠,並對應司機設定之車資 或折扣優惠。競價伺服器304,耦接該乘客資料庫飼服器 303,並可透過無線基地台307耦接複數個車载模組306, 其中競價伺服器304跟據乘客設定之車資或折扣優惠以及 上車地點透過無線基地台307傳送給對應司機之車載模組 306,例如:若乘客設定之折扣優惠為7折,此時競價伺服 器304會搜尋在此最近地點區域中接受折扣優惠為7折之 車載模組306進行傳送。若乘客設定之折扣優惠為8折, 此時競價伺服器304會搜尋在此最近地點區域中接受折扣 優惠為7折和8折之車載模組306進行傳送,依此類推 而接收到訊息之司機可決定是否依此折扣優惠進行承接, 若願意可經由其車載模組3〇6透過無線基地台3〇7將願以 承接之訊息傳送給競價伺服器3〇4。其中若僅為單一司 應答願意承接’職價他^ 3G4心 而若有複數個司機應答願意承接,則競價词:Γ二根 -車輛前往載客。 到祕乘地點的時間選擇其中 ,冰&上述所言 由司機主動依據本身的條件以是浮動的’可 定,而非僅為單一固定之資費,::的供需狀態來加以決 並提昇司機承接意願,且對乘客而士更能切合實際裝況, 靜候-司機願以較優惠之價 έ ’若不趕時間,亦可 目的。 丁服務,達到節省開支之 201248540 雖然本發明已以實施方式揭露如上,然其並非用以限 定本發明,任何熟習此技藝者,在不脫離本發明之精神和 範圍内,當可作各種之更動與潤飾,因此本發明之保護範 圍當視後附之申請專利範圍所界定者為準。 【圖式簡單說明】 為讓本發明之上述和其他目的、特徵、優點與實施例 能更明顯易懂,所附圖式之說明如下: 第1圖所示為根據本發明一實施例之車資媒合流程 圖。 第2圖所示為一乘客利用本發明之流程進行折扣優惠 叫車之一較佳實施例。 第3圖所示為根據本發明一實施例用以執行本發明車 資媒合之系統圖。 【主要元件符號說明】 101〜114步驟 201〜210步驟 301互動式語音應答伺服器 302網路服務伺服器 303乘客資料庫伺服器 304競價伺服器 305客服人員終端機 306車載模組 307無線基地台 308行動電話 16 201248540 309 —般電話 310手持式裝置 311電腦 312網路201248540 VI. INSTRUCTIONS······················································································· Technology] In the transmission system, the taxi dispatching system is used as an example. (4) The individual vehicle dispatching service is provided by the #车业者 (such as the team), which can be used for the ride or the Internet. After calling the bicycle rider in the driving control of the taxi, the driver will use the radio broadcast method to contact all the taxis and the taxis of the money. The taxi rider will broadcast the ride location and arrive at the shortest distance. The time begins to ask, and the driver can self-assess whether he can pick up the passenger's willingness at the arrival time of the requested request and take the initiative to reply to the passenger's willingness, and select a taxi to take the passenger to the boarding location. In recent years, taxi fleets have developed a way to deploy satellite positioning systems on all taxis belonging to the fleet, and in conjunction with mobile communication networks (eg GSM) to transmit the coordinates of the driving position to the driving control center, and then the driving control center The server records the driving information. Therefore, after receiving the calling information to obtain the passenger's riding location information, the vehicle can be selected by the light driving position of each vehicle and notified to the nearest passenger to the passenger, or selected. Ask the shortest possible arrival time of the nearest car to decide which one to take. However, due to the conventional taxi dispatch system, passengers are not able to know which taxi is in service when they are on a taxi. Therefore, even if the taxi driver is based on his own situation, for example, 'because of the long-term unmanned ride, he intends to reduce the price by 201248540'. It is also impossible to let the interest rate be used in advance, and increase the passenger capacity. For the passengers, only the money is used for boarding, and the discount is not available. It is a crime to make a full-time car. So how to let the driver follow the situation: and get a ride agreement with the passengers in advance, that is, =;卩 Become a dispatch service [Invention content] The purpose is to provide a way for the driver to determine the vehicle f and its _ amplitude according to its own (four) or material conditions. - A method and device for letting the driver to reach an agreement with the driver on the fare. The ten-way is used to provide the vehicle-to-vehicle method. The passenger is the one who will be dispatched::::: By the driver and the machine == two passengers have - the first communication device, the division device and the dispatched vehicle two service%: the general method includes: let the first communication with the other communication communication less than or equal to the first The price is the second price; when the second price is issued once, the first price, the second communication device is the second:: Car: ^ In the case of the actual communication, the first communication exhibition The first communication device is a vehicle module, and the second communication device is a vehicle module. In an embodiment, the first price and the second price are corresponding to a route. The fixed price or a discount. In an embodiment, the method further includes: when the first When the price is greater than the first price, the dispatch server requests the first communication device to reset a first price. In an embodiment, when the dispatch server transmits the first price to the second communication device In the embodiment, the dispatching server dispatches the driver to carry the passenger, and further includes: dispatching the driver closest to the passenger to carry the passenger, or dispatching the shortest time to arrive at the passenger. The driver of the passenger position carries the passenger. According to another aspect of the present invention, the vehicle-providing system is provided in a dispatch-dispatch center for providing the driver and the dispatcher before the dispatcher-driver-passenger The passengers carry out a match for the fare of the dispatch service, wherein the passenger has a first communication device, the driver has a second communication device, and the system includes at least: a "competition device"; a response feeding device, a connection The bidding agent H, the + the first communication device can communicate with the answering server to set a H price on the bidding servo, and the second communication device can communicate with the answering server Connecting to set the n-money on the bidding device; and - the database H, to connect the f-server to store the first price and the second price, wherein when the second price is less than Or equal to the first price, the bidder transmits the first price to the third communication device, and dispatches the driver to carry the passenger according to a response sent by the second communication device. 201248540 In an embodiment The response server further includes: an interactive voice response server and a network service server, wherein the interactive voice response server provides the first communication device and the second communication device inputs the voice in an interactive manner The first price and the second price, the network service server provides the first communication device and the second communication device inputs the first price on the webpage of the network service feeder by means of network connection and The second price. In one embodiment, the first communication device is a mobile phone, a telephone, a handheld device or a computer, and the second communication device is a vehicle model. In an embodiment, a wireless base station is further included, and the second communication device is coupled to the auction server through the wireless base station. In an embodiment, when the second price is greater than the first price, the bidding server requests the first communication device to reset a first price through the response server. In one embodiment, the first price and the second price are fixed prices or a discount for a route. In an embodiment, when the bidding server transmits the first price to the second communication device, the destination to which the passenger intends to travel is further transmitted. In one embodiment, the bidding server dispatches the driver closest to the passenger to carry the passenger, or the driver who dispatches the passenger to the passenger location for the shortest time to carry the passenger. In summary, since the price decision of the fare is floating, the driver can decide whether to accept the discount or fixed price of the passenger according to his own conditions and the current state, instead of only passively accepting the fixed 201248540 discount. Therefore, the driver's willingness to undertake can be improved. For the passengers, if they do not hurry, they can wait for a driver to serve at a more favorable price without having to pay the full cost of the ride and increase their willingness to ride. Therefore, the method and device of the present invention can achieve the goal of achieving a win-win situation for both passengers and drivers. [Embodiment] Referring to Fig. 1, there is shown a flow chart of a vehicle communication according to an embodiment of the present invention. At the beginning of the process, in order to allow the driver and the passenger to agree on the fare or the discount, the present invention firstly allows the passenger and the driver to set the fare or discount that can be received by the passenger and the driver. In an embodiment, the vehicle module on each taxi has a specific identification number, so the driver can use the identification number of the vehicle module as its identification number, and the identification number is set in the dispatch center, in other words, After the setting is completed, according to the identification number, the dispatch center can know the fare or discount offered by the driver, and dispatch the match accordingly. The driver can make the manual voice input (IVR) through the car module, interactive voice response (IVR) or manually set by the dispatching center. On the other hand, passengers can call the dispatch center to make settings through the interactive voice response system, or the passengers can transfer to the dispatch center's setting staff to manually set the settings on the terminal, or through the action. The device or computer is wired or wirelessly connected to the dispatch center to set directly on the setting page. One passenger can simply set a fixed price (such as 100 yuan) or a fixed discount number (such as 7). If you are a frequent taxi, one passenger can also set the preferential time according to the demand level of the taxi. For example, from 7:00 to 9:30, 8 201248540, the demand for taxis is high, so only the discount is first. The discount is 30% off for the match. If the match fails, the match will be changed directly without discount. If the demand for the taxi is reduced during the non-working hours from 9:30 to 17: 00, the media can be progressively implemented. In the first place, the discount will be 30% off. If the match is not successful, then the discount will be made by 20% off, 10% off to no discount. In another embodiment, a passenger may also set a time period according to the degree of demand of the taxi in accordance with the weather condition. For example, in the rainy day, the discount is 30% off, and if the match fails, the change is directly changed to none. The way of discounting is to match. However, it is worth noting that the way passengers or drivers are set is not limited to the above methods. The above setting of the passenger, in an embodiment, may be stored in the passenger database server of the dispatch center according to the caller number of the passenger, and when the passenger calls the vehicle, directly grabs from the passenger database server instead of Need to be set in the line. In another embodiment, the above setting may be set again according to the current situation when the vehicle is called, and is not stored in the passenger database server in advance. When the setting is completed, if the passenger has a need for a ride, he can request the car service at the dispatching center in step 102. The method of calling a car can be called by an interactive voice response system, or by calling a dispatching center to be called by a service person, or by a mobile device or a computer to connect to a dispatch center by wire or wireless. Call for a car. At this point, in step 103, a search is made in the passenger database server based on the caller number of the passenger to find the fare or discount offer corresponding to the passenger. And in step 104, it is detected whether the passenger has a fixed price or a fixed discount. If the passenger does not set a fixed price and does not set a special discount for the current time period, then in step 105, 201248540 offers 'in an embodiment, the user can choose, such as: acceptable Discount discount media: Press (1); receive a discount of 20% off for the match, press (2 into = " discount discount 10% off for the match, press ()., and then match, press (4) I ¥ (3), can In the embodiment, when the process of the present invention receives == complex soil, on the group, the driver decides whether to perform t-connection according to the new knowledge. In another embodiment, Only a single car module can be selected for transmission. Although the discount is excellent, the car can be selected, or in other words, it can be selected whether or not to accept, in other words, the last: the discount: = whether the driver promises to be prepared according to this discount At the end of this time period, 'there is still no driver == will == Ren: The driver is willing to take the passenger with this discount: according to: Hui, to improve the driver's acceptance tone: Re: Inquiry: Passenger: No adjustment discount is preferred for single use Alternatively, as in the embodiment, voice can be provided by (1); adjust the discount The offer is: for the = line match 'deduction offer for no discounts to match the matchmaker: D;; * 'Adjust discount discount, and no longer ask this area, the match's] gather. In addition, in another embodiment In the process of the 201248540 invention, it can also be adjusted according to the preferential time period set by the passenger in step 101. For example, in the time of 7:〇〇~9:30, the first time, the discount is 30% off, if the match fails. , that is, directly change the mediation without discount, without asking the passenger again. When the discount is difficult to complete, the process will perform step 106 again to transmit the initial discount offer message to the adjacent car module' For the driver to decide, ^ will be undertaken according to the newly set discount. The above steps 106 to (10) will be repeated until the completion of the price combination. In addition, if it is judged in step 107 that the driver promises to discount according to this, the line is accepted. The process of the present invention will execute step 351G9, wherein if only a single-driver response is willing to accept the rider to know that the driver is going to take the passenger, and if there are f drivers who are willing to accept the answer, then the distance is taken by the distance. The nearest vehicle is to carry the passenger, or the vehicle that can reach the destination in the shortest time to the passenger's or the driver who dispatched the first in the service area to carry the passenger. On the other hand, right in step 104, it is judged that the passenger has Setting the fixed wire will be carried out in step m, and the price will be transferred to the vehicle module using the fixed purpose. The driver decides whether to turn the solid/amp; The car will be: in the case of the "", in the case of the case, the money module can be transferred to the vehicle. 'The driver can still accept the change. The driver has the final decision. Some drivers have promised to fix the price in this case. For example, the time period can be set. When the course is judged: the driver has not responded through the vehicle module. The price will take over the passengers, and according to this, 201248540 will perform step 112. This process will again ask the passengers whether to adjust the fixed price to enhance the driver's willingness to accept. In one embodiment, the passenger may be referenced based on the distance and the fixed price that the driver may be willing to undertake to enhance the chance of a match. After the fixed price adjustment is completed, the process will execute step 110 again, and the fixed price message will be transmitted to the adjacent vehicle module for the driver to decide whether to undertake at the newly set fixed price. Steps 110 through 112 above are repeated until the price is completed. On the other hand, if it is determined in step 111 that the driver promises to undertake the fixed price, the process of the present invention performs step 113, in which the driver is notified to take the passenger if only a single driver is willing to accept the request. If more than one driver is willing to accept the request, the vehicle closest to the location will be taken to the passenger, or the vehicle with the shortest time to reach the destination will be carried. Finally, the process ends at step 114. According to the above process, since the price decision of the fare is floating, the driver can decide whether to accept the discount or fixed price proposed by the passenger according to his own conditions and the current state, instead of only passively accepting the fixed discount. To enhance the driver's willingness to accept, and for the passengers, if they are not in a hurry, they can wait for a driver to serve at a more favorable price, instead of always paying the full cost of the ride and increasing their willingness to ride. Therefore, the method of the present invention can achieve the goal of achieving a win-win situation for both passengers and drivers. Referring to Fig. 2, a preferred embodiment of a passenger discounting a car using the process of the present invention is shown. In the present embodiment, the setting of the passenger is determined when the incoming line is called, and the driver has previously set the fare or discount offer that can be received. After the setting is completed, the dispatch center manages the discount management of the fleet. In an embodiment, a classification code can be added before the driver identification number 201248540, and the corresponding discount discount is transmitted according to the classification code, for example: willingness Drivers who accept a discount of 30% off have a category code "7" in front of their identification number; drivers who are willing to accept a discount of 20% off have a category code "8" before their identification number; drivers who are willing to accept a discount of 10% off, A classification code "9" is added before the identification number; drivers who are unwilling to accept the discount offer a category code "10" before the identification number. According to the identification number, the dispatch center can know the fare or discount offered by the driver, and dispatch the match accordingly. In step 2 (Π, the passenger enters the car and calls the car. In step 202, the passenger can call through the interactive voice response system, or transfer to the dispatcher of the dispatch center by telephone, or by mobile device or computer to wire or The wireless way is connected to the dispatch center to input the location of the pick-up and set the discount. When the setting is completed, the dispatch center will dispatch the empty car with the nearest place according to the passenger's setting. In the example, if the discount set by the passenger is 30% off, then the dispatch center will search for the driver with the classification code "7" before the identification number in the nearest location area in step 2 0 3. If the discount set by the passenger is For those who receive a discount of 30% off, the driver will also receive a 20% discount on the discount set by the passenger. Therefore, the dispatch center will search for the driver with the classification code less than or equal to "8" in the nearest location area in step 204. If the discount set by the passenger is 10% off, the driver who accepts the discount at 30% and 20% will also receive the discount set by the passenger. Therefore, the dispatch center searches for a driver having a classification code less than or equal to "9" in the nearest location area in step 205. If the discount set by the passenger is no discount, then the discount is 30%, 20%, and 9 The driver will also accept the 13 201248540 discount offered by the passenger, so the dispatch center will search for the driver of all the classification codes in this area in step 206. ',, . Then set the discount offer for this passenger in step 207. And the location is transmitted to the corresponding vehicle module. In step 2〇8, it is decided by the company to accept the discount. If only a single driver is willing to accept the request, the driver is notified to take the passenger. If a number of divisions & replies are willing to undertake, the vehicle closest to the destination will be taken to the passenger, or the vehicle that arrives at the destination in the shortest time will be used to carry the passenger, or the driver who dispatched the first class in the area will be carried. The passenger. If no driver is willing to take the passenger with this discount, step 210 will be executed, and the reward will be refunded under this discount. If you have a driver, you will be asked to adjust the discount to improve the driver's willingness to accept. In addition, if the driver promises to undertake the discount, the process of the present invention will perform steps 1〇9\ Only the single-driver response is willing to undertake, step 2〇9 will be executed, the return of the car will be successful under this discount offer, and the corresponding car number will be notified to the passenger. FIG. 3 is a diagram for performing according to an embodiment of the present invention. The system diagram of the vehicle of the present invention comprises: an interactive voice response (IVR) server 3, a network service server 302, a database server 303, and a bidding servo. The device 3〇4 and a customer service terminal 305. The interactive voice response (NR) server 3.1 provides the passenger to make a call service through the mobile phone 308 or the general telephone 3〇9. The Internet Service Word Service 3〇2 provides passengers with a car service via a handheld (10) or computer 311 via a network connection 312. The customer service terminal 305 is connected and interacted. The voice response servo 11 3G provides the passengers through the dispatch center. The database server 303 stores the fare or discount offered by the passenger and the driver, and searches for the fare or discount offered by the passenger based on the caller number of the passenger, and corresponds to the fare or discount offered by the driver. The bidding server 304 is coupled to the passenger database feeder 303, and can be coupled to the plurality of vehicle modules 306 via the wireless base station 307, wherein the bidding server 304 and the passengers set the fare or discount and the boarding The location is transmitted to the corresponding vehicle module 306 via the wireless base station 307. For example, if the discount set by the passenger is 30%, the bidding server 304 searches for the vehicle that accepts the discount in the nearest location area. Module 306 performs the transfer. If the discount set by the passenger is 20% off, the bidding server 304 searches for the driver who receives the discount of 30% and 20% in the nearest location area, and receives the message by the driver. It can be decided whether or not to undertake the discount. If you wish, you can send the message to the bidding server 3〇4 via the wireless base station 3〇7 via its car module 3〇6. If only a single division is willing to accept the 'history price, he ^ 3G4 heart and if there are multiple drivers who are willing to accept the bid, then the bidding words: Γ二根-vehicles go to passengers. The time to go to the secret location to choose among them, the ice & said above, the driver is actively based on his own conditions, it is a floating 'can be determined, not just a single fixed fee, :: the supply and demand status to decide and improve the driver The willingness to accept, and the passengers can better meet the actual conditions, waiting - the driver is willing to pay a more favorable price 'If you do not hurry, you can also aim. The present invention has been disclosed in the above-described embodiments. Although the present invention has been disclosed in the above embodiments, it is not intended to limit And the scope of the present invention is defined by the scope of the appended claims. BRIEF DESCRIPTION OF THE DRAWINGS In order to make the above and other objects, features, advantages and embodiments of the present invention more obvious, the description of the drawings is as follows: Figure 1 shows a vehicle according to an embodiment of the present invention. Matching flow chart. Figure 2 shows a preferred embodiment of a passenger who uses the process of the present invention to make a discount offer. Figure 3 is a system diagram for performing the vehicle matching of the present invention in accordance with an embodiment of the present invention. [Main component symbol description] 101~114 Steps 201~210 Step 301 Interactive voice response server 302 Network service server 303 Passenger database server 304 Auction server 305 Customer service terminal 306 Car module 307 Wireless base station 308 mobile phone 16 201248540 309 general phone 310 handheld device 311 computer 312 network

Claims (1)

201248540 七、申請專利範園: 數個司機中用於-派遣中心在派遣複 媒合方法與該乘客就=可使用該車資 f中;派t:心具有-派車伺服器,該乘客具= 裝置’遠複數個司機分別具有帛通Λ 少包含: 负弟一通汛裝置,該方法至 讓該第-通訊褒置與該派車伺服 派車伺服器上設定一第一價錢; L連接以於该 节、底些第二通訊裝置與該派車飼服器通訊連接,以於 3亥派車飼服器上設第二價錢,· U連接,以於 於料於該第―價錢時,該派車舰 器將-知錢傳送給該些第二通訊裝置,· 早 根據該第一價錢,該些第二通訊裝 給該派車伺服器;以及 口應傳达 根據5亥回應,該派車伺服5|派墙4 + 載該乘客。 底遣该些司機其中之一承 2.如請求項!所述之車資媒合 訊裝置為-行動電話、一電話具中°亥第-通 該第二通訊裝置為-車載:。—手持式裝置或-電腦, 201248540 惠。 包括4. 求:1所述之車資媒合方法,其中該方法更 匕括.田〇亥第一仏錢大於該第一價 求該第-通訊裝置重新設I第一價錢f。以車伺服器要 5. 如請求们所述之車資媒合方法 包括:當該些第二通訊裒置沒有廍兵Μ方法更 致媒人失麟,m ’又有日應或回應不願意承接導 定一第一價錢。 逋艰裝置重新設 6. 如請求们所述之車資媒合方法 =器將該第一價錢傳送給該第二中= 乘客欲前往之目的地。 了文得达及 7. 如請求項i所述之車資媒合方 服器派遣該些5!機其中t ww 具H辰車β 該乘好,斤夕一:ΐ 承載该乘客,更包括:派遣與 ‘客位罟 5承載該乘客,或派遣最短時間到達該 I客位置之司機承載該乘客 的司機承載該乘客。〖Μ遣在㈣域第一個報班 服。^·求項1所述之車資媒合方法,其中該派車飼 司機承載該乘客,更包括:事先的預約性質的 19 201248540 、9. 一種車資媒合系統,係建置於一派遣中心中,用 在派遣複數個司機中之—司機承載—乘客前,該司機可使 用該車資媒合系統與該乘客就該次派遣服務之車資進行媒 合,其中该乘客具有一第一通訊裝置,該些司機分別具有 一第二通訊裝置,該系統至少包含: 一競價伺服器; 一應答伺服器,耦接該競價伺服器,其中該第一通訊 f置可與該應答伺服器通訊連接,以於該競價伺服器上設 定-第-價錢’以及該些第三通訊裝置可與該應答伺服器 通訊連接,以於該該簡舰器上設定—第二價錢;以及 一資料庫伺服器,_該應答舰器,用以儲存該第 一價錢以及該第二價錢, 其中當該第二價錢小於或等於該第一價錢時,該競價 飼服器將該第-價錢傳送給該些第二通訊裝置,並根據該 第二通訊裝置發出之-回應,派遣該複數個 機承載該乘客。 J .如請求項9所述之車資媒合系統,其中該應答伺 服咨:更包括:-互動式語音應答舰器以及—網路服務 飼服器’其中該互動式語音應答健器提供第—通訊裝置 以及該些第二通訊裝置以互動語音之方式輸人該第一價錢 以及該第二價錢,朗路服務贿器提供第—通訊裝置以 及該些第二通訊裝置以網路連線之方式與該網路服務飼服 器之網頁上輸入該第一價錢以及該第二價錢。 20 201248540 二1項9所述之車資媒合系統,其中該第-通 1電話、一電話、-手持式裝置或-電腦, 該第一通訊裝置為一車载模組。 12.如請求項9 無線基地台,該些第 價伺服器耦接。 所述之車資媒合系統,其中更包括一 二通訊裝置透過該無線基地台與該競 13.如請求項9所述之車資媒合系統,其中當該第二 nr;玄^仏錢時,該競價伺服器透過該應答伺服 器,要求該第—通訊《置重新設第-價錢。 14. 〇印來項9所述之車資媒合系統,其中該第一價 ,以及β第—價錢為對應—路線之固㈣錢或是扣優 惠。 15.如請求項9所述之車資媒合系統 該 飼服器將該第-價錢傳送給該第二通訊裝 乘客欲前往之目的地。 16.如請求項9所述之車資媒合系統 服器派遣與該乘客最近之司嬙名择#恭分 J 之1機承載該乘客,或派遣最短時 間到達該乘客位置之司機承澈兮子 機承載该乘客,或派遣在該區域第 一個報班的司機承載該乘客。 21 201248540 句括:心Λ求項9所述之車資媒合系統,其中該方法更 致媒合f通訊裝置沒有回應或回應不願意承接導 笛ή壯日,S亥競價饲服器透過該應答伺服器’要求該 第一通汛裝置重新設定一第一價錢。 18.如請求項9所述之車資媒合系統,其中該競價伺 服器透過該應答伺服器派遣該些司機其中之一 客,更包括:事先的預約性質的叫車媒合。 人 22201248540 VII. Applying for the patent garden: Several drivers are used in the dispatch center to dispatch the recapture method and the passengers can use the fare f; send t: heart has - dispatch server, the passenger has = The device 'distance and number of drivers respectively have a 帛 Λ 包含 包括 包括 包括 包括 包括 包括 包括 包括 包括 包括 包括 包括 包括 包括 包括 包括 包括 包括 包括 包括 包括 包括 包括 包括 包括 包括 包括 包括 包括 包括 包括 包括 包括 包括 包括 包括 包括 包括 包括 包括 包括 包括 包括 包括 包括The second communication device at the bottom and the second communication device are connected with the dispatching device, and the second price is set on the 3Haijia feeding device, and the U is connected, so that when the first price is used, The dispatcher transmits the money to the second communication device, and according to the first price, the second communication is loaded to the dispatch server; and the mouth should convey according to the 5H response, the faction Car Servo 5 | Pai Wall 4 + carries the passenger. Deport one of these drivers. 2. If requested! The vehicle communication device is a mobile phone, a telephone device, a mobile phone, and a second communication device. —Handheld device or computer, 201248540 Hui. Including: claim: 1: The method of vehicle matching, wherein the method further includes. The first payment of Tian Haohai is greater than the first price, and the first communication device is reset to the first price f. According to the request of the vehicle, the method of vehicle matching includes: when the second communication devices are not squatting, the method is more likely to be lost, and m's have a response or are unwilling to accept the guide. Set a first price. Re-installation of the shackle device 6. The method of charging the vehicle as described by the requester transmits the first price to the second place = the destination the passenger wants to travel to. Wendida and 7. According to the request of item i, the car-funded party machine dispatches these 5! machines, where t ww has H-cars β. The ride is good, and the passengers carry the passengers, including: Dispatched with the 'passenger' 5 carrying the passenger, or dispatched the shortest time to reach the location of the I passenger, the driver carrying the passenger carries the passenger. Μ Μ 在 第 ( ( ( 第 第 第 第 第 第 第 第 第^· The vehicle-matching method described in Item 1, wherein the driver of the vehicle carries the passenger, and further includes: a prior reservation nature 19 201248540, 9. A vehicle-age matching system, which is built in a dispatch center Before the driver is dispatched to the passenger, the driver can use the vehicle matching system to match the passenger with the fare of the dispatch service, wherein the passenger has a first communication device, Each of the drivers has a second communication device, and the system includes at least: a bidding server; a response server coupled to the bidding server, wherein the first communication device is communicably connected to the response server. The bidding server sets a -first price 'and the third communication device can be communicatively coupled to the answering server to set a second price on the warship; and a database server, _ The response ship is configured to store the first price and the second price, wherein when the second price is less than or equal to the first price, the bidding feeder transmits the first price to the The second communication device dispatches the plurality of aircraft to carry the passenger according to the response sent by the second communication device. J. The vehicle communication system according to claim 9, wherein the response servo protocol further comprises: an interactive voice response vehicle and a network service feeder, wherein the interactive voice response device provides the first The communication device and the second communication device input the first price and the second price in an interactive voice manner, and the Langlu service device provides the first communication device and the second communication device to connect to the network Enter the first price and the second price on the webpage of the web service feeder. 20 201248540 The vehicle communication system described in Item 2, wherein the first communication device is a telephone module, a telephone, a handheld device or a computer, and the first communication device is a vehicle module. 12. The request base 9 wireless base station, the first price servers are coupled. The vehicle-based mediation system, further comprising a communication device through the wireless base station and the competition media system as claimed in claim 9, wherein when the second nr; The bidding server requests the first communication to re-set the first price through the response server. 14. The vehicle-age matching system according to Item 9, wherein the first price and the β-price are corresponding to the route (four) money or deduction benefit. 15. The vehicle matching system of claim 9, wherein the feeding device transmits the first price to a destination of the second communication passenger. 16. The vehicle-matching system server dispatched as claimed in claim 9 dispatches the nearest sergeant of the passenger to the passenger, or dispatches the passenger to the passenger's position in the shortest time. The aircraft carries the passenger or dispatches the driver of the first class in the area to carry the passenger. 21 201248540 The sentence includes: the car-matching system described in Item 9, wherein the method is more responsive, the communication device does not respond or responds to the unwillingness to undertake the flute, and the S-hai bidding device passes the response. The server 'requires the first overnight device to reset a first price. 18. The vehicle matching system of claim 9, wherein the bidding server dispatches one of the drivers through the answering server, and further comprises: a pre-arranged nature of the calling vehicle. People 22
TW100118885A 2011-05-30 2011-05-30 A fare of vehicle agreement system and method thereof TW201248540A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
TW100118885A TW201248540A (en) 2011-05-30 2011-05-30 A fare of vehicle agreement system and method thereof

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
TW100118885A TW201248540A (en) 2011-05-30 2011-05-30 A fare of vehicle agreement system and method thereof

Publications (1)

Publication Number Publication Date
TW201248540A true TW201248540A (en) 2012-12-01

Family

ID=48138763

Family Applications (1)

Application Number Title Priority Date Filing Date
TW100118885A TW201248540A (en) 2011-05-30 2011-05-30 A fare of vehicle agreement system and method thereof

Country Status (1)

Country Link
TW (1) TW201248540A (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
TWI610266B (en) * 2014-02-27 2018-01-01 王富民 Taxi on-site servive system and communication device thereof, server and graphical user interface
TWI669009B (en) * 2016-05-25 2019-08-11 大陸商北京嘀嘀無限科技發展有限公司 Systems and methods for distributing a service request for an on-demand service

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
TWI610266B (en) * 2014-02-27 2018-01-01 王富民 Taxi on-site servive system and communication device thereof, server and graphical user interface
TWI669009B (en) * 2016-05-25 2019-08-11 大陸商北京嘀嘀無限科技發展有限公司 Systems and methods for distributing a service request for an on-demand service

Similar Documents

Publication Publication Date Title
US8386177B2 (en) Vehicle-dispatching method and vehicle-dispatching system
US10448206B2 (en) Method for requesting transportation services
TWI476727B (en) Automatic dispatching method and system of taxi using community network and geography instant exchange technology
TWI482116B (en) Distributed vehicle dispatching method, system, and business method thereof
JP2013134641A (en) Calling system of taxi vehicle using portable terminal
WO2016008391A1 (en) Method and system for booking taxi for third party in online taxi hiring system
JP2004362271A (en) Ride sharing riding system, riding information processor and ride sharing riding method
CN101826256A (en) Vehicle dispatching method and vehicle dispatching system
JP2004062490A (en) Ride sharing proxy negotiation system and ride sharing proxy negotiation method
CN104281944A (en) Intelligent telephone booking taxi system supporting online payment
WO2011067741A1 (en) Method for ordering taxi services using a mobile communication device
US20160098650A1 (en) System for Real-Time Optimal Matching of Ride Sharing Requests
KR102390924B1 (en) Apparatus and method for managing mileage related to proxy driving brokerage service
US20180374363A1 (en) Dispatch platform for road, travel, or home assistance
JP2003308596A (en) Taxi-sharing reservation operation system
WO2019244598A1 (en) Car sharing management system
TW201248540A (en) A fare of vehicle agreement system and method thereof
US20190311315A1 (en) System for affiliating parcel service targeting at unspecified individuals and method for delivering article by using the same
CN107341699B (en) Position taxi calling method and system with social attribute
TWI450211B (en) Taxi calling system with matching function and method thereof
KR20100115414A (en) The systems of an active service against taxi
JP2003168195A (en) Method, system and apparatus for vehicle dispatching service, user terminal device, company terminal device and company onboard machine
KR101692590B1 (en) Service method for proxy driving used terminal
JP3529357B2 (en) Optimal vehicle dispatching method and optimal vehicle dispatching system
KR102184100B1 (en) Method for Providing Call Service of Mobility Sharing Using App Meter, and Managing Server Used Therein