The bi-objective version of the obnoxious problem (noted Bi-OpM) occurs in more complex situations related to location of hazardous facilities, like nuclear or chemical power plants, waste storage facilities, and noisy or polluting services. Where is goal is to maximaze two antagonistic objective functions: the sum of the minimum distance between each customer and its nearest open facility, and the dispersion between facilities. Therefore, we propose to approximately solve the Bi-OpM by a hybrid method, where, the designed method starts with an archive set provided by tailoring an efficient greedy procedure. Next, intensification and diversification strategies were applied for enriching the diversity of the current Pareto front. Furthermore, an iterative ϵ-constraint procedure is applied for highlighting the final set of points. The proposed method is computationally analysed on benchmark instances of the literature, where its provided results were compared on those achieved by best metods of the literature. Encouraging results have been obtained.