The planar multiple obnoxious facilities location problem: A Voronoi based heuristic

•Two multiple obnoxious facilities problems are formulated and solved heuristically.•The proposed heuristic algorithms are based on Voronoi diagrams.•We compared our results with interior point and SNOPT solvers in Matlab.•For example, one instance was solved in 24 s compared with 5 h by Matlab.•The heuristic solution for this instance is 10 times better than interior point’s solution.