Planar Maximal Covering Location Problem with Inclined Ellipses

aximum coverage location problem is considered in this study. Extension of this problem is investigated for situations that coverage areas are elliptical; these ellipses can locate anywhere on the plane with any angle. Mixed integer nonlinear programming (MINLP) is applied for formulation. This problem can be used in many practical situations such as locating wireless transmitter towers. A heuristic algorithm named MCLPEA for solving this problem was designed. This algorithm can produce very good results in efficient running time. Finally, the comparison of the results for this study was carried done.