NSGA-II based Multi-Objective Genetic Algorithm for Non-Slicing VLSI Floor Planning

VLSI floorplanning is a crucial step in chip design, directly impacting area, wirelength, and power consumption. This paper presents a non-dominated sorting genetic algorithm (NSGA-II) for non-slicing VLSI floorplanning, that incorporates a B*-tree representation and leverages the optimization framework to achieve multi-objective optimization of both area and wirelength. The B*-tree ensures efficient and compact representation of module placement, while NSGA-II uses crossover, mutation, and selection operators that preserve the structural properties of the B*-tree. We evaluate the proposed approach using the Gigascale Systems Research Center (GSRC) benchmark circuits. Experimental results demonstrate that our algorithm outperforms conventional methods, producing balanced Pareto-optimal solutions and effectively reducing area and wirelength.

Authors

Institutions

Publication Details

Published
2025-08-04
DOI
https://doi.org/10.1109/icscsa66339.2025.11170737
Primary Topic
Manufacturing Process and Optimization
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

NSGA-II based Multi-Objective Genetic Algorithm for Non-Slicing VLSI Floor Planning

Rahul Kumar Chaurasiya, José Aguilar
Manufacturing Process and Optimization
article

NSGA-II based Multi-Objective Genetic Algorithm for Non-Slicing VLSI Floor Planning

Rahul Kumar Chaurasiya, José Aguilar
article en

Abstract

VLSI floorplanning is a crucial step in chip design, directly impacting area, wirelength, and power consumption. This paper presents a non-dominated sorting genetic algorithm (NSGA-II) for non-slicing VLSI floorplanning, that incorporates a B*-tree representation and leverages the optimization framework to achieve multi-objective optimization of both area and wirelength. The B*-tree ensures efficient and compact representation of module placement, while NSGA-II uses crossover, mutation, and selection operators that preserve the structural properties of the B*-tree. We evaluate the proposed approach using the Gigascale Systems Research Center (GSRC) benchmark circuits. Experimental results demonstrate that our algorithm outperforms conventional methods, producing balanced Pareto-optimal solutions and effectively reducing area and wirelength.

Maulana Azad National Institute of Technology (IN)
Openalex Percentile: Top 63%
Manufacturing Process and Optimization
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.