One of the key issues in the design of a QoS-oriented service is how to identify a feasible route which satisfies multiple constraints while simultaneously achieving efficient utilization of network resource.The underlying problem can be stated as a Multiple Constraints Optimal Path (MCOP) problem.Recent years

some algorithms have been proposed in literature

but suffered from various disadvantages.They can not meet the practical requirements.In this paper

a formal definition of MCOP problem is stated.A novel enhanced heuristic for solving MCOP problem is proposed

in which elegant path searching techniques are used to achieve higher performance in terms of path selection success ratio and average path cost.Using extensive simulations on random graphs and random assigned link weights

the improvement of the new algorithm proposed is verified

and the impact of some key design parameters on the performance is discussed.