|Title:||Solving the planar p-median problem by variable neighborhood and concentric searches||Journal:||Journal of Global Optimization||Volume:||63||Issue:||3||First page:||501||Last page:||514||Issue Date:||1-Nov-2015||Rank:||M21||ISSN:||0925-5001||DOI:||10.1007/s10898-014-0183-1||Abstract:||
Two new approaches for the solution of the (Formula presented.)-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.
|Keywords:||Concentric search | Concentric tabu | Location-allocation | Planar p-median | Variable Neighborhood Search||Publisher:||Springer Link|
Show full item record
checked on Apr 15, 2021
checked on Apr 16, 2021
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.