請用此 Handle URI 來引用此文件:
http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/53645
完整後設資料紀錄
DC 欄位 | 值 | 語言 |
---|---|---|
dc.contributor.advisor | 張堂賢 | |
dc.contributor.author | Che-Hao Hsu | en |
dc.contributor.author | 許哲浩 | zh_TW |
dc.date.accessioned | 2021-06-16T02:26:54Z | - |
dc.date.available | 2017-08-05 | |
dc.date.copyright | 2015-08-05 | |
dc.date.issued | 2015 | |
dc.date.submitted | 2015-08-04 | |
dc.identifier.citation | 1. Cherkassky, B.V., A.V. Goldberg, and T. Radzik. (1996). Shortest paths algorithms: Theory and experimental evaluation. Mathematical Programming, 129-174.
2. 任維廉, 涂榮庭, 呂明穎, 呂堂榮. (2009). 探討先進旅行者資訊系統相關商品的知覺風險. 中華民國運輸學會. 3. 交通部運輸研究所. (2001). 台灣地區發展智慧型運輸系統 (ITS) 系統架構之研究 (Ⅰ). 交通部運輸研究所. 4. Smith, J.C. and K. Russam. (1989). Some possible effects of AUTOGUIDE on traffic in London. IEEE International Conference on Vehicle Navigation and Information Systems. Toronto, Canada. 5. French, B. and C. Queree. (1991). The intelligent highway. RTI/IVHS News. London. 6. Boyce, D.E., A.M. Kirson, and J.L. Schofer. (1994). Design and implementation of ADVANCE:The Illinois dynamic navigation and route guidance demonstration program. IEEE International Conference on Vehicle Navigation and Information Systems. Ottawa, Canada. 7. Klunder, G.A. and H.N. Post. (2006). The shortest path problem on large-scale real-road networks. NETWORKS, 182-194. 8. Pallottino S., and Scutella M. G. (1998). Shortest path algorithms in transportation models: classical and innovative aspects, Equilibrium and Advanced Transportation Modeling. 9. Lawler, E. L. (1976), Combinatorial Optimization: Networks and Matroids. Holt, New York : Rinehart and Winston.Lewis, C. D. (1982), Industrial and Business Forecasting Method, Southampton: The Camelot Press Ltd. 10. Gallo, G., and Pallottino, S. (1986), “Shortest Path Methods: An Unifying Approach”, Mathematical Programming Study, Vol. 26, pp. 38-64. 11. Dijkstra, E.W. (1959). A note on two problems in connexion with graphs. Numerische Mathematik, 269-271. 12. Bellman, R. (1958). On a routing problem. Quart. Appl. Mathematics, 87-90. 13. Kershenbaum, A. (1981), “A note on finding shortest path trees,” Networks, Vol. 11, No.1, pp. 399-400. 14. Gallo, G. (1980), “Reoptimization procedures in shortest path problems”, Rivista di Matematica per le Scienze Economiche e Sociali, Vol. 3, No.1, pp. 3-13. 15. Dreyfus, S.E. (1969). An appraisal of some shortest path algorithms. Operations Research, 395-412. 16. Ziliaskopoulos, A. K., and Mahmassani, H. S. (1993), “Time-dependent, shortest-path algorithm for real-time intelligent vehicle highway system applications,” Transportation Research Record, No. 1408, pp. 94-100. 17. Desrochers, M., and Soumis, F. (1988), “A generalized permanent labelling algorithm for the shortest path problem with time windows”, INFOR, Vol. 26, No. 3, pp. 191-212. 18. Kirby, R. F., and Potts, R. B. (1969), “The minimum route problem for networks with turn penalties and prohibitions,” Transportation Research, Vol. 3, pp. 397-408. 19. Ziliaskopoulos, A. K., and Mahmassani, H. S. (1996), “A Note on Least Time Path Computation Considering Delays and Prohibitions for Intersection Movements”, Transportation Research Part B, Vol. 30, No. 5, pp. 359-367. 20. Hansen, P. (1980), Bicriterion path problems, In Fandel, G., and Gal, T. (Eds.), Multicriteria decision making: theory and applications, Heidelberg :Springer, pp. 109-127. 21. Jacob, R., M.V. Marathe, and K. Nagel. (1998). A computational study of routing algorithms for realistic transportation networks. Proceedings WAE'98 Saarbrucke, (頁 167-17). Germany. 22. Cordeau, J.F., et al. (2002). A guide to vehicle routing heuristics. The Journal of the Operational Research Society, 頁 512-522. 23. Chabini, I. (1997). A new short paths algorithm for discrete dynamic networks. Proceedings of 8th IFAC Symposium on Transportation Systems. Chania, Greece. 24. Leiper, N. (1990). Tourist attraction system. Annals of Tourism Research, 17, 367-384. 25. Swarbrooke, J. (2002). The development and management of visitor (2th).Oxford:Butterworth-Heinemann. 26. 許志義. (1994). 多目標決策. 五南圖書出版公司. 27. 許芷菱. (2011). 商圈吸引力與滿意度對忠誠度與情境吸引力之影響-以台灣六個都會型魅力商圈為例. 逢甲大學土地管理學系碩士論文. 28. Gunn, C. A., and Var, T. (2002). Tourism Planning: Basics, Concept, Cases (4th ed.), New York: Routledge. 29. Chabini, I. (1998). Discrete dynamic shortest path problems in transportation applications: complexity and algorithms with optimal run time. Transportation Research Records, 170-175. 30. Cooke, K.L. and E. Halsey. (1966). The shortest route through a network with time dependent intermodal transit time. Journal of Math. Anal. Appl., 492-498. 31. Bellman, R., On a routing problem. Quart. Appl. Mathematics, 1958. 16: p. 87-90. 32. Sturtevant, N. and Buro, M. (2005). Partial pathfinding using map abstraction and refinement. ceedings of AAAI, 47-52. 33. Daganzo, C.F. (2002). Reversibility of the time-dependent shortest path problem. Transportation Research Part B, 665-668. 34. Ahuja, R.K., T.L. Magnanti, and J.B. Orlin. (1993). Network flows: Theory, algorithms, and applications. Englewood Cliffs, NY.: Prentice-Hall. 35. Bertsekas, D.P. (1991). Linear network optimization: Algorithms and codes. Cambridge, MA: The MIT Press. 36. Denardo, E.V. and B.L. Fox. (1979). Shortest-route methods: 1. Reaching, pruning, and buckets. 於 Operations Research (頁 161-186). 37. Denardo, E.V. and B.L. Fox. (1979). Shortest-route methods: 2. Group knapsacks, expanded networks, and branch-and-bound. 於 Operations Research (頁 548-566). 38. Deo, N. and C. Pang. (1984). Shortest path algorithms: Taxonomy and annotation. Networks, 275-323. 39. Gallo, G. and S. Pallottino. (1984). Shortest path methods in transportation models. 於 Transportation Planning Models (M. Florian, ed.), 227-256. 40. Gallo, G. and S. Pallottino. (1988). Shortest path algorithms. Annals of Operational Research, 3-79. 41. Halpern, J. and I. Priess. (1974). Shortest path with time constraints on movement and parking. Networks, 241-253. 42. Johnson, D.B. (1973). Algorithms for shortest paths. NY: Cornell Univ.: Ithaca. 43. Orda, A. and R. Rom. (1990). Shortest path and minimum-delay algorithms in network with time-dependent edge length. Journal of the ACM, 607-625. 44. Shier, D.R. and C. Witzgall. (1981). Properties of labeling methods for determining shortest path trees. 於 Journal of Research of the National Bureau of Standards, 317-330. 45. SteenbrinkP.A. (1974). Optimization of transport networks. London: John Wiley & Sons. 46. Van Vliet, D. (1978). Improved shortest path algorithms for transport networks. Transportation Research, 7-20. 47. Goeldner, C. R., & Ritchie, J. R. (2006). Tourism: Principle Practice, Philosophies (11th ed.). 48. 張堂賢、闕嘉宏. (2012). 依時性後推式路徑演算系統開發. 運輸學刊. 49. 葉羿稚. (2007). 行前即時路徑規劃演算法之研究. 台灣大學土木工程學系碩士論文. 50. 謝伯嘉. (2013). 依時性A*路徑演算系統開發-以國道高速公路路網為例. 台灣大學土木工程學系碩士論文. 51. 劉泳倫、施昱伶. (2009). 鹿港端午節慶活動吸引力、旅遊滿意度與重遊意願之相關研究休閒產業管理學刊, 28-49. | |
dc.identifier.uri | http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/53645 | - |
dc.description.abstract | 近年先進駕駛者資訊系統發展因為智慧型手機的出現,使得用路人與路側設施及車輛之間的通訊在未來得以普及化,擁有許多發展潛力,改變了人們的許多交通行為,硬體技術的快速發展也令規劃運算時間大幅度縮短,人們對於即時路徑規劃的需求越來越高,需要有更好的運算結果及更短的演算時間。
自古以來行前路徑規劃系統及理論多以最短路徑或最短旅行時間為目標進行發展,但某些情況下旅行者對於規劃結果所感受的評價可能不單只有時間快慢及路線長短,對於每個人所謂的好結果因人而異,是由多項因素來評斷,本研究針對景區下之旅遊進行考量,假設旅行者不以旅行時間為單一因素進行規劃,將此規劃系統將路段旅行時間導入旅遊吸引力作為路段成本,以宜蘭地區選出之代表路網作為測試。以宜蘭縣政府之車輛偵測器及Google即時路況資訊作為旅行時間資料庫,並以A* Algorithm及做為路徑演算的基礎,A* 演算法經前人證實有優異的運算表現,能節省運算資源。適合用於先進旅行者資訊系統。 本研究將設計不同情境,不同參數設定下和傳統單一目標所產生的結果比較。 | zh_TW |
dc.description.provenance | Made available in DSpace on 2021-06-16T02:26:54Z (GMT). No. of bitstreams: 1 ntu-104-R02521519-1.pdf: 11290919 bytes, checksum: 4742afa652329efa4fc801f9631f465a (MD5) Previous issue date: 2015 | en |
dc.description.tableofcontents | 第一章 緒論 1
1.1 研究背景與動機 1 1.2 研究目的 2 1.3 研究範圍 2 1.4 研究內容與流程 3 第二章 文獻回顧 5 2.1 智慧型運輸系統(ITS) 5 2.1.1 先進旅行者資訊系統(ATIS) 6 2.1.2 行前資訊系統 7 2.1.3 旅行者資訊系統之效益 9 2.1.4 小結 10 2.2 旅遊吸引力 11 2.2.1 旅遊之定義及分類 11 2.2.2 吸引力定義及分類 13 2.2.3 小結 14 2.3 最短路徑問題(Shortest Path Problem) 14 2.3.1 路網結構資料 14 2.3.2 路網基本定義 16 2.3.3 最短路徑問題 17 2.3.4 A* Algorithm 23 2.3.5 依時性最短路徑演算法 24 2.3.6 前推式及後推式最短路徑演算法 25 2.3.7 前推式及後推式演算法原理及證明 26 2.3.8 小結 29 2.4 多目標模式求解 30 2.4.1 多目標模式分類 30 2.4.2 小結 33 第三章 模式建構 34 3.1 路段時間成本資料建立 34 3.2 觀光吸引力及商區吸引力評估方式 40 3.3 吸引力轉換於路段資訊之方法及機制 43 3.4 A* Algorithm 運作 46 3.2.1 A* Algorithm運作原理 46 3.2.2 A* Algorithm參數設計 50 第四章 系統設計與運作 52 4.1 系統架構與運作流程 52 4.2 測試系統建置 54 4.2.1 使用者介面 54 4.2.2 路網節點資料之建立 55 4.2.3 吸引力資料之建立及轉換 55 4.2.4 資料儲存結構 57 4.3 路徑演算模組 60 4.3.1 前推式路徑演算流程 60 4.3.2 後推式路徑演算流程 62 4.3.3 建議路徑輸出方式 63 4.4 其他相關處理模組 64 4.4.1 時間表示轉換 64 4.4.2 候選路段集合 65 第五章 參數校正及案例測試 66 5.1 測試範圍 66 5.2 路網節點之選取及相關資料 67 5.3 距離影響常數校正結果 71 5.3.1 距離影響因數之校正結果 71 5.3.2 小結 74 5.4 路徑規劃結果 75 5.4.1 情境一(複合模式)規劃結果 76 5.4.2 情境二(吸引力導向模式)規劃結果 78 5.4.3 情境三(傳統規劃法)規劃結果 80 第六章 結論與建議 82 6.1 結論 82 6.2 建議 83 參考文獻 85 | |
dc.language.iso | zh-TW | |
dc.title | 基於景區道路導入吸引力因子之路徑規劃模式 | zh_TW |
dc.title | Development of Route Planning Model Imported Attractiveness factor in Scenic Roads: A Case Study of Yilan roads | en |
dc.type | Thesis | |
dc.date.schoolyear | 103-2 | |
dc.description.degree | 碩士 | |
dc.contributor.oralexamcommittee | 陶治中,胡守任 | |
dc.subject.keyword | 先進旅行者資訊系統,路徑規劃,吸引力,A星Algorithm,車輛偵測器, | zh_TW |
dc.subject.keyword | Advanced Traveler Information Systems,Path planning,Attractiveness,A star Algorithm,Vehicle detectors, | en |
dc.relation.page | 90 | |
dc.rights.note | 有償授權 | |
dc.date.accepted | 2015-08-04 | |
dc.contributor.author-college | 工學院 | zh_TW |
dc.contributor.author-dept | 土木工程學研究所 | zh_TW |
顯示於系所單位: | 土木工程學系 |
文件中的檔案:
檔案 | 大小 | 格式 | |
---|---|---|---|
ntu-104-1.pdf 目前未授權公開取用 | 11.03 MB | Adobe PDF |
系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。