Skip to Main content Skip to Navigation
Journal articles

A learning-based path relinking algorithm for the bandwidth coloring problem

Abstract :

This paper proposes a learning-based path relinking algorithm (LPR) for solving the bandwidth coloring problem and the bandwidth multicoloring problem. Based on the population path-relinking framework, the proposed algorithm integrates a learning-driven tabu optimization procedure and a path-relinking operator. LPR is assessed on two sets of 66 common benchmark instances, and achieves highly competitive results in terms of both solution quality and computational efficiency compared to the state-of-the-art algorithms in the literature. Specifically, the algorithm establishes 7 new upper bounds while matching the best known results for 56 cases. The impacts of the learning mechanism and the path relinking operators are investigated, confirming their critical role to the success of the proposed algorithm.

Document type :
Journal articles
Complete list of metadatas
Contributor : Okina Université d'Angers <>
Submitted on : Thursday, December 8, 2016 - 2:57:03 PM
Last modification on : Monday, June 1, 2020 - 4:54:02 PM




Xiangjing Lai, Jin-Kao Hao, Zhipeng Lü, Fred Glover. A learning-based path relinking algorithm for the bandwidth coloring problem. Engineering Applications of Artificial Intelligence, Elsevier, 2016, 52, pp.81-91. ⟨10.1016/j.engappai.2016.02.008⟩. ⟨hal-01412522⟩



Record views