Multistart Iterated Tabu Search for Bandwidth Coloring Problem

Authors:
Xiangjing Lai;Zhipeng Lü
Affiliations:
School of Information Engineering, Jiangxi University of Science and Technology, 341000 Ganzhou, PR China and School of Computer Science and Technology, Huazhong University of Science and Technolo ...;School of Computer Science and Technology, Huazhong University of Science and Technology, 430074 Wuhan, PR China
Venue:
Computers and Operations Research
Year:
2013

Citing 11
Cited 0

On the use of some known methods for T-colorings of graphs

Annals of Operations Research - Special issue on Tabu search
Tabu Search for Frequency Assignment in Mobile Radio Networks

Journal of Heuristics
A Permutation Based Genetic Algorithm for Minimum Span Frequency Assignment

PPSN V Proceedings of the 5th International Conference on Parallel Problem Solving from Nature
Metaheuristics in combinatorial optimization: Overview and conceptual comparison

ACM Computing Surveys (CSUR)
Heuristic methods for graph coloring problems

Proceedings of the 2005 ACM symposium on Applied computing
Generalised graph colouring by a hybrid of local search and constraint programming

Discrete Applied Mathematics
An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem

Computers and Operations Research
Iterated Tabu Search for the Unconstrained Binary Quadratic Optimization Problem

Informatica
"Squeaky Wheel" optimization

Journal of Artificial Intelligence Research
Heuristics for the bandwidth colouring problem

International Journal of Metaheuristics
Coloring large graphs based on independent set extraction

Computers and Operations Research

Quantified Score

Hi-index	0.01

Visualization

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.