模拟退火中的可变退火长度与并行性
Variable Annealing Length and Parallelism in Simulated Annealing
AI总结:
针对模拟退火需预设退火长度的问题,提出基于指数递增退火长度的无参数重启调度及并行扩展方案,在NP-Hard调度问题上验证了其作为任意时间算法的显著性能优势。
摘要:
本文提出:(a)一种自适应模拟退火器的重启调度策略,以及(b)采用自适应无参数退火调度的并行模拟退火方法。本方法的基础是Modified Lam(修正拉姆)退火调度,该调度可自适应控制温度参数,以跟踪邻域状态接受率的理论理想值。Modified Lam模拟退火的串行实现几乎是无参数的,但需要预先知晓退火长度。我们采用退火长度指数递增的重启策略消除了该参数。随后我们将该重启调度扩展到并行实现,即并行运行多个Modified Lam模拟退火器,各退火器初始退火长度不同,并采用我们提出的并行退火长度调度。为验证方法有效性,我们在一个带序列依赖设置约束的NP-Hard调度问题上开展实验,将本方法与固定长度重启的串行、并行版本分别对比。结果表明,本方法在运行全程均可实现显著性能提升,证明其是一种有效的任意时间(anytime)算法。
英文摘要:
In this paper, we propose: (a) a restart schedule for an adaptive simulated annealer, and (b) parallel simulated annealing, with an adaptive and parameter-free annealing schedule. The foundation of our approach is the Modified Lam annealing schedule, which adaptively controls the temperature parameter to track a theoretically ideal rate of acceptance of neighboring states. A sequential implementation of Modified Lam simulated annealing is almost parameter-free. However, it requires prior knowledge of the annealing length. We eliminate this parameter using restarts, with an exponentially increasing schedule of annealing lengths. We then extend this restart schedule to parallel implementation, executing several Modified Lam simulated annealers in parallel, with varying initial annealing lengths, and our proposed parallel annealing length schedule. To validate our approach, we conduct experiments on an NP-Hard scheduling problem with sequence-dependent setup constraints. We compare our approach to fixed length restarts, both sequentially and in parallel. Our results show that our approach can achieve substantial performance gains, throughout the course of the run, demonstrating our approach to be an effective anytime algorithm.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。