In this paper, we propose a heuristic multicast routing algorithm, which minimizes the cost while satisfying both the wavelength required and hop length selection. The algorithm consists of two subproblems: the wavelength assignment & the routing path selection. For solving the wavelength assignment subproblem, an auxiliary graph is created where by the nodes and the links in the original network are transformed to the edges and the vertices, respectively, and the same availability wavelength of each edge is taken into a multicast group. Furthermore, for solving the routing path selection subproblem, the shortest-path routing strategy is adopted to choose transmission path between two multicast groups. Simulation results show that our algorithm performs much better than previously proposed algorithms with increasing call-connection probability by 28% and reducing the blocking probability by 52%.