Tailored heuristics in adaptive large neighborhood search applied to the cutwidth minimization problem.

Simple item page
dc.contributor.authorSantos, Vinícius Gandra Martins
dc.contributor.authorCarvalho, Marco Antonio Moreira de
dc.date.accessioned2022-02-10T18:12:14Z
dc.date.available2022-02-10T18:12:14Z
dc.date.issued2021pt_BR
dc.description.abstractThe 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.pt_BR
dc.identifier.citationSANTOS, 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: <https://www.sciencedirect.com/science/article/abs/pii/S0377221719305776>. Acesso em: 25 ago. 2021.pt_BR
dc.identifier.doihttps://doi.org/10.1016/j.ejor.2019.07.013pt_BR
dc.identifier.issn0377-2217
dc.identifier.urihttp://www.repositorio.ufop.br/jspui/handle/123456789/14475
dc.identifier.uri2https://www.sciencedirect.com/science/article/abs/pii/S0377221719305776pt_BR
dc.language.isoen_USpt_BR
dc.rightsrestritopt_BR
dc.subjectCombinatorial optimizationpt_BR
dc.subjectGraph layoutpt_BR
dc.subjectAdaptive large neighborhood searchpt_BR
dc.titleTailored heuristics in adaptive large neighborhood search applied to the cutwidth minimization problem.pt_BR
dc.typeArtigo publicado em periodicopt_BR
Files
Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
ARTIGO_TailoredHeuristicsAdaptive.pdf
Size:
643.02 KB
Format:
Adobe Portable Document Format
Description:
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description:
Download
Collections
DECOM - Artigos publicados em periódicos