Two stage Ordered Escape Routing combined with LP and heuristic algorithm for large scaled PCB

Disi Lin, Chuandong Chen, Rongshan Wei, Qinghai Liu, Huan He, Ziran Zhu, Zhifeng Lin, Jianli Chen

Abstract: Highlights•This paper proposes an efficient two-stage escape routing method for large-scale PCBs to minimize wiring length and runtime, which combines linear programming strategy and heuristic algorithm.•The method first models the OER problem as MMCF and uses LP to solve it. Then, the method proposes a heuristic algorithm to locate congestion quickly. Finally, the method reduces local area capacity and optimizes global automatic congestion.•Compared with the state-of-the-art work, experimental results show that the method can reduce the routing time by 60% and handle larger-scale PCB escape routing problems.