The Cyclic Bandwidth Problem is an important graph labeling problem with numerous applications. This work aims to advance the state-of-the-art of practically solving this computationally challenging problem. We present an effective heuristic algorithm based on the general iterated local search framework and integrating dedicated search components. Specifically, the algorithm relies on a simple, yet powerful local optimization procedure reinforced by two complementary perturbation strategies. The local optimization procedure discovers high-quality solutions in a particular search zone while the perturbation strategies help the search to escape local optimum traps and explore unvisited areas. We present intensive computational results on 113 benchmark instances from 8 different families, and show performances that are never achieved by current best algorithms in the literature.

循环带宽问题是许多应用中的重要图形标记问题。这项工作旨在提高实际解决此计算难题的最新技术。我们提出了一种有效的启发式算法，该算法基于通用的迭代本地搜索框架并集成了专用搜索组件。具体而言，该算法依赖于一个简单但功能强大的局部优化程序，该程序由两个互补的摄动策略加强。局部优化程序可在特定搜索区域内发现高质量的解决方案，而扰动策略可帮助搜索逃脱局部最优陷阱并探索未访问的区域。我们提供了来自8个不同家族的113个基准实例的大量计算结果，