Skip navigation

DSpace

機構典藏 DSpace 系統致力於保存各式數位資料(如:文字、圖片、PDF)並使其易於取用。

點此認識 DSpace
DSpace logo
English
中文
  • 瀏覽論文
    • 校院系所
    • 出版年
    • 作者
    • 標題
    • 關鍵字
  • 搜尋 TDR
  • 授權 Q&A
    • 我的頁面
    • 接受 E-mail 通知
    • 編輯個人資料
  1. NTU Theses and Dissertations Repository
  2. 電機資訊學院
  3. 資訊網路與多媒體研究所
請用此 Handle URI 來引用此文件: http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/58426
標題: 考慮抵達時間合理性及客製化需求之旅遊行程規劃系統
A Trip Planning System Considering Arrival Time Feasibility and Specific Customer’s Need
作者: Cheng-Yao Fu
傅承堯
指導教授: 吳家麟(Ja-Ling Wu)
關鍵字: 資料探勘,旅遊行程推薦,路線規劃,使用者介面,
Data mining,travel recommendation,route planning,user interface,
出版年 : 2014
學位: 碩士
摘要: 旅遊規劃一直以來都是件非常繁雜且耗時的作業。規劃者通常必須花費大量的氣力將旅遊地點的相關資料搜索閱覽過,才有辦法得到有用的資訊,進而規劃出高質量的旅遊行程。隨著社群網站的蓬勃發展,規劃者現在可以根據旅遊網誌、照片等等,直接遵循前人的旅遊行程。然而,每個規劃者都有其不同需求,例如:出發時間、想去的景點、想看的景色以及住宿地點…都會有差異。再加上景點的開放時間限制,因此景點的抵達時間合理性也必須被妥善考慮。這些因素都將使得前人的旅遊行程無法直接被套用,規劃者通常需要再搜索資料並做個人化的修改。如此可以看出,規劃者仍需花費非常多的時間才能規劃出高質量的旅遊行程。為解決此問題,我們提出了一個考慮抵達時間合理性及客製化需求的旅遊行程規劃系統。確切地說,我們的系統從Flickr上蒐集各景點的照片,並利用這些資料自動估算出景點及路線的熱門程度、景點開放時間…。接著使用者可以加入進一步的客製化需求例如:指定的必去景點、抵達時間、住宿地點…。最後,系統會在滿足抵達時間合理性及客製化需求這些條件的情況下計算出一高質量的旅遊行程。由於最後計算行程的步驟是一NP-hard的問題,因此我們提出了一個快速且有效的啟發式演算法來解決。此外,我們也設計了一個可以自動挑選出景點在不同季節、不同時段之代表性景色的使用者介面,以幫助使用者完成其客製化行程的需求。在研究中,我們經由客觀及主觀評估的實驗結果驗證了該系統規劃行程的有效性。而使用者研究的實驗結果也證實了本文所提出的使用者介面可以有效地幫助使用者進行行程規劃。
Trip planning is a very taxing and time-consuming task. Planners usually have to put a lot of effort into searching over data about their travel destination to obtain useful information so that they can arrange a high-quality itinerary. With the rapid development of social websites, now planners can just follow other people’s previous itineraries by viewing their travelogue, travel photos, etc. However, every planner has different needs, for example, the starting travel time, attractions to go, scenery to see and hotels of different planners would all differ. Plus attractions’ available visiting time interval in a day should also be considered. All these factors would make other people’s previous itineraries not directly applicable, so planners have to search over data again and then modify other people’s previous itineraries to suit their needs. In other words, planners still need to spend lots of time on planning an itinerary with high-quality. To solve this problem, we propose a trip planning system considering arrival time feasibility and specific customer’s need. More specifically, our system first crawled photos of every attraction from Flickr, and facilitate these data to mine the popularity of attractions, popularity of paths among them, available visiting time interval of attractions, and so on. Next, users can input their customized needs, for instance, must-go attractions, specified arrival time, hotels, etc. Finally, our system will generate a high-quality itinerary given that conditions of arrival time feasibility and customized needs are fulfilled. Since the final step is an NP-hard problem, we propose an efficient and effective heuristic algorithm to solve it. We also design an UI which can select each attraction’s representative visual scenes in different seasons and different timing in a day, to help users complete their customized needs. In this work, experimental results of objective and subjective evaluation both prove the effectiveness of itinerary generated by our system. The results of user study also show that the proposed UI can effectively help users plan their trips.
URI: http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/58426
全文授權: 有償授權
顯示於系所單位:資訊網路與多媒體研究所

文件中的檔案:
檔案 大小格式 
ntu-103-1.pdf
  目前未授權公開取用
2.27 MBAdobe PDF
顯示文件完整紀錄


系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。

社群連結
聯絡資訊
10617臺北市大安區羅斯福路四段1號
No.1 Sec.4, Roosevelt Rd., Taipei, Taiwan, R.O.C. 106
Tel: (02)33662353
Email: ntuetds@ntu.edu.tw
意見箱
相關連結
館藏目錄
國內圖書館整合查詢 MetaCat
臺大學術典藏 NTU Scholars
臺大圖書館數位典藏館
本站聲明
© NTU Library All Rights Reserved