31
个编辑
更改
跳到导航
跳到搜索
第256行：
第256行： − +
无编辑摘要
The following pseudocode presents the simulated annealing heuristic as described above. It starts from a state and continues until a maximum of steps have been taken. In the process, the call should generate a randomly chosen neighbour of a given state ; the call should pick and return a value in the range , uniformly at random. The annealing schedule is defined by the call , which should yield the temperature to use, given the fraction of the time budget that has been expended so far.
The following pseudocode presents the simulated annealing heuristic as described above. It starts from a state and continues until a maximum of steps have been taken. In the process, the call should generate a randomly chosen neighbour of a given state ; the call should pick and return a value in the range , uniformly at random. The annealing schedule is defined by the call , which should yield the temperature to use, given the fraction of the time budget that has been expended so far.
下面的伪代码展示了上面描述的模拟退火启发式代码。它从状态<math>s<sub>0</sub></math>开始，一直持续到已经采取了最多<math>k<sub>max</sub></math>个步骤。在这个过程中，调用<math>neighbour(s)</math>应该通过随机选择产生一个给定状态为<math>s</math>的邻居; 调用<math>random(0,1)</math>应该均匀且随机地选择并返回一个范围在<math>[0,1]</math>内的值。退火时间表由调用<math>temperature(r)</math>定义，给定到目前为止所花费的时间预算的分数<math>r<\math>，调用该温度来产生要使用的温度。
下面的伪代码展示了上面描述的模拟退火启发式代码。它从状态<math>s<sub>0</sub></math>开始，一直持续到已经采取了最多<math>k<sub>max</sub></math>个步骤。在这个过程中，调用<math>neighbour(s)</math>应该通过随机选择产生一个给定状态为<math>s</math>的邻居; 调用<math>random(0,1)</math>应该均匀且随机地选择并返回一个范围在<math>[0,1]</math>内的值。退火时间表由调用<math>temperature(r)</math>定义，给定到目前为止所花费的时间预算的分数<math>r</math>，调用该温度来产生要使用的温度。