<p>The filled function method is one of the deterministic approaches for solving an unconstrained global optimization problem (GOP). Many scholars have addressed the shortcomings of the filled function in parameterization and the use of exponential functions. One of the currently open and rarely studied obstacles is determining the search direction when minimizing the filled function, which is usually done using the coordinate directions. This direction is no longer relevant as the problem’s dimensions increase. To resolve this dilemma, a non-direction-based minimization procedure is needed. The method that falls into this characteristic is the DIRECT method. In this paper, we propose the EDECT algorithm. This new algorithm is the hybridization of the filled function and the DIRECT methods. In numerical simulation, we not only solve trivial problems that are usually solved using the filled function method, but also problems that are considered a high standard for testing the reliability of a global minimization method, i.e., the GKLS generator problems. Furthermore, to ensure that the EDECT algorithm is competitive and applicable, we have carried out numerical comparisons and applied it to the data clustering problem. The numerical results show that the EDECT algorithm is an effective and efficient method for solving global optimization problems.</p>