The fractal image compression is a recent tool for encoding natural images. It builds on the local self-similarities and the generation of copies of blocks based on mathematical transformations. The technique seems interesting in both theory and application but have a drawback renders in real-time usage due to the high resource requirement when encoding big data. By another way, heuristics algorithms represent a set of approaches used to solve hard optimisation tasks with rational resources consumption. They are characterised with their fast convergence and reducing of research complexity. The purpose of this paper is to provide, and for the first time, more detailed study about the Wolf Pack Algorithm for the fractal image compression. The whole Image is considered as a space search where this space is divided on blocks, the scooting wolves explore the space to find other smaller block which have a similarity with based on its parameters. Scooting wolfs perused the whole space a selected the blocks with the best fitness. The process will be stopped after a fixed number of iterations or if no improvement in lead wolf solution. Results show that compared with the exhaustive search method, the proposed method greatly reduced the encoding time and obtained a rather best compression ratio. The performed experiments showed its effectiveness in the resolution of such problem. Moreover, a brief comparison with the different methods establishes this advantage.