Current Volume 9
Survey of Metaheuristics for Steiner Trees, Wire-LengthDriven Routing, and Constrained Spanning TreeProblems in VLSI*
Abstract
Routing in Very Large-Scale Integration (VLSI) is a challenging task that involves managing interconnect length, congestion, power consumption, and timing. With the rapid growth of semiconductor technology, traditional algorithms like Integer Linear Programming (ILP) and dynamic programming often become too slow and impractical for large-scale circuits. Overcome this, metaheuristic algorithms such as Genetic Algorithms (GA), Simulated Annealing (SA), Ant Colony Optimization (ACO), and Particle Swarm Optimization (PSO) offer effective solutions. These algorithms are particularly useful for NP-hard problems like Steiner tree construction and wire-length optimization, striking a balance between accuracy and computational effort. This paper provides a comprehensive overview of metaheuristic applications in VLSI routing, analyzing their strengths, limitations, and real-world performance. It also highlights emerging trends like AI-powered optimization and hybrid algorithms. By offering valuable insights, this survey serves as a helpful resource for researchers and engineers navigating the complexities of modern VLSI design.
Keywords
VLSI Routing, Wire-Length Minimization, Steiner Tree Construction, Constrained Spanning Tree, Global Routing.
Citations
IRE Journals:
Jitendra Singh, Mantripragada Shabda Pyari "Survey of Metaheuristics for Steiner Trees, Wire-LengthDriven Routing, and Constrained Spanning TreeProblems in VLSI*" Iconic Research And Engineering Journals Volume 9 Issue 12 2026 Page 1845-1855 https://doi.org/10.64388/IREV9I12-1718966
IEEE:
Jitendra Singh, Mantripragada Shabda Pyari
"Survey of Metaheuristics for Steiner Trees, Wire-LengthDriven Routing, and Constrained Spanning TreeProblems in VLSI*" Iconic Research And Engineering Journals, 9(12) https://doi.org/10.64388/IREV9I12-1718966
About IRE Journals
IRE Journals is an open access online journals established with an aim to publish high quality of research work in various diciplines. We have more than 6 years in publications. Over 2500+ papers already published.
Important Links
For Authors
Volume 8:
Issue 1, Issue 2, Issue 3, Issue 4, Issue 5, Issue 6, Issue 7, Issue 8, Issue 9, Issue 10, Issue 11, Issue 12Volume 7:
Issue 1, Issue 2, Issue 3, Issue 4, Issue 5, Issue 6, Issue 7, Issue 8, Issue 9, Issue 10, Issue 11, Issue 12Volume 6:
Issue 1, Issue 2, Issue 3, Issue 4, Issue 5, Issue 6, Issue 7, Issue 8, Issue 9, Issue 10, Issue 11, Issue 12Volume 5:
Issue 1, Issue 2, Issue 3, Issue 4, Issue 5, Issue 6, Issue 7, Issue 8, Issue 9, Issue 10, Issue 11, Issue 12Volume 4:
Issue 1, Issue 2, Issue 3, Issue 4, Issue 5, Issue 6, Issue 7, Issue 8, Issue 9, Issue 10, Issue 11, Issue 12Volume 3:
Issue 1, Issue 2, Issue 3, Issue 4, Issue 5, Issue 6, Issue 7, Issue 8, Issue 9, Issue 10, Issue 11, Issue 12