黑洞优化与散点搜索在约束满足和蛋白质结构预测中的应用
1. 黑洞优化算法
黑洞优化算法是一种用于解决约束满足问题(CSP)的启发式优化方法。以下是其具体步骤:
Algorithm 1. Black Hole Optimization
1: Initialize a population of stars with random locations in the search space;
2: while t < T do
3:
for all xi do
4:
Evaluate the objective function in fi;
5:
Select the best star that has the best fitness value as the black hole xBH;
6:
Change the location of each star according to Eq. 1
7:
if fi < fBH then
8:
Exchange their locations;
9:
end if
10:
if R < xi then
11:
Replace it with a new star in a random location in the search space;
12:
end if
13:
end for
14: end while
15: Postprocess results and visualizatio
超级会员免费看
订阅专栏 解锁全文

1001

被折叠的 条评论
为什么被折叠?



