In this paper, we propose a new population-based algorithm (PBA) that adjusts its search mechanism to the problem which is to be optimized. It uses a set of search operators used in commonly-used PBAs and this selection can be made freely. The proposed algorithm selects two operators from this set, i.e. one for exploration and the other for exploitation of the search space of the solution. This approach can be an alternative for finding new inspirations for the development of PBAs and for modifying the existing PBAs. The effectiveness of the proposed algorithm has been tested using typical benchmarks for testing PBAs. An interesting aspect of the performed simulations is the analysis of how operators are used during the optimization process.