跳到主要內容

臺灣博碩士論文加值系統

(3.229.137.68) 您好!臺灣時間:2021/07/25 17:49
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果 :::

詳目顯示

我願授權國圖
: 
twitterline
研究生:廖國均
研究生(外文):Kuo-Chun Liao
論文名稱:具時窗限制之遊園路徑推薦
論文名稱(外文):The Recommendation of Visiting Route under the Time Window
指導教授:車振華車振華引用關係
指導教授(外文):Zhen-Hua Che
口試委員:江梓安王河星
口試委員(外文):Tzu-An ChiangHer-Sing Wang
口試日期:2012-06-21
學位類別:碩士
校院名稱:國立臺北科技大學
系所名稱:工業工程與管理系碩士班
學門:工程學門
學類:工業工程學類
論文種類:學術論文
論文出版年:2012
畢業學年度:100
語文別:中文
論文頁數:58
中文關鍵詞:旅行推銷員問題無線射頻技術多目標最佳化NSGA-II演算法
外文關鍵詞:Travelling Salesman ProblemRFIDMulti-objective OptimizationNon-Dominated Sorting Genetic Algorithm II
相關次數:
  • 被引用被引用:0
  • 點閱點閱:127
  • 評分評分:
  • 下載下載:0
  • 收藏至我的研究室書目清單書目收藏:0
近年來,人們逐漸重視生活品質的經營,出遊的風氣也隨之增加。因工作因素,造成離尖峰時段差異過大,逢連續假期必定迫使有限的空間達到過飽和,因而產生了等候遊玩時間過久、無法掌握行程時間等,大大敗了遊玩的興致。且大部分的出遊地點皆集中在特定地區,對於居住地較遠的遊客遊程規劃和體驗顯然相對重要。大部分的旅遊地點皆須購買票券,能夠最有效地利用有限的時間,遊玩最多的設施,對於遊客而言也較不虛此行。有鑒於此,本篇架構MOTSP模型,發展出以改良式NSGA-II多目標演算法之導遊路徑系統,搭配RFID導入即時性的系統概念,能夠確切掌握設施內和設施外的遊客人數,並分成時間區隔來做統計和更新人數,以利計算各節點上的遊客密度,將系統以時間最短和總遊園飽合度最低兩目標並行,以推薦遊客先行前往較不擁擠的設施點做遊玩,並在規定的閉園時間前完成一次性遊園,將有效地改善遊園的詬病和為遊客增近更大的遊園品質。

Nowadays, people have concerned their life qualities more than before. And the trend of visiting exhibitions when on weekends has come to a big growth. Therefore, it very crowed on weekends in Taiwan because people would like to go outside, this reason, people stuck in traffic jams very easily. People would waste too much time on waiting or out of control of schedule interrupt their good mood. Furthermore, most of travel spots are getting together in a particular area, so it’s also important. Tourists are required to buy tickets to get into spots. Hence, the contribution of this paper is to enable people to make good use of their visiting or playing routine in a limited time. This paper uses MOTSP model to develop Modified-NSGA-II multi-objective algorithm, path system with RFID system imports in-time system concept, to control well of tourists who it are playing or waiting. Also divides time zone to calculate and update the number of tourist and the density each spot. The goal are making tourist play all the facilities with time and by improving shortcuts of the spot, them attracting more tourists to come.

摘 要 i
Abstract ii
誌 謝 iv
目 錄 v
圖目錄 vii
表目錄 viii
第一章 緒論 1
1.1研究背景與動機 1
1.2研究問題 2
1.3研究目的 3
1.4研究流程 4
第二章 國內外文獻探討 6
2.1旅行推銷員問題 6
2.1.1旅行推銷員問題解法 8
2.2多目標最佳化問題 10
2.3非支配解排序演算法 11
2.4時間窗 12
2.3.1時間窗的種類 13
2.5步行速度 13
2.6 RFID技術 13
第三章 研究方法 15
3.1研究假設 15
3.2研究架構 16
3.3多目標數學規劃模式 17
3.4技術概念構想 20
第四章 改良式NSGA-II演算法 22
第五章 實驗案例與結果分析 33
5.1案例描述 33
5.2結果分析 37
5.2.1人數動態示意 37
5.2.2參數設計 39
5.2.3演算結果分析 41
5.2.4案例規劃 46
第六章 結論與建議 53
參考文獻 54


[1]T. Bektas, “The multiple traveling salesman problem: an overview of formulations and solution procedures,” Omega, Vol. 34, No.3, 2006, pp. 209-219.
[2]R.M. Chen, A.T. Yan and C.H. Lin, “Tour route planning multimedia system with particle swarm optimization designed,” New Trends in Information Science and Service Science, Taiwan, 2010, pp. 725-730.
[3]W. Lei, K. Qi, X. H and W. Qidi, “Traffic intelligent optimization and local traffic-flow control inside shanghai-EXPO-area,” Proceedings of the IEEE International Conference on Networking, Sensing and Control, London, UK, 2007, pp. 856-861.
[4]K.L. Hsieh, C.C. Shen, C.Y. Chou and C.C. Cheng, “Employing genetic algorithm into constructing the adaptive customer’s tour scheduling suggestion model,” Tourism Management Research, Vol. 4, No. 1, 2005, pp. 53-66.
[5]V. F. Yu, S.W. Lin and S.Y. Chou, “The museum visitor routing problem” Applied Mathematics and Computation, Vol. 216, No. 3, 2010, pp. 719-729
[6]J. Zhang, H. Kawasaki and Y. Kawai, “A tourist route search system based on web information and the visibility of scenic sights” ISUC IEEE Computer Society, Washington, 2008, pp. 154-161.
[7]M. Held and R. M. Karp, “The traveling-salesman problem and minimum spanning trees,” Operations Research, Vol. 18, No.6, 1969, pp. 1138-1162.
[8]Z. Yan, L. Zhang, L. Kang and G. Lin, “A new MOEA for multi-objective TSP and its convergence property analysis,” Lecture Notes in Computer Science, Vol. 2632, 2003, pp. 342-354.
[9]N. Jozefowiez, F. Semet and E.G. Talbi, “Target aiming pareto search and its application to the vehicle routing problem with route balancing,” Journal of Heuristics, Vol. 13, No. 5, 2007, pp. 455-469.
[10]W. Peng, Q. Zhang and H. Li, “Comparison between MOEA/D and NSGA-II on the multi-Objective travelling salesman problem,” Studies in Computational Intelligence, Vol. 171, 2009, pp. 309-324.
[11]F. Wang, W. Wang, W Huang, G. Xiao and X. Zhao, “A tourist supervise system based on RFID,” Electrical and Control Engineering International Conference on Publications, Harbin, China, 2010, pp. 299-302.
[12]M. M. Solomon, “Algorithm for the vehicle routing and scheduling problems with Time windows constraints,” Operations Research35(2), Vol. 35, No. 2, 1987, pp. 254-265.
[13]K. Deb and S. Tiwari, “Omni-optimizer: A generic evolutionary algorithm for single and multi-objective optimization,” European Journal of Operational Research, Vol. 185, No. 3, 2008, pp. 1062-1087.
[14]Y. Wang and Y. Yang, “Particle swarm optimization with preference order ranking for multi-objective optimization,” Information Sciences, Vol. 179, No. 12, 2009, pp. 1944-1959.
[15]B. Luo, J. Zheng, J. Xie and J. Wu, “Dynamic Crowding Distance - A new diversity maintenance strategy for MOEAS,” 4th international conference on natural computation, Vol. 1, 2008, pp. 580-585.
[16]L. Wang, T, Wang, J. Wu and Y. Luo, “Multi-objective optimization design of wind turbine blades based on improved NSGA-II,” Journal of Nanjing University of Aeronautics & Astronautics, Vol. 43, No. 5, 2011, pp. 672-676.
[17]J. Ouyang, F. Yang, S.W. Yang and Z.P. Nie, “Improved NSGA-II approach with application in antenna arrays optimization,” Journal of University of Electronic Science and Technology, Vol. 37, No. 6, 2008, pp. 886-889.
[18]S. Dhanalakshmi, S. Kannan, K. Mahadevan and S. Baskar, “Application of modified NSGA-II algorithm to combined economic and emission dispatch problem,” International Journal of Electrical Power & Energy Systems, Vol. 33, No. 4, 2011, pp. 992-1002.
[19]L.B Zhang, X.N. Shi and N.G. Cui, “Research on optimization of midcourse correction time points of upper stage transfer orbit via NSGA-II, “ Control and Decision, Vol. 26, No. 9, 2011, pp. 1382-1385.
[20]K. Y. Hhui, Z. Zhigang and H. Weijun, “NSGA-II algorithms for multi-objective short-term hydrothermal scheduling,” Power and Energy Engineering Conference, Asia-Pacific, 2009, pp. 1-5.
[21]E. Agastra, L, Lucci, R. Nesti, G. Pelosi and S. Selleri, “Modified NSGA-II algorithm for multiobjective optimization of compact high-efficiency square horns,” International Journal of RF and Microwave Computer-Aided Engineering, Vol. 21, No. 2, 2011, pp. 174-181.
[22]K. Shah, N. Ripon, S. Kwong and K. F. Man, “Areal-coding jumping gene genetic algorithm (RJGGA) for multiobjective optimization,” Information Sciences, Vol. 117, No. 2, 2007, pp. 632-654.
[23]R. Agrawal, Application of the Modified 2-opt and Jumping Gene Operators in Multi-Objective Genetic Algorithm to Solve MOTSP, Ph.D. Thesis, Cornell University of India, India , Noida, 2011
[24]J. S. Arora, Genetic Algorithms for Optimum Design, Iowa, The University of Iowa, 2012, pp. 643-655.
[25]S. Elaoud, J. Teghem and T. Loukil, “Multiple crossover genetic algorithm for the multi-objective traveling salesman problem,” Electronic Notes in Discrete Mathematics, Vol. 36, 2010, pp. 939-946.
[26]C.Y. Tsai and S.H. Chung, “A personalized route recommendation service for theme parks using RFID information and tourist behavior,” Decision Support Systems, Vol. 52, No. 2, 2012, pp. 514-527.
[27]K. Deb, A. Pratap, S. Agarwal and T. Meyarivan, “A fast and elitist multiobjective genetic algorithm: NSGA-II,” IEEE Transactions on Evolutionary Computation, Vol. 6, No. 2, 2002, pp. 182-197.
[28]C. M. Fonseca and P. J. Fleming, Genetic algorithms for multiobjective optimization: Formulation, discussion and generalization, CA, USA, Proceedings of the 5th International Conference on Genetic Algorithms San Francisco, 1993, pp. 416-423.
[29]N. Srinivas and K. Deb, “Muiltiobjective optimization using nondominated sorting in genetic algorithms,” Evolutionary computation, Vol. 2, No. 3, 1994, pp. 221-248.
[30]E. Zitzler and L. Thiele, “Multi-objective evolutionary algorithms: A comparative case study and strength Pareto approach,” IEEE Transaction on Evolutionary Computation, Vol. 3, No. 4, 1999, pp. 257-271.
[31]H. Bo, Y. Li and R. K., “Bi-level GA and GIS for Multi-objective TSP Route Planning,” Transportation Planning and Technology, Vol. 29, No. 2, 2006, pp. 105-124.
[32]U. F. Siddiqi, Y. Shiraishi and S. M. Sait, “Multi-objective optimal path selection in electric vehicles,” 17th International Symposium on Artificial Life and Robotics, Oita, Japan, 2012
[33]C. Chitra and P. Subbaraj, “Multiobjective Optimization Solution for Shortest Path Routing Problem,” International Journal of Computer and Information Engineering, Tamilnadu, INDIA, 2010, pp. 77-85.
[34]E. Dovgan, M. Gamsb and B Filipic, “A multiobjective optimization algorithm for discovering driving strategies,” Roceedings of the 13th Annual Conference Companion on Genetic and Evolutionary Computation, New York, NY, USA, 2011, pp. 751-754.
[35]J.D. Schaffer, “Multiple objective optimization with vector evaluated genetic algorithms”, Proceedings of the First International Conference on Genetic Algorithms, Pittsburgh, U. S. A., 1985, pp. 93–100.
[36]A. R. Rahimi-Vahed, S. M. Mirghorbani and M. Rabbani, “A new particle swarm algorithm for a multi-objective mixed-model assembly line sequencing problem”, Soft Computing, Vol. 11, No. 10, 2007, pp. 997–1012.

QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top