GRASP with path relinking heuristics for the antibandwidth problem

Authors:
A. Duarte;R. Martí;M. G. C. Resende;R. M. A. Silva
Affiliations:
Departamento de Ciencias de la Computación, Universidad Rey Juan Carlos, Tulipán s/n, 28933 Móstoles (Madrid), Spain;Departamento de Estadística e Investigación Operativa, Facultad de Matematicas, Universidad de Valencia, Dr. Moliner 50, 46100 Burjassot (Valencia), Spain;Algorithms and Optimization Research Department, AT&T Labs Research, 180 Park Avenue, Room C241, Florham Park, New Jersey 07932;Computational Intelligence and Optimization Group, Department of Computer Science, Federal University of Lavras, C.P. 3037, CEP 37200-000, Lavras, MG, Brazil
Venue:
Networks
Year:
2011

Citing 0
Cited 4

Variable neighborhood search with ejection chains for the antibandwidth problem

Journal of Heuristics
Variable Formulation Search for the Cutwidth Minimization Problem

Applied Soft Computing
A GRASP with path-relinking heuristic for the survivable IP/MPLS-over-WSON multi-layer network optimization problem

Computers and Operations Research
A hybrid metaheuristic for the cyclic antibandwidth problem

Knowledge-Based Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

This article proposes a linear integer programming formulation and several heuristics based on GRASP and path relinking for the antibandwidth problem. In the antibandwidth problem, one is given an undirected graph with n nodes and must label the nodes in a way that each node receives a unique label from the set {1, 2,…,n}, such that, among all adjacent node pairs, the minimum difference between the node labels is maximized. Computational results show that only small instances of this problem can be solved exactly (to optimality) with a commercial integer programming solver and that the heuristics find high-quality solutions in much less time than the commercial solver. © 2010 Wiley Periodicals, Inc. NETWORKS, Vol. 58(3), 171–189 2011 © 2011 Wiley Periodicals, Inc.