基於自適應慣性權重改良之跳躍式粒子群演算法

以作者查詢圖書館館藏

、以作者查詢臺灣博碩士

、以作者查詢全國書目

、勘誤回報

、線上人數：26

、訪客IP：3.147.73.35

姓名

賈宸碩(Chen-Shuo Chia) 查詢紙本館藏

畢業系所

電機工程學系

論文名稱

基於自適應慣性權重改良之跳躍式粒子群演算法
(Jumping Particle Swarm Optimization Based on Adaptive Inertia Weight)

相關論文

★ 小型化 GSM/GPRS 行動通訊模組之研究	★ 語者辨識之研究
★ 應用投影法作受擾動奇異系統之強健性分析	★ 利用支撐向量機模型改善對立假設特徵函數之語者確認研究
★ 結合高斯混合超級向量與微分核函數之語者確認研究	★ 敏捷移動粒子群最佳化方法
★ 改良式粒子群方法之無失真影像預測編碼應用	★ 粒子群演算法應用於語者模型訓練與調適之研究
★ 粒子群演算法之語者確認系統	★ 改良式梅爾倒頻譜係數混合多種語音特徵之研究
★ 利用語者特定背景模型之語者確認系統	★ 智慧型遠端監控系統
★ 正向系統輸出回授之穩定度分析與控制器設計	★ 混合式區間搜索粒子群演算法
★ 基於深度神經網路的手勢辨識研究	★ 人體姿勢矯正項鍊配載影像辨識自動校準及手機接收警告系統

檔案

[Endnote RIS 格式]

[Bibtex 格式]

[相關文章]

[文章引用]

[完整記錄]

[館藏目錄]

[檢視]

[下載]

本電子論文使用權限為同意立即開放。
已達開放權限電子全文僅授權使用者為學術研究之目的，進行個人非營利性質之檢索、閱讀、列印。
請遵守中華民國著作權法之相關規定，切勿任意重製、散佈、改作、轉貼、播送，以免觸法。

摘要(中)

隨著人工智慧的發展以及人類對於自動推理的需要，現今電腦科學發展出了龐大的演算法系統，各種形式的演算法在不同領域自動完成麻煩且困難的任務。本論文所改良的演算法為最佳化演算法中多粒子搜尋裡的粒子群演算法，粒子群演算法透過模仿鳥類覓食的移動方式來進行最佳化搜尋，透過自身最佳解和群體最佳解的帶領，使粒子有效且快速的收斂到區域最佳解。我們希望透過簡單且重要的改良使現有的粒子群演算法達到更佳的效能，同時不會增加程式實作上的複雜度，因此提出了跳躍式粒子群演算法，此演算法結合了位置公式改良以及慣性權重設計，提升了粒子收斂時解的精準度，適合用於多粒子搜尋的實作當中，其中位置公式改良有P-PSO和G-PSO兩種版本，權重設計也分成自適應型慣性權重和常態分布累積遞減型慣性權重，使用者可以依照自身需求來決定要使用的組合，本論文也同時探討初速度的有無對於疊代時的影響，讓使用者在不同的情況下採用不同的初速度，最後，透過實驗模擬我們驗證了這些方法的效果及性能，在16種測試函數中，跳躍式粒子群演算法於大部分函數裡有著最佳表現，能夠讓使用者在實作及應用上達到良好的效能及發揮。

摘要(英)

With the development of artificial intelligence and the need of automatic reasoning, humans have created a great number of algorithms in computer science. Various forms of algorithms complete troublesome and difficult tasks automatically in different fields. The improved algorithm in the thesis is the particle swarm optimization in the multi-particle search in the optimization algorithm. Particle swarm optimization uses a mobile approach that mimics bird foraging to perform optimal searches. Through the guiding of the particle best solutions and the group best solution, the particles can effectively and quickly converge to a local optimum. We modify the existing particle swarm optimization algorithm to achieve a better performance through simple and important improvements without increasing the complexity of the programming implementation. An improved algorithm called Jumping Particle Swarm Optimization based on adaptive inertia weight is proposed. This particle swarm optimization method combines position formula improvements and inertia weight design to improve the accuracy of the solution. It is suitable for the implementation of multi-particle searches. There are two versions of position formula improvements: P-PSO and G-PSO. The weight design also has adaptive inertia weight and normal distribution cumulative decreasing inertia weight. Users can decide the combination to be used according to their own needs. The thesis also discusses the influence of the initial velocity on the iterations, allowing users to use different initial velocities in different situations. Finally, through the experimental simulation, we verify the effect and performance of the proposed methods. Among the 16 test functions, the jumping particle swarm algorithm has the best performance in most functions, which enables users to achieve an excellent performance in implementation and application.

關鍵字(中)

★ 粒子群演算法
★ 跳躍式
★ 自適應
★ 慣性權重

關鍵字(英)

★ PSO

論文目次

摘要................................................... I
Abstract............................................... II
致謝................................................... III
目錄................................................... IV
圖目錄................................................. V
表目錄................................................. VI
第一章緒論............................................ 1
1.1演算法簡介...................................... 1
1.2研究動機........................................ 2
1.3論文架構........................................ 2
第二章文獻探討........................................ 3
2.1最佳化演算法引言................................ 3
2.2粒子群演算法介紹................................ 3
2.3粒子群演算法公式................................ 3
2.4慣性權重改良.................................... 4
2.5粒子群演算法流程圖.............................. 6
2.6粒子群演算法模擬移動軌跡散佈圖.................. 7
第三章改良式粒子群演算法.............................. 8
3.1位置公式之Pbest改良.............................. 8
3.2位置公式之Gbest改良.............................. 9
3.3探討速度初始值.................................. 10
3.4「自適應型慣性權重」及「常態分佈累積遞減型慣性權重」. 10
3.4.1自適應型慣性權重.......................... 10
3.4.2常態分佈累積遞減型慣性權重................ 11
第四章實驗結果........................................ 13
4.1測試函數介紹.................................... 13
4.2測試環境與參數設定.............................. 19
4.3實驗圖形........................................ 20
4.3.1現有PSO在各測試函數下之收斂曲線.......... 20
4.3.2 P-PSO與現有PSO之比較.................... 27
4.3.3 G-PSO與現有PSO之比較.................... 34
第五章總結與未來展望.................................. 42
5.1總結............................................ 42
5.2未來展望........................................ 42
參考文獻............................................... 43

參考文獻

[1] M. Dorigo, V. Maniezzo, and A. Colorni, “Ant system: optimization by a colony of cooperating agents,” IEEE Transactions on Systems, Man, and Cybernetics-Part B, Vol. 26, No. 1, pp. 29-41, 1996.
[2] A. Colorni, M. Dorigo, and V. Maniezzo, “Distributed optimization by ant colonies,” Proceedings of ECAL′91-European Conference on Artificial Life, Paris, France, pp. 134-142, 1991.
[3] M. Dorigo, V. Maniezzo, and A. Colorni, “The ant system: an autocatalytic optimizing process,” Technical Report TR91-016, Dipartimento di Elettronica,Politecnico di Milano, Italy, 1991.
[4] J. Kennedy and R. Eberhart, “Particle swarm optimization,” Proceedings of the 4th IEEE International Conference on Neural Networks, Perth, WA, Australia, pp. 1942-1948, November/ December 1995.
[5] Y. Shi and R. C. Eberhart, “Evolutionary Programming VII, Parameter Selection in Particle Swarm Optimization,” Springer Berlin Heidelberg, Vol. 1447, pp. 591–600, 1998.
[6] G. Zeng and Y. Jiang, “A Modified PSO Algorithm with Line Search,” In Proceedings of 2010 International Conference on Computational Intelligence and Software Engineering, pp. 1-4, 2010.
[7] H. Babaee and A. Khosravi, “An Improve PSO Based Hybrid Algorithms,” In Proceedings of 2011 International Conference on Management and Service Science, pp. 1-5, 2011.
[8] S. Y. Ho, H. S. Lin, W. H. Liauh, and S. J. Ho, “OPSO: Orthogonal particle swarm optimization and its application to task assignment problems,” IEEE Transactions on Man and Cybernetics, Part A: Systems and Humans, Vol. 38, No. 2, pp. 288-298, 2008.
[9] T. -H Kim, I. Maruta, and T. Sugie, “Robust PID controller tuning based on the constrained particles swarm optimization,” Automatica, Vol. 44, No. 4, pp. 1104-1110, 2008.
[10] J. Kennedy and W. M. Spears, “Matching algorithms to problems: An experimental test of the particle swarm and some genetic algorithms on the multimodal problem generator,” The 1998 IEEE International Conference on Evolutionary Computation Proceedings, pp. 78-83, 1988.
[11] D. Chen, F. Zou, Z. Li, J. Wang, and S. Li, “An improved teaching-learning-based optimization algorithm for solving global optimization problem,” International Journal of Information Sciences, Vol. 297, pp. 179-190, 2015.
[12] Y. Shi and R. C. Eberhart, “Particle Swarm Optimization：Development, Applications and Resource,” In Proceedings of the 2001 Congress on Evolutionary Computation, Vol. 1, pp. 81-86, 2001.
[13] V. Miranda and N. Fonseca, “EPSO-evolutionary particle swarm optimization, a new algorithm with applications in power systems,” Proceedings of IEEE Transmission Distribution Conference and Exhibition, Vol. 2, pp. 745-750, 6-10 October 2002.
[14] M. O’Neil and A. Brabazon, “Self-organizing swarm (SOSwarm): a particle swarm algorithm for unsupervised learning,” Proceedings of IEEE congress on Evolutionary Computation, Vancouver, BC, Canada, pp. 634-639, 16-21 July 2006.
[15] V. Miranda and N. Fonseca, “EPSO-best-of-two-worlds meta-heuristic applied to power system problems,” Proceedings of IEEE congress on Evolutionary Computation, Honolulu, HI, pp. 12-17, 12-17 May 2002.
[16] K. E. Parsopoulos and M. N. Vrahatis, “UPSO: a unified particle swarm scheme,” Proceedings of the International Conference of Computational Methods in Sciences and Engineering, Lecture Series on Computer and Computational Sciences, Vol. 1, pp. 868-873, 2004.
[17] Y. Shi and R. C. Eberhart, “Empirical Study of Particle Swarm Optimization,” In Proceedings of the 1999 Congress on Evolutionary Computation, Vol. 3, pp. 1945-1950, 1999.
[18] J. Kennedy and R. Eberhart, “The particle swarm optimization: Social adaptation of knowledge,” In Proceedings of the International conference on Evolutionary Computation, pp. 303-308, 1997.
[19] J. Kennedy, R. Eberhart, and Y. Shi, Swarm Intelligence, California: Morgan Kauffman, 2001.
[20] V. Miranda, “Evolutionary algorithm with particle swarm movements,” Proceedings of the 13th International Conference on Intelligent Systems Application to Power Systems, Arlington, VA , pp. 6-21, 6-10 November 2005.
[21] C. Liu and C. Ouyang, “An adaptive fuzzy weight PSO algorithm,” 2010 Fourth International Conference on Genetic and Evolutionary Computing, pp. 8, 10, 13-15, 2010.
[22] A. W. Mohemmed, Z. Mengjie, and N. C. Sahoo, “A new particle swarm optimization based algorithm for solving short-paths tree problems,” In Proceedings of IEEE Congress on Evolutionary Computation, pp. 3221-3225, 2007.
[23] W. H. Lim, “Particle swarm optimization with adaptive time-varying Topology connectivity,” Applied Soft Computing , Vol. 24, pp. 623-642, 2014.

[24] K. E. Parsopoulos and M.N. Vrahatis, “On the computation of all global minimizers through particle swarm optimization,” IEEE Transactions on Evolutionary Computation, Vol. 8, No. 3, pp. 211-224, 2004.
[25] Lin Chuan, Feng Quanyuan. “The Standard Particle Swarm Optimization Algorithm Convergence Analysis and Parameter Selection” School of Information Science and Technology, Southwest Jiaotong University, Chengdu,610031, China, Vol. 2007
[26] I. C. Trelea, “The particle swarm optimization algorithm: convergence analysis and parameter selection,” Elsevier Science B.V., Vol. 85, pp. 317-325, 2003.
[27] M. Clerc, “The Swarm and the Queen: Towards a Deterministic and Adaptive Particle Swarm Optimization,” In Proceedings of the Congress on Evolutionary Computation, Vol. 3, pp. 1951−1957, 1999.
[28] Y.-T. Juang, S.-L. Tung, and H.-C. Chiu, “Adaptive fuzzy particle swarm optimization for global optimization of multimodal functions,” Information Sciences, in press, doi: 10.1016/j.ins.2010.11.025.
[29] S. T. Hsieh, T. Y. Sun, C. C. Liu, and S. J. Tsai, “Efficient population utilization strategy for particle swarm optimizer,” IEEE Transactions on Systems, Man, and Cybernetics, Part B, Vol. 39, No. 2, pp. 444-456, 2009.
[30] X. Yao, Y. Liu, and G. Lin, “Evolutionary programming made faster,” IEEE Transactions on Evolutionary Computation, Vol. 3, No. 2, pp. 82-102, 1999.
[31] R. Mendes, J. Kennedy, and J. Neves, “The fully informed particle swarm: simpler, maybe better,” IEEE Transactions on Evolutionary Computation, Vol. 8, No. 3, pp. 204-210, 2004.
[32] R. A. Krohling and L. S. Coelho, “Coevolutionary Particle Swarm Optimization Using Gaussian Distribution for Solving Constrained Optimization Problem,” IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics , Vol. 36, No. 6, pp. 1407-1416, 2006.
[33] N. M. Kwok, D. K. Liu, K. C. Tan, and Q. P. Ha, “An Empirical Study on the Settings of Control Coefficients in Particle Swarm Optimization,” In Proceedings of IEEE Congress on Evolutionary Computation, pp. 823-830, 2006.
[34] P. N. Suganthan, N. Hansen, J. J. Liang, K. Deb, Y.-P. Chen, A. Auger, and S. Tiwari, “Problem definitions and evaluation criteria for the CEC 2005 special session on real-parameter optimization,” Technical report, Nanyang Technological University, Singapore, 2005.
[35] R. Salomon, “Reevaluating genetic algorithm performance under coordinate rotation of benchmark functions,” BioSystems, Vol. 39, No. 3, pp. 263-278, 1996.

[36] Y. Shi and R. Eberhart, “A modified particle swarm optimizer,” Proceedings of IEEE congress on Evolutionary Computation, Anchorage, AK , USA, pp. 69–73, 4-9 May 1998.
[37] P. J. Angeline, “Using selection to improve particle swarm optimization,” Proceedings of IEEE congress on Evolutionary Computation, Anchorage, AK , USA, pp. 84-89, 4-9 May 1998.
[38] N. Iwasaki, K. Yasuda, and G. Ueno, “Dynamic parameter tuning of particle swarm optimization,” IEEJ Transactions on Electrical and Electronic Engineering, Vol. 1, No. 4, pp. 353-363, 2006.
[39] J. J. Liang, P. N. Suganthan, and K. Deb, “Novel composition test functions for numerical global optimization,” Proceedings of IEEE on Swarm Intelligence Symposium, pp. 68-75, 8-10 June 2005.
[40] M. Clerc and J. Kennedy, “The particle swarm-explosion, stability, and convergence in a multidimensional complex space,” IEEE Transactions on Evolutionary Computation, Vol. 6, No. 1, pp. 58-73, 2002.
[41] M. Pant, T. Radha, and V. P. Singh, “A new particle swarm optimization with quadratic interpolation,” Proceedings of IEEE International Conference on Computational Intelligence and Multimedia Applications, Sivakasi, Tamil Nadu, pp. 55-60, 13-15 December 2007.
[42] M. A. Montes de Oca, J. Pena, T. Stutzle, C. Pinciroli, and M. Dorigo, “Heterogeneous particle swarm optimizers,” Proceedings of IEEE congress on Evolutionary Computation, Trondheim , pp. 698-705, 18-21 May 2009.
[43] J. J. Liang and P. N. Suganthan, “Dynamic multi-swarm particle swarm optimizer,” Proceedings of IEEE on Swarm Intelligence Symposium, pp.124-129, 8-10 June 2005.
[44] W. Du and B. Li, “Multi-strategy ensemble particle swarm optimization for dynamic optimization,” Information Sciences, Vol. 178, No. 15, pp. 3096-3109, 2008.
[45] J. J. Liang, A. K. Qin, P. N. Suganthan, and S. Baskar, “Comprehensive learning particle swarm optimizer for global optimization of multimodal functions,” IEEE Transactions on Evolutionary Computation, Vol. 10, No. 3, pp. 281-296, 2006.
[46] Y. Wang and Y. Yang, “Particle swarm optimization with preference order ranking for multi-objective optimization,” Information Sciences, Vol. 179, No. 12, pp. 1944-1959, 2009.
[47] D. Hrovat, “Survey of advanced suspension developments and related optimal control applications,” Automatica, Vol. 33, No. 10, pp. 1781-1817, 1997.

[48] C. O. Ourique, E. C. Biscaia, and J. C. Pinto, “The use of particle swarm optimization for dynamic analysis in chemical processes,” Computers & Chemical Engineering, Vol. 26, No. 12, pp. 1783-1793, 2002.
[49] F. Heppner and U. Grenander, “A stochastic nonlinear model for coordinated bird flocks”, The Ubiquity of Chaos, AAAS Publications , pp. 233-238, 1990.
[50] W. Gao and Z. Guo, “Research of Recurrent Wavelet Neural Network Speed Controller Based on Chaotic Series Adaptive PSO,” International Conference on Information Management, pp. 470-475, 2017.

指導教授

莊堯棠

審核日期

2019-6-27

推文