Graphene nanoribbon (GNR) interconnects offer promising electrical properties for nanoscale VLSI design. However, GNR interconnects have a noticeable routing constraints. We can only bend the GNR interconnect at angles of \(0^{\circ }\) , \(60^{\circ }\) , and \(120^{\circ }\) . Furthermore, there are many obstacles that may arise due to the placement of physical components in the layout. These constraints impose significant challenges in the design of efficient routing paths. In addition, the length of the routing path and the bending angles determine the routing cost for GNR interconnects. This work introduces a routing algorithm for single-source and many-sink terminals for the GNR interconnect in the presence of rectangular obstacles with the objective of minimizing interconnect resistance and interconnect delay. The algorithm is applied on a randomly generated dataset. The experimental results generate low-cost obstacle-aware routing solutions for GNR interconnects, demonstrating its effectiveness.