Loading...
Search for:
elliptical-coverage
0.008 seconds
Planar maximal covering location problem with inclined ellipses
, Article Applied Mechanics and Materials, 29 July 2011 through 31 July 2011 ; Volume 110-116 , July , 2012 , Pages 4861-4866 ; 16609336 (ISSN) ; 9783037852620 (ISBN) ; Jokar, M. R. A ; Int. Assoc. Comput. Sci. Inf. Technol. (IACSIT) ; Sharif University of Technology
Abstract
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
Locating Wireless Transmitters by Using Maximal Covering Location Problem and Hata Model
, M.Sc. Thesis Sharif University of Technology ; Akbari Jokar, Mohammad Reza (Supervisor)
Abstract
Locating wireless transmitters is one of the most important issues. That’s why many researchers have worked in this subject recently. Communication Engineers always want to optimize the productivity of wireless transmitters. They prefer to cover a region completely by minimum cost, so they use analytical tools for solving this kind of problems. This type of optimization is very useful for cellular Networks. There is a different kind of wireless services such as high-speed Internet services; their goal is maximizing the covered demand points by minimum cost not covering all of them. Experts use maximal covering location problem for modeling this kind of problems. At first, an extension of one...