元启发算法：修订间差异

维基百科，自由的百科全书
交互式浏览历史
←上一版本下一版本→
删除的内容 添加的内容
可视化wikitext
→‎演算法：​ 內容擴充
第11行： 第11行：
*[[模擬退火|模擬退火法]] (Simulated annealing algorithm, SA)
*[[模擬退火|模擬退火法]] (Simulated annealing algorithm, SA)
*[[社会认知优化|社會認知算法]] (Social cognitive optimization, SCO)
*[[社会认知优化|社會認知算法]] (Social cognitive optimization, SCO)
*[[布谷鸟搜索算法|布穀鳥搜索算法]] (Cuckoo Search, CS) <ref>{{cite journal |author1=Yang, X. S. |author2=Deb, S |title=Cuckoo search via Lévy flights |journal=IEEE |date=2009 |pages=210-214 |doi=10.1109/NABIC.2009.5393690 |url=https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5393690}}</ref>
*[[蝙蝠算法]] (Bat algorithm, BA) <ref>{{cite journal |author1=Yang, X. S. |title=A New Metaheuristic Bat-Inspired Algorithm |journal=Nature Inspired Cooperative Strategies for Optimization (NICSO 2010) |date=2010 |pages=65-74 |url=https://link.springer.com/chapter/10.1007/978-3-642-12538-6_6}}</ref>
*[[萤火虫算法|螢火蟲算法]] (Firefly algorithm, FA) <ref name="Yang2010">{{cite book|author=Xin-She Yang|title=Nature-inspired Metaheuristic Algorithms|url=http://books.google.com/books?id=iVB_ETlh4ogC&pg=PR5|year=2010|publisher=Luniver Press|isbn=978-1-905986-28-6|pages=5–}}</ref>
*[[簡化群體演算法]] (Simplified swarm optimizatiom, SSO) <ref>{{cite journal |author1=Wei-Chang Yeh |title=An improved simplified swarm optimization |journal=''Knowledge-Based Systems'' |date=July 2015 |volume=82 |pages=60-69 |url=https://www.sciencedirect.com/science/article/pii/S0950705115000763?casa_token=nADHotZCIekAAAAA:TmenDw1paqhTmlbV8LW1zHnOOidhpD7aS4nqBYWipxjPrNh8bpoEPTLSpgMkVHTEp0WAo4BYM-Q}}</ref>
*[[簡化群體演算法]] (Simplified swarm optimizatiom, SSO) <ref>{{cite journal |author1=Wei-Chang Yeh |title=An improved simplified swarm optimization |journal=''Knowledge-Based Systems'' |date=July 2015 |volume=82 |pages=60-69 |url=https://www.sciencedirect.com/science/article/pii/S0950705115000763?casa_token=nADHotZCIekAAAAA:TmenDw1paqhTmlbV8LW1zHnOOidhpD7aS4nqBYWipxjPrNh8bpoEPTLSpgMkVHTEp0WAo4BYM-Q}}</ref>
*[[調和搜尋演算法]] (Harmony search, HS) <ref>{{cite journal |author1=Geem, Z. W. |author2=Kim, J. H. |author3=Loganathan, G. V. |title=A new heuristic optimization algorithm: harmony search |journal=simulation |date=2001 |volume=76 |issue=2 |pages=60-68 |url=https://journals.sagepub.com/doi/abs/10.1177/003754970107600201}}</ref>
*[[猴群演算法]] (Monkey algorithm) <ref>{{Cite journal|author=Ruiqing Zhao|author2= Wansheng Tang |url= https://www.researchgate.net/publication/228895335_Monkey_algorithm_for_global_numerical_optimization |title= Monkey algorithm for global numerical optimization|journal= ''Journal of Uncertain Systems''|year= 2008 |volume= 2 |issue= 3 |pages= 165-176 }}</ref>
*[[猴群演算法]] (Monkey algorithm) <ref>{{Cite journal|author=Ruiqing Zhao|author2= Wansheng Tang |url= https://www.researchgate.net/publication/228895335_Monkey_algorithm_for_global_numerical_optimization |title= Monkey algorithm for global numerical optimization|journal= ''Journal of Uncertain Systems''|year= 2008 |volume= 2 |issue= 3 |pages= 165-176 }}</ref>
*[[人工蜂群演算法]] (Artificial bee colony, ABC)<ref>{{cite journal |author1=D Karaboga |title=An idea based on honey bee swarm for numerical optimization |journal=Technical report-tr06 |date=2005 |volume=200 |pages=1-10 |url = https://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.714.4934&rep=rep1&type=pdf}}</ref>
*[[人工蜂群演算法]] (Artificial bee colony, ABC)<ref>{{cite journal |author1=D Karaboga |title=An idea based on honey bee swarm for numerical optimization |journal=Technical report-tr06 |date=2005 |volume=200 |pages=1-10 |url = https://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.714.4934&rep=rep1&type=pdf}}</ref>
*[[病毒最佳化演算法]] (Virus Optimization Algorithm, VOA)<ref>{{cite journal |author1=Liang, Yun-Chia |coauthors=Josue Rodolfo Cuevas Juarez |title=A novel metaheuristic for continuous optimization problems: Virus optimization algorithm |journal=Engineering Optimization |date=2016 |volume=48 |issue=1 |pages=73-93 |url=https://www.tandfonline.com/doi/abs/10.1080/0305215X.2014.994868}}</ref>
*[[病毒最佳化演算法]] (Virus Optimization Algorithm, VOA)<ref>{{cite journal |author1=Liang, Yun-Chia |coauthors=Josue Rodolfo Cuevas Juarez |title=A novel metaheuristic for continuous optimization problems: Virus optimization algorithm |journal=Engineering Optimization |date=2016 |volume=48 |issue=1 |pages=73-93 |url=https://www.tandfonline.com/doi/abs/10.1080/0305215X.2014.994868}}</ref>





2021年3月15日 (一) 16:39的版本

元啟發算法（英文：metaheuristic）, 又稱 萬能啟發式演算法、萬用啟發式演算法。在计算机科学和数学优化中，元启发是一种高级的程序或启发式算法，专门用于搜索、生成或选取一个启发式结果（局部搜索算法），该结果可以为一个最优化问题提供足够好的求解，尤其适用于信息不完备或者计算能力受限时的最优化问题。

特色

元啟發算法(metaheuristic)，meta 代表其比一般啟發式演算法在搜尋能力上更為高階。而 heuristic 則代表其算法能夠在一個合理的計算成本內找到一個接近真實最佳解的解，但啟發式演算法並不能夠保證其解的可行性與最佳性。[1] 啟發式算法獲得最佳解的方式通常是使用大量的試誤以在龐大的解空間中搜尋最佳解。元啟發算法皆在全域搜索與區域搜索中取得權衡，若算法著重區域搜索能力則容易落入區域最佳解陷阱，若著全域搜索則可能無法收斂解。

演算法

  1. ^ Zahra Beheshti; Siti Mariyam Hj. Shamsuddin. A Review of Population-based Meta-Heuristic Algorithm (PDF). Int. J. Advance. Soft Comput. Appl. March,2013, 5 (1): 1–35. 
  2. ^ Yang, X. S.; Deb, S. Cuckoo search via Lévy flights. IEEE. 2009: 210–214. doi:10.1109/NABIC.2009.5393690. 
  3. ^ Yang, X. S. A New Metaheuristic Bat-Inspired Algorithm. Nature Inspired Cooperative Strategies for Optimization (NICSO 2010). 2010: 65–74. 
  4. ^ Xin-She Yang. Nature-inspired Metaheuristic Algorithms. Luniver Press. 2010: 5–. ISBN 978-1-905986-28-6. 
  5. ^ Wei-Chang Yeh. An improved simplified swarm optimization. Knowledge-Based Systems. July 2015, 82: 60–69. 
  6. ^ Geem, Z. W.; Kim, J. H.; Loganathan, G. V. A new heuristic optimization algorithm: harmony search. simulation. 2001, 76 (2): 60–68. 
  7. ^ Ruiqing Zhao; Wansheng Tang. Monkey algorithm for global numerical optimization. Journal of Uncertain Systems. 2008, 2 (3): 165–176. 
  8. ^ D Karaboga. An idea based on honey bee swarm for numerical optimization. Technical report-tr06. 2005, 200: 1–10. 
  9. ^ Liang, Yun-Chia; Josue Rodolfo Cuevas Juarez. A novel metaheuristic for continuous optimization problems: Virus optimization algorithm. Engineering Optimization. 2016, 48 (1): 73–93. 
取自“https://zh.wikipedia.org/w/index.php?title=元启发算法&oldid=64782348”