“…Whereas a cyclic mapping does not necessarily have a fixed point, it is desirable to determine an element x which is somehow closest to Tx: More precisely, an element x for which the error dðx, TxÞ assumes the least possible value distðA, BÞ where distðA, BÞ = inf fdðx, yÞ: x ∈ A, y ∈ Bg, such a point is called a best proximity point of the cyclic mapping T: Since 2003, research on best proximity points of cyclic mapping became an important topic in nonlinear analysis and has been studied by many authors [2][3][4][5][6][7][8].…”