Detailed　routing　problem　has　become　more　challenging　in　the　advanced　technology　nodes　due　to　the　extreme　scaling　of　chip　size　and　the　complicated　design　rules.　In　this　paper,　we　present　an　effective　algorithm　for　initial　detailed　routing　considering　connectivity　constraints　and　design　rules.　Firstly　we　present　an　valid　pin-access　candidates　generation　technology　for　handling　complex　pin　shapes.　Then,　we　propose　a　tree-based　net＇s　components　rearrangement　algorithm　to　decide　connect　order　for　multiple　nets＇　components.　Finally,　honoring　routing　preference　metrics　and　advanced　technology　nodes,　a　multi-threaded　algorithm　is　presented　to　achieve　initial　detailed　routing　results.　Experimental　results　on　industrial　benchmarks　show　that,　our　proposed　algorithm　not　only　achieves　high-quality　routing　result　in　a　reasonable　runtime,　but　also　eliminates　all　the　routing　constraints　efficiently.　©　2019　IEEE.