期刊名称：International Journal of Industrial Engineering Computations
印刷版ISSN：1923-2926
电子版ISSN：1923-2934
出版年度：2011
卷号：2
期号：2
页码：439-448
DOI：10.5267/j.ijiec.2011.01.003
语种：English
出版社：Growing Science Publishing Company
摘要：The maximal covering location problem (MCLP) seeks to locate a predefined number offacilities in order to maximize the number of covered demand points. In a classical sense,MCLP has three main implicit assumptions: all or nothing coverage, individual coverage, andfixed coverage radius. By relaxing these assumptions, three classes of modelling formulationsare extended: the gradual cover models, the cooperative cover models, and the variable radiusmodels. In this paper, we develop a special form of MCLP which combines the characteristicsof gradual cover models, cooperative cover models, and variable radius models. The proposedproblem has many applications such as locating cell phone towers. The model is formulated asa mixed integer non-linear programming (MINLP). In addition, a simulated annealingalgorithm is used to solve the resulted problem and the performance of the proposed method isevaluated with a set of randomly generated problems.
