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

Registro completo de metadados
MetadadosDescriçãoIdioma
Autor(es): dc.creatorSantos, Vinícius Gandra Martins-
Autor(es): dc.creatorCarvalho, Marco Antonio Moreira de-
Data de aceite: dc.date.accessioned2025-08-21T15:16:11Z-
Data de disponibilização: dc.date.available2025-08-21T15:16:11Z-
Data de envio: dc.date.issued2022-02-09-
Data de envio: dc.date.issued2022-02-09-
Data de envio: dc.date.issued2020-
Fonte completa do material: dc.identifierhttp://www.repositorio.ufop.br/jspui/handle/123456789/14475-
Fonte completa do material: dc.identifierhttps://www.sciencedirect.com/science/article/abs/pii/S0377221719305776-
Fonte completa do material: dc.identifierhttps://doi.org/10.1016/j.ejor.2019.07.013-
Fonte: dc.identifier.urihttp://educapes.capes.gov.br/handle/capes/1008598-
Descrição: dc.descriptionThe 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.-
Formato: dc.formatapplication/pdf-
Idioma: dc.languageen-
Direitos: dc.rightsrestrito-
Palavras-chave: dc.subjectCombinatorial optimization-
Palavras-chave: dc.subjectGraph layout-
Palavras-chave: dc.subjectAdaptive large neighborhood search-
Título: dc.titleTailored heuristics in adaptive large neighborhood search applied to the cutwidth minimization problem.-
Aparece nas coleções:Repositório Institucional - UFOP

Não existem arquivos associados a este item.