Computers and Operations Research
Tabu Search
Computing Approximate Solutions of the Maximum Covering Problem with GRASP
Journal of Heuristics
An Experimental Evaluation of a Scatter Search for the Linear Ordering Problem
Journal of Global Optimization
A Template for Scatter Search and Path Relinking
AE '97 Selected Papers from the Third European Conference on Artificial Evolution
Grasp and Path Relinking for 2-Layer Straight Line Crossing Minimization
INFORMS Journal on Computing
A Hybrid GRASP with Perturbations for the Steiner Problem in Graphs
INFORMS Journal on Computing
Scatter Search: Methodology and Implementations in C
Scatter Search: Methodology and Implementations in C
A scatter search approach for the minimum sum-of-squares clustering problem
Computers and Operations Research
Minimizing Labor Requirements in a Periodic Vehicle Loading Problem
Computational Optimization and Applications
First vs. best improvement: An empirical study
Discrete Applied Mathematics - Special issue: IV ALIO/EURO workshop on applied combinatorial optimization
Grasp Embedded Scatter Search for the Multicommodity Capacitated Network Design Problem
Journal of Heuristics
Optimal switch location in mobile communication networks using hybrid genetic algorithms
Applied Soft Computing
Path relinking approach for multiple allocation hub maximal covering problem
Computers & Mathematics with Applications
Hi-index | 0.00 |
We propose a metaheuristic procedure based on the scatter search approach for solving two location problems with few facilities (p ≤ 10).The first problem is the well-known p-center problem. The second one is the maximum set covering problem (MSCP). This scatter search algorithm incorporates procedures based on different strategies, such as local search, GRASP, and path relinking. We first designed the algorithm for the p-center problem, and then modified it for the MSCP.The aim is to solve problems with real data provided by the Health Authorities of Burgos (northern Spain). Because the authorities have a limited budget, less than 10 facilities can considered in both problems. A series of computational experiments were also performed. The proposed algorithm gave similar results to the recently reported methods for the p-center problem but much faster. The quality of the solutions is also very good for the MSCP (less than 1% deviation from the lower bound). We show its application to the location of health resources with real data in the province of Burgos.