Skip to Main content Skip to Navigation
Journal articles

Solving the planar p-median problem by variable neighborhood and concentric searches

Abstract : Two new approaches for the solution of the p-median problem in the plane are proposed. One is a Variable Neighborhood Search and the other one is a concentric search. Both approaches are enhanced by a front-end procedure for finding good starting solutions and a decomposition heuristic acting as a post optimization procedure. Computational results confirm the effectiveness of the proposed algorithms.
Document type :
Journal articles
Complete list of metadata

https://hal-uphf.archives-ouvertes.fr/hal-03401536
Contributor : Mylène Delrue Connect in order to contact the contributor
Submitted on : Monday, October 25, 2021 - 1:42:37 PM
Last modification on : Tuesday, October 26, 2021 - 4:00:31 AM

Links full text

Identifiers

Collections

Citation

Zvi Drezner, Jack Brimberg, Nenad Mladenovic, Said Salhi. Solving the planar p-median problem by variable neighborhood and concentric searches. Journal of Global Optimization, Springer Verlag, 2015, 63 (3), pp.501-514. ⟨10.1007/s10898-014-0183-1⟩. ⟨hal-03401536⟩

Share

Metrics

Record views

6