Ant algorithm is a newly emerged stochastic searching optimization algorithm in recent years. It has been paid much attention to since the successful application in the famous travelling salesman problem. This paper further extends the idea of this new biological optimization strategy to some other hard combinatorial optimization problems, including the multi attribute situation which lack of efficient solving methods. The ability of optimization for the algorithm is tested experimentally which give encouraging results．