This paper investigates the problem of path calculation of multiple metric routing. Today's Internet routing is based on a single metric path selecting algorithm. The single metric path is a best effort service that can only support a path for one requirement. In order to support quality-of-service (QoS) call, the path is subject to multiple constraints on the routing metric. In many cases, the path finding problem is NP-complete. This paper proposes the widest-least cost routing algorithm that uses a cost metric that is based on a delay metric and influenced by the resource bandwidth metric and network state. This algorithm is a multiple metric routing algorithm that has the traffic distribution ability to serve a traffic engine ring. Our goal is to select the shortest path when the network link is not loaded, and perform traffic engineering to move traffic to the other path when the network load is heavy. We have studied the performance through simulation and compared it against other routing algorithms.