The　Steiner　minimum　tree　is　the　optimal　connection　model　for　solving　the　routing　problem　of　very　large-scale　integration.　However,　modern　chips　often　contain　various　obstacles,　such　as　macro　cells　and　IP　blocks,　making　the　construction　of　Steiner　minimum　trees　more　challenging.　Moreover,　considering　the　excellent　wirelength　optimization　capabilities　of　X-architecture　routing　and　the　promising　application　of　the　sparrow　search　algorithm　in　solving　NP-hard　problems,　this　paper　proposes　a　discrete　sparrow　search　optimization-based　X-architecture　obstacle-avoiding　Steiner　minimal　tree　algorithm　(DSSA_OAXSMT).　Firstly,　a　sparrow　representation　method　based　on　edge-point　pairs　and　an　efficient　fitness　calculation　method　are　proposed,　coupled　with　a　sparrow　population　update　mechanism　based　on　discrete　mutation　and　crossover　operations,　which　address　the　discrete　X-architecture　obstacle-avoiding　Steiner　minimum　tree　problem.　Secondly,　a　preprocessing　strategy　is　proposed　to　avoid　redundant　calculations.　Thirdly,　a　hybrid　initialization　strategy　is　introduced,　which　combines　the　greedy　approach　and　the　roulette　wheel　selection　method　to　enhance　the　diversity　of　the　initial　population.　Fourthly,　an　adjustment　strategy　based　on　detours　is　developed　to　meet　obstacle　constraints.　Finally,　a　mixed　refinement　strategy　is　proposed,　which　incorporates　a　local　refinement　strategy　based　on　shared　edges　and　an　optimization　strategy　based　on　crossover　detection　and　handling,　enabling　further　optimization　of　the　wirelength　cost.　Experimental　results　show　that　the　proposed　algorithm　achieves　superior　wirelength　optimization　compared　with　similar　works.　©　2025　Journal　of　Computer　Engineering　and　Applications　Beijing　Co.,　Ltd.;　Science　Press.　All　rights　reserved.