Kauffman-s NK景观上近视局部搜索的快速终止算法
An Algorithm to Effect Prompt Termination of Myopic Local Search on Kauffman-s NK Landscape
摘要:
在Kauffman-s NK模型中,近视局部搜索涉及在每个时间步中翻转N位决策串中的一个随机选择的位,并且如果具有更高的适应度则接受新的配置。一个问题是,该算法消耗了分配的计算资源的全部范围-由检查的替代配置的数量给出-即使期望搜索在没有具有更高适应度的邻居的时刻终止。否则,算法必须在每个时间步中计算所有N个邻居的适应度,消耗大量资源。为了解决这个问题,我描述了一种算法,它允许搜索逻辑上相对较早地终止,而不必在每个时间步评估所有N个邻居的适应度。我进一步建议,当两个算法的效率需要进行比较头对头,施加一个共同的限制的数量评估的替代品-计量-提供了必要的水平字段。
英文摘要:
In Kauffman-s NK model, myopic local search involves flipping one randomly-chosen bit of an N-bit decision string in every time step and accepting the new configuration if that has higher fitness. One issue is that, this algorithm consumes the full extent of computational resources allocated - given by the number of alternative configurations inspected - even though search is expected to terminate the moment there are no neighbors having higher fitness. Otherwise, the algorithm must compute the fitness of all N neighbors in every time step, consuming a high amount of resources. In order to get around this problem, I describe an algorithm that allows search to logically terminate relatively early, without having to evaluate fitness of all N neighbors at every time step. I further suggest that when the efficacy of two algorithms need to be compared head to head, imposing a common limit on the number of alternatives evaluated - metering - provides the necessary level field.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。