Multistart Iterated Tabu Search for Bandwidth Coloring Problem

被引：16

作者：

Lai, Xiangjing ^{[1
,2
]}

Lu, Zhipeng ^{[2
]}

机构：

[1] Jiangxi Univ Sci & Technol, Sch Informat Engn, Ganzhou 341000, Peoples R China

[2] Huazhong Univ Sci & Technol, Sch Comp Sci & Technol, Wuhan 430074, Peoples R China

来源：

COMPUTERS & OPERATIONS RESEARCH | 2013年 / 40卷 / 05期

基金：

中国国家自然科学基金;

关键词：

Bandwidth Coloring; Bandwidth MultiColoring; Frequency Assignment; Iterated Tabu Search; Metaheuristics; Perturbation operator; LOCAL-SEARCH; ALGORITHM; OPTIMIZATION; ASSIGNMENT;

D O I：

10.1016/j.cor.2012.09.003

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

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. Crown Copyright (C) 2012 Published by Elsevier Ltd. All rights reserved.

引用

页码：1401 / 1409

页数：9

共 50 条

[1] Iterated local search with tabu search for the weighted vertex coloring problem
Nogueira, Bruno
Tavares, Eduardo
Maciel, Paulo
[J]. COMPUTERS & OPERATIONS RESEARCH, 2021, 125
[2] A Multistart Iterated Reactive Tabu Search for the L(2,1)-Labeling Problem
Luo, Liang
[J]. JOURNAL OF COMPUTATIONAL AND THEORETICAL NANOSCIENCE, 2015, 12 (03) : 391 - 394
[3] Backtracking based iterated tabu search for equitable coloring
Lai, Xiangjing
Hao, Jin-Kao
Glover, Fred
[J]. ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2015, 46 : 269 - 278
[4] Multistart Tabu Search and Diversification Strategies for the Quadratic Assignment Problem
James, Tabitha
Rego, Cesar
Glover, Fred
[J]. IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART A-SYSTEMS AND HUMANS, 2009, 39 (03): : 579 - 596
[5] Genetic, iterated and multistart local search for the maximum clique problem
Marchiori, E
[J]. APPLICATIONS OF EVOLUTIONARY COMPUTING, PROCEEDINGS, 2002, 2279 : 112 - 121
[6] Iterated tabu search for the car sequencing problem
Cordeau, Jean-Francois
Laporte, Gilbert
Pasin, Federico
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2008, 191 (03) : 945 - 956
[7] Iterated tabu search for the maximum diversity problem
Palubeckis, Gintaras
[J]. APPLIED MATHEMATICS AND COMPUTATION, 2007, 189 (01) : 371 - 383
[8] Tabu search for the cyclic bandwidth problem
Rodriguez-Tello, Eduardo
Romero-Monsivais, Hillel
Ramirez-Torres, Gabriel
Lardeux, Frederic
[J]. COMPUTERS & OPERATIONS RESEARCH, 2015, 57 : 17 - 32
[9] Multistart Tabu Search Strategies for the Unconstrained Binary Quadratic Optimization Problem
Gintaras Palubeckis
[J]. Annals of Operations Research, 2004, 131 : 259 - 282
[10] An adaptive multistart tabu search approach to solve the maximum clique problem
Wu, Qinghua
Hao, Jin-Kao
[J]. JOURNAL OF COMBINATORIAL OPTIMIZATION, 2013, 26 (01) : 86 - 108

← 1 2 3 4 5 →