SAO-JIE CHENTsai, C.-C.C.-C.TsaiChen, Y.-L.Y.-L.ChenHu, Y.-H.Y.-H.Hu2018-09-102018-09-10199413502387http://www.scopus.com/inward/record.url?eid=2-s2.0-0028550945&partnerID=MN8TOARShttp://scholars.lib.ntu.edu.tw/handle/123456789/309239A general area router (GEAR) based on the planning approach is proposed and implemented. Two meta-planning techniques, graceful retreat and least impact, are used to manage the selection of net segments and the assignment of track resources. Apart from the novel application of these planning techniques, we have also consolidated many effective routing heuristics into GEAR so that it is able to solve a variety of difficult routing problems. These include channel routing, switchbox routing, staircase routing, rectilinear area routing with obstacles, and other general area routing problems. Extensive simulation results indicate that GEAR is very competitive compared with the best known special-purpose routers.[SDGs]SDG11Algorithms; Computer simulation; Heuristic methods; Planning; Resource allocation; Area routing; General area router; Graceful retreat; Least impact; Integrated circuit layoutjournal article10.1049/ip-cdt:199411602-s2.0-0028550945