Please use this identifier to cite or link to this item:
Full metadata record
DC FieldValueLanguage
dc.contributor.authorSantos, Vinícius Gandra Martins-
dc.contributor.authorCarvalho, Marco Antonio Moreira de-
dc.identifier.citationSANTOS, V. G. M.; CARVALHO, M. A. M. de. Adaptive large neighborhood search applied to the design of electronic circuits. Applied Soft Computing, v. 73, p. 14-23, dez. 2018. Disponível em: <>. Acesso em: 19 mar. 2019.pt_BR
dc.description.abstractIn this paper, a new algorithm is proposed for solving the Gate Matrix Layout Problem (GMLP). This combinatorial problem is -Hard and aims to determine the physical layout of the components of an electronic circuit in order to minimize the number of tracks required to connect its nets. By reducing the circuit area, it is possible to reduce manufacturing costs and also improve circuit performance. Computer-aided design of such layouts has direct practical applications in engineering and industry, including information technology, industrial processes automation, and consumer goods production. We propose new local search procedures combined in an Adaptive Large Neighborhood Search (ALNS) metaheuristic to generate solutions for the GMLP. To assess the quality of the proposed method, we have considered 1455 real-world and artificial instances from the literature and compared the proposed ALNS with the state-of-the-art method for the GMLP solution. The ALNS performance is robust as it matches 89% of known optimal solutions and also improves the best known results in some instances.pt_BR
dc.subjectGate matrix layoutpt_BR
dc.titleAdaptive large neighborhood search applied to the design of electronic circuits.pt_BR
dc.typeArtigo publicado em periodicopt_BR
Appears in Collections:DECOM - Artigos publicados em periódicos

Files in This Item:
File Description SizeFormat 
  Restricted Access
666,39 kBAdobe PDFView/Open

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