Please use this identifier to cite or link to this item:
Title: Tailored heuristics in adaptive large neighborhood search applied to the cutwidth minimization problem.
Authors: Santos, Vinícius Gandra Martins
Carvalho, Marco Antonio Moreira de
Keywords: Combinatorial optimization
Graph layout
Adaptive large neighborhood search
Issue Date: 2021
Citation: SANTOS, V. G. M.; CARVALHO, M. A. M. de. Tailored heuristics in adaptive large neighborhood search applied to the cutwidth minimization problem. European Journal of Operational Research, v. 289, p. 1056-1066, 2021. Disponível em: <>. Acesso em: 25 ago. 2021.
Abstract: The cutwidth minimization problem (CMP) consists in determining a linear layout (i.e., a one-dimensional arrangement), of the vertices of a graph that minimizes the maximum number of edges crossing any consecutive pair of vertices. This problem has applications, for instance, in design of very large-scale integration circuits, graph drawing, and compiler design. The CMP is an N P-Hard problem and presents a challenge to exact methods and heuristics. In this study, the metaheuristic adaptive large neighborhood search is applied to the CMP. The computational experiments include 11,786 benchmark instances from four sets in the literature, and the obtained results are compared with state-of-the-art methods. The proposed method was demonstrated to be competitive, as it matched most optimal and best known results, improved some of the (not proved optimal) best known solutions, and provided the first upper bounds for unsolved instances.
ISSN: 0377-2217
Appears in Collections:DECOM - Artigos publicados em periódicos

Files in This Item:
File Description SizeFormat 
  Restricted Access
643,02 kBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.