  Integrated circuit design automation tools are essential for the feasibility
of complex designs with millions of transistors. One of the steps performed
within the process is the routing of interconnections between components of a
circuit. This problem, which also aims to optimize the utilization of
connection resources, has been shown to be NP-Complete and requires heuristic
algorithms to look for the best achievable solutions. In this work, we present
a definition of this problem in context with a brief review of existing
solutions in the literature. Then, we propose a methodology for the development
of an original algorithm, which aims to differentiate itself, in certain
domains, from the solutions already proposed.
