Path Relinking for Bandwidth Coloring Problem

TL;DR

This paper introduces a Path Relinking algorithm for the Bandwidth Coloring and MultiColoring problems, combining population relinking and tabu search, achieving state-of-the-art results on benchmark instances.

Contribution

It presents a novel hybrid Path Relinking algorithm that significantly improves solution quality for bandwidth coloring problems compared to existing methods.

Findings

Improves best known results for 15 instances

Matches best results for 47 instances

Demonstrates high efficiency and competitiveness

Abstract

A Path Relinking algorithm is proposed for the Bandwidth Coloring problem and the Bandwidth MultiColoring problem. It combines a population based relinking method and a tabu search based local search procedure. The proposed algorithm is assessed on two sets of 66 benchmark instances commonly used in the literature. Computational results demonstrate that the proposed algorithm is highly competitive in terms of both solution quality and efficiency compared to the best performing algorithms in the literature. Specifically, it improves the previous best known results for 15 out of 66 instances, while matching the previous best known results for 47 cases. Some key elements of the proposed algorithm are investigated.