In　this　paper,　using　the　Bregman　distance　technique,　we　introduce　a　proximal-type　algorithm　for　solving　equilibrium　problems　when　the　bifunction　is　pseudomonotone　in　real　Hilbert　spaces.　The　proposed　algorithm　involves　only　one　strongly　convex　minimization　subproblem,　which　makes　our　algorithm　more　effective　than　some　existing　algorithms　in　the　literature.　Under　certain　standard　assumptions,　we　obtain　a　weak　convergence　result　using　the　proposed　algorithm.　Finally,　we　present　numerical　experiments　to　illustrate　the　performance　and　applicability　of　our　proposed　algorithm.