Multistart Iterated Tabu Search for Bandwidth Coloring Problem |
| |
Authors: | Xiangjing Lai,Zhipeng Lü |
| |
Affiliation: | 1. School of Information Engineering, Jiangxi University of Science and Technology, 341000 Ganzhou, PR China;2. School of Computer Science and Technology, Huazhong University of Science and Technology, 430074 Wuhan, PR China |
| |
Abstract: | This paper presents a Multistart Iterated Tabu Search (MITS) algorithm for solving Bandwidth Coloring Problem (BCP) and Bandwidth MultiColoring Problem (BMCP). The proposed MITS algorithm exhibits several distinguishing features, such as integrating an Iterated Tabu Search (ITS) algorithm with a multistart method and a problem specific perturbation operator. Tested on two sets of 66 public benchmark instances widely used in the literature, the MITS algorithm achieves highly competitive results compared with the best performing algorithms, improving the previous best known results for 22 instances while matching the previous best known results for 39 ones. Furthermore, two important features of the proposed algorithm are analyzed. |
| |
Keywords: | Bandwidth Coloring Bandwidth MultiColoring Frequency Assignment Iterated Tabu Search Metaheuristics Perturbation operator |
本文献已被 ScienceDirect 等数据库收录! |
|