English  |  正體中文  |  简体中文  |  Items with full text/Total items : 888/888 (100%)
Visitors : 13578331      Online Users : 274
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    Please use this identifier to cite or link to this item: http://ccur.lib.ccu.edu.tw/handle/A095B0000Q/791


    Title: 符合旅客多重限制之旅遊行程規劃;Travel Path Planning under Multiple User Constraints
    Authors: 陳逸庭;CHEN, YI-TING
    Contributors: 通訊工程研究所
    Keywords: Google Map API;旅遊平台;限制;旅客需求;旅遊規劃;Google map API;Travel platform;Multiple constraints;User requirement;Travel planning
    Date: 2017
    Issue Date: 2019-07-17 10:47:52 (UTC+8)
    Publisher: 通訊工程研究所
    Abstract: 隨著旅遊的人數逐年增加,相較於透過旅行社取得旅遊景點資訊外,利用網路來進行查詢的方式變得更為普遍與便利。近年來越來越多提供旅遊資訊的網站出現,網站上提供了各式各樣的功能,然而,規劃行程的功能往往無法安排出一個讓使用者滿意的旅遊行程,其中以旅客的需求條件為主要因素。因此,本研究提出TPS-RC(Travel Path Scheduling under User Requirement Constraints)行程規劃演算法,在規劃過程中同時考慮時間、預算與指定景點三項需求並利用分數來表示旅遊結果,使得每次安排的旅遊行程分數較高且符合旅客的需求達成客製化。在實驗模擬的部份,我們利用針對四種不同的情分析旅遊分數的變化,最後網站作為呈現,讓使用者能自由設定旅遊的需求,系統將根據使用者所提供的資訊進行規劃,並以Google Map API來提供所規劃的旅遊路徑。
    In recent years, more and more tourists are choosing to travel independently rather than join a tour group. However, travel planning is a tedious and time consuming job. In this study, we propose an algorithm, namely TPS-RC (Travel Path Scheduling under User Requirement Constraints), which considers multiple constraints (travel time, travel budget and specific attractions) during the scheduling making process. The experiment results show that TPS-RC outperforms the other approaches in gaining travel scores. We also develop a prototype of the travel website which is able to show applicability of TPS-RC in real life.
    Appears in Collections:[通訊工程研究所] 學位論文

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML342View/Open


    All items in CCUR are protected by copyright, with all rights reserved.


    版權聲明 © 國立中正大學圖書館網頁內容著作權屬國立中正大學圖書館

    隱私權及資訊安全政策

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback