Loading...
Search for:
maximal-covering-location
0.004 seconds
The capacitated maximal covering location problem with heterogeneous facilities and vehicles and different setup costs: An effective heuristic approach
, Article International Journal of Industrial Engineering Computations ; Volume 12, Issue 1 , 2020 , Pages 79-90 ; Akhavan Niaki, S. A ; Akhavan Niaki, S. T ; Sharif University of Technology
Growing Science
2020
Abstract
In this research, a maximal covering location problem (MCLP) with real-world constraints such as multiple types of facilities and vehicles with different setup costs is taken into account. An original mixed integer linear programming (MILP) model is constructed in order to find the optimal solution. Since the problem at hand is shown to be NP-hard, a constructive heuristic method and a meta-heuristic approach based on genetic algorithm (GA) are developed to solve the problem. To find the most effective solution technique, a set of problems of different sizes is randomly generated and solved by the proposed solution methods. Computational results demonstrate that the heuristic method is...
The large-scale dynamic maximal covering location problem
, Article Mathematical and Computer Modelling ; Volume 57, Issue 3-4 , February , 2013 , Pages 710-719 ; 08957177 (ISSN) ; Davari, S ; Sisakht, S. A. H ; Sharif University of Technology
2013
Abstract
Most of the publications regarding the maxim covering location problem (MCLP) address the case where the decision is to be made for one period. In this paper, we deal with a rather untouched version of MCLP which is called dynamic MCLP (DMCLP). In order to solve this problem, a simulated annealing (SA) has been presented. The proposed solution algorithm is capable of solving problems with up to 2500 demand nodes and 200 potential facilities with a fair amount of exactness. Our experiments showed that the proposed approach finds solutions with errors less than one percent
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...
Developing a Model for the Maximal Covering Location Problem Considering Different Facilities, Set up Costs and Transportation Modes
, M.Sc. Thesis Sharif University of Technology ; Akhavan Niaki, Taghi (Supervisor)
Abstract
Facility location decisions are critical elements in strategic planning processes for a wide range of private and public firms. High costs associated with facility location and construction make facility location or relocation projects long-term investments. One of the most popular models among facility location models is the covering problem. This is due to its application in real life, especially for service and emergency facilities. Set covering problem (SCP) and the maximal covering location problem (MCLP) are two categories of the covering models. The presented model in this study is based on the maximal covering location problemwhile considering some real¬ life constraintssuch as...
The large scale maximal covering location problem
, Article Scientia Iranica ; Volume 18, Issue 6 , December , 2011 , Pages 1564-1570 ; 10263098 (ISSN) ; Davari, S ; Haddad Sisakht, S. A ; Sharif University of Technology
2011
Abstract
The maximal covering location problem (MCLP) is a challenging problem with numerous applications in practice. Previous publications in the area of MCLP proposed models and presented solution methodologies to solve this problem with up to 900 nodes. Due to the fact that in real-life applications, the number of nodes could be much higher, this paper presents a customized Genetic Algorithm (GA) to solve MCLP instances, with up to 2500 nodes. Results show that the proposed approach is capable of solving problems with a fair amount of exactness. In order to fine-tune the algorithm, Tukey's Least Significant Difference (LSD) tests are employed on a set of test problems