4.7 Article

A new iterated local search algorithm for the cyclic bandwidth problem

期刊

KNOWLEDGE-BASED SYSTEMS
卷 203, 期 -, 页码 -

出版社

ELSEVIER
DOI: 10.1016/j.knosys.2020.106136

关键词

Heuristic; Computational methods; Cyclic bandwidth minimization; Graph labeling; Combinatorial optimization

资金

  1. Franco-Chinese PHC Cooperation Program [41342NC]
  2. China Scholarship Council [201608070103]
  3. Mexican Secretariat of Public Education [00114]

向作者/读者索取更多资源

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. (C) 2020 Elsevier B.V. All rights reserved.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据