Matheuristic Local Search for the Placement of Analog Integrated Circuits
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21730%2F24%3A00370658" target="_blank" >RIV/68407700:21730/24:00370658 - isvavai.cz</a>
Alternative codes found
RIV/68407700:21230/24:00370658
Result on the web
<a href="https://doi.org/10.1007/978-3-031-49662-2_10" target="_blank" >https://doi.org/10.1007/978-3-031-49662-2_10</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-031-49662-2_10" target="_blank" >10.1007/978-3-031-49662-2_10</a>
Alternative languages
Result language
angličtina
Original language name
Matheuristic Local Search for the Placement of Analog Integrated Circuits
Original language description
The suboptimal physical design of the integrated circuits may not only increase the manufacturing costs due to the larger size of the chip but can also impact its performance by placing interconnected rectangular devices too far from each other. In the domain of Analog and Mixed-Signal Integrated Circuits (AMS ICs), placement automation is lacking behind its digital counterpart, mainly due to the variety of components and complex constraints the placement needs to satisfy. Integer Linear Programming (ILP) is a suitable approach to modeling the placement problem for AMS ICs. However, not even state-of-the-art solvers can create high-quality placements for large problem instances. In this paper, we study how to improve the results of our previous ILP model, first by introducing additional constraints and second by using matheuristics. Given the initial solution we obtain using our original ILP model, we use the solver to perform a local search. We try to improve the criterion by considering only a few spatially close rectangles while keeping the rest of the placement fixed. This local search approach enables us to significantly improve the quality of instances whose solution space we could not sufficiently explore before, even when the computation time reserved for the matheuristic is limited. Finally, we evaluate our revised approach on synthetically generated instances containing more than 200 independent rectangles and on real-life problems.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2024
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Operations Research and Enterprise Systems, ICORES 2022, ICORES 2023
ISBN
978-3-031-49661-5
ISSN
1865-0929
e-ISSN
1865-0937
Number of pages
23
Pages from-to
178-200
Publisher name
Springer, Cham
Place of publication
—
Event location
Lisabon
Event date
Feb 19, 2023
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—