Computing Approximate Solutions of the Maximum Covering Problem with GRASP
Journal of Heuristics
The generalized maximal covering location problem
Computers and Operations Research - Location analysis
Dual-based heuristics for a hierarchical covering location problem
Computers and Operations Research
A maximal covering location model in the presence of partial coverage
Computers and Operations Research
The minimum weighted covering location problem with distance constraints
Computers and Operations Research
Solving the maximal covering location problem with heuristic concentration
Computers and Operations Research
Fuzzy logic based algorithms for maximum covering location problems
Information Sciences: an International Journal
A decomposition approach for the probabilistic maximal covering location-allocation problem
Computers and Operations Research
Path relinking approach for multiple allocation hub maximal covering problem
Computers & Mathematics with Applications
Planar maximal covering with ellipses
Computers and Industrial Engineering
Anticipatory routing of police helicopters
Expert Systems with Applications: An International Journal
Hi-index | 12.05 |
This paper presents a fuzzy maximal covering location problem (FMCLP) in which travel time between any pair of nodes is considered to be a fuzzy variable. A fuzzy expected value maximization model is designed for such a problem. Moreover, a hybrid algorithm of fuzzy simulation and simulated annealing (SA) is used to solve FMCLP. Some numerical examples are presented, solved and analyzed to show the performance of the proposed algorithm. The results show that the proposed SA finds solutions with objective values no worse than 1.35% below the optimal solution. Furthermore, the simulation-embedded simulated annealing is robust in finding solutions.