<p>The aim of this work is to develop a hybrid algorithm for solving bound constrained and constrained optimization problems with interval coefficients. The proposed algorithm is based on tournamenting process and differential evolution algorithm popularly known as tournament differential evolution. In this work, the said algorithm is extended using interval mathematics and interval ranking in order to make this algorithm compatible of solving optimization problems in interval environment. In this connection, ten bound constrained optimization problems with interval coefficients and ten constrained optimization problems with interval coefficients are considered and solved by the proposed algorithm. The results obtained from different variants of this algorithm are compared with each other. Also, to test the efficiency, two different variants of tournamenting adaptive Gaussian quantum particle swarm optimization algorithm, are used to compare the results obtained from different variants of tournament differential evolution algorithm. Finally, analysis of variance test is performed.</p>