Escape　routing　is　an　important　part　of　the　integrated　circuit　physical　design.　In　order　to　solve　the　problem　of　slow　parallel　escape　routing　with　unsatisfactory　outcomes,　an　algorithm　of　ordered　escape　routing,　combining　the　improved　A*　algorithm　with　the　rip-up　and　reroute　method　is　proposed.　Firstly,　the　routing　sequence　of　pins　is　determined　by　the　cost　estimation　function　and　the　improved　A*　algorithm　is　used　to　initialize　the　ordered　escape　routing.　Secondly,　the　routing　paths　of　the　same　length　are　optimized　and　the　routing　paths　of　the　crowded　areas　are　adjusted.　Finally,　A*　algorithm　and　breadth-first　search　are　employed　to　rip-up　and　reroute.　The　experimental　results　shows　that　this　method　achieved　100%　escape　routing　for　all　given　test　cases,　and　that　the　feasible　solution　of　the　ordered　escape　paths　is,　to　a　great　extent,　close　to　the　optimal　solution.　Compared　to　the　Boolean　Satisfiability　Problem　(SAT)　algorithm　and　MMCF　algorithm,　this　algorithm　reduces　CPU　time　by　95.6%　and　97.8%,　respectively,　and　makes　the　overall　line　length　shorter.　It　is　evident　that　the　proposed　method　reduces　the　time　required　to　find　the　feasible　solution　and　optimize　wire　routing.　©　2021,　Science　Press.　All　right　reserved.