Abstract—The difficulties associated with using mathematical optimization problems have contributed to the development of alternative solution1s. The formal methods often fail in solving NP-hard applications of the large size. To overcome this problem, several metaheuristic algorithm have been suggested. In this paper a modified optimization algorithm inspired by wild dog packs is suggested, the new approach solved the drawback of the wild dog packs optimization by using a set of harmony search whenever a local minimum is detected. Benchmark comparisons among the algorithms are presented for eight functions. The suggested algorithm outperforms various other mataheuristics algorithms for several configurations and dimensions.