We proposed a new Global Routing algorithm solving the net ordering problem. The algorithm uses random optimization methods to keep the equality of earlier routed nets and later routed one in passing congested areas. It can find solution independent of net ordering in short time. A global router is implemented in this method. Experiments show that the router performs much faster than Matula_Router while gets solutions with approximate quality.