In traditional routing algorithms, shortest-path algorithm (SPA) is often used. The distance between two nodes is defined as weight, and a path from the source node is selected to the destination node which has the minimum weight to finish routing. Although SPA minimizes the distance cost, it doesn′t consider the issue of energy consumption. So the routing path generated by SPA may not have the minimum energy cost. To solve this problem, a new integrated green routing algorithm is proposed. This algorithm defines energy consumption as the weight of each link. It combines optical bypass and traffic grooming and also considers routing and wavelength assignment (RWA) problem in order to minimize the energy cost of every routing process, which leads to energy-saving. The result of simulation shows that compared with SPA, green routing algorithm can save about 40% energy consumption in large-scale networks. Its energy-saving effect is considerable.