This article presents a useful application of the Manta Ray Foraging Optimization (MRFO) algorithm for solving the adaptive infinite impulse response (IIR) system identification problem. The effectiveness of the proposed technique is validated on four benchmark IIR models for reduced order system identification. The stability of the proposed estimated IIR system is assured by incorporating a pole-finding and initialization routine in the search procedure of the MRFO algorithm and this algorithmic modification contributes to the MRFO algorithm when seeking stable IIR filter solutions. The absence of such a scheme, which is primarily the case with the majority of the recently published literature, may lead to the generation of an unstable IIR filter for unknown real-world instances (particularly when the estimation order increases). Experiments conducted in this study highlight that the proposed technique helps to achieve a stable filter even though large bounds for the design variables are considered. The convergence rate, robustness, and computational speed of MRFO for all the considered problems are investigated. The influence of the control parameters of MRFO on the design performances is evaluated to gain insight into the interaction between the three foraging strategies of the algorithm. Extensive statistical performance analyses employing various non-parametric hypothesis tests concerning the design consistency and convergence are conducted for comparison of the proposed MRFO-based approach with six other metaheuristic search procedures to investigate the efficiency. The results on the mean square error metric also highlight the improved solution quality of the proposed approach compared to the various techniques published in the literature.