模拟退火基本知识
其伪代码如下:
例子:
poj 2420
题意:
平面上给你n个点(xi,yi),让你求一个点,到这n点的距离和最小。
限制:
1 <= n <= 100
0 <= xi,yi <= 1e4, 为整数
其伪代码如下:
Let s = s0
For k = 0 through k_max (exclusive):
T := temperature(k / k_max)
Pick a random neighbour, s_new := neighbour(s)
If P(E(s), E(s_new), T) > random(0, 1), move to the new state:
s := s_new
Output: the final state s
例子:
poj 2420
题意:
平面上给你n个点(xi,yi),让你求一个点,到这n点的距离和最小。
限制:
1 <= n <= 100
0 <= xi,yi <= 1e4, 为整数
/*poj 2420
题意:
平面上给你n个点(xi,yi),让你求一个点,到这n点的距离和最小。
限制:
1 <= n <= 100
0 <= xi,yi <= 1e4, 为整数
思路:
模拟退火
模拟退火基本知识:
其伪代码如下:
Let s = s0
For k = 0 through k_max (exclusive):
T := temperature(k / k_max)
Pick a random neighbour, s_new := neighbour(s)
If P(E(s),