组合optimization的一个新的重新启动过程及其收敛性
A new restart procedure for combinatorial optimization and its convergence
摘要:
我们提出了一个新的迭代过程来优化重新启动元启发式算法来解决组合优化,它使用独立的算法执行。新的过程包括添加新的执行或延长现有的时间。这是在使用算法故障概率的替代的标准的基础上完成的,其中最优解被到目前为止最好的解替换。因此,它可以在实践中应用。我们证明,在概率为1的情况下,随着迭代次数的发散,所提出的过程的重新启动时间接近使找到解的预期时间最小化的最优值。我们建议的重新启动过程中,几个流动推销员问题的实例与数百或数千个城市。作为基本算法,我们使用了不同版本的蚁群优化算法。我们比较的结果,从重新启动过程与那些从基本算法。这是通过考虑两种方法的失败概率相等的计算成本。这种比较表明,当应用建议的重新启动程序,其故障概率是几个数量级低的显着增益。
英文摘要:
We propose a new iterative procedure to optimize the restart for meta-heuristic algorithms to solve combinatorial optimization, which uses independent algorithm executions. The new procedure consists of either adding new executions or extending along time the existing ones. This is done on the basis of a criterion that uses a surrogate of the algorithm failure probability, where the optimal solution is replaced by the best so far one. Therefore, it can be applied in practice. We prove that, with probability one, the restart time of the proposed procedure approaches, as the number of iterations diverges, the optimal value that minimizes the expected time to find the solution. We apply the proposed restart procedure to several Traveling Salesman Problem instances with hundreds or thousands of cities. As basic algorithm, we used different versions of an Ant Colony Optimization algorithm. We compare the results from the restart procedure with those from the basic algorithm. This is done by considering the failure probability of the two approaches for equal computation cost. This comparison showed a significant gain when applying the proposed restart procedure, whose failure probability is several orders of magnitude lower.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。