This paper describes a multistate one source one sink “s-t” problem based on multistate characters of network elements. By building a utility function considering reliability, time and cost, an approach with predator search Algorithm is formed to solve the problem. Finally, the paper runs different experiments with Matlab. By comparing the results with the approach using ant colony algorithm, the efficiency and feasibility are testified.