Abstract
In this paper, a Biased Random Key Genetic Algorithm is proposed to solve the alpha-neighbor p-center problem. A decoder and a local search procedure are developed obtaining competitive solutions for the problem. The objective of the ANPC is to locate p facilities serving demand points and assign a number alpha of facilities to each demand point. The objective function is evaluated as the maximum distance to the farthest facility assigned to each client, and the goal is to minimize this maximum distance. The proposed algorithm is compared with the best method found in the literature. The performance of the algorithm is evaluated over a large set of instances showing the robustness of the proposal.
Jesús Sánchez-Oro
Associate Professor
Associate Professor at the Computer Science Department, being one of the senior researchers of the Group for Research on Algorithms For Optimization GRAFO.
Abraham Duarte
Full Professor
Abraham Duarte is Full Professor in the Computer Science Department at the Rey Juan Carlos University (Madrid, Spain). He has done extensive research in the interface between computer science, artificial intelligence, and operations research to develop solution methods based on Computational Intelligence (metaheuristics) for practical problems in operations-management areas such as logistics and supply chains, telecommunications, decision-making under uncertainty and optimization of simulated systems.