A New Local Search for the p-Center Problem Based on the Critical Vertex Concept
For the p-center problem, we propose a new smart local search based on the critical vertex concept and embed it in a GRASP framework. Experimental results attest the robustness of the proposed search procedure and confirm that for benchmark instances it converges to optimal or near/optimal solutions...
Saved in:
Published in | Learning and Intelligent Optimization pp. 79 - 92 |
---|---|
Main Authors | , , , |
Format | Book Chapter |
Language | English |
Published |
Cham
Springer International Publishing
|
Series | Lecture Notes in Computer Science |
Online Access | Get full text |
Cover
Loading…
Summary: | For the p-center problem, we propose a new smart local search based on the critical vertex concept and embed it in a GRASP framework. Experimental results attest the robustness of the proposed search procedure and confirm that for benchmark instances it converges to optimal or near/optimal solutions faster than the best known state-of-the-art local search. |
---|---|
ISBN: | 9783319694030 3319694030 |
ISSN: | 0302-9743 1611-3349 |
DOI: | 10.1007/978-3-319-69404-7_6 |