Solving large \(p\)-median problems by a multistage hybrid approach using demand points aggregation and variable neighbourhood search

DOI10.1007/S10898-013-0080-ZzbMath1327.90091OpenAlexW1977463930MaRDI QIDQ887197

Chandra Ade Irawan, Said Salhi

Publication date: 28 October 2015

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-013-0080-z

zbMATH Keywords

aggregationlocation problem\(p\)-medianvariable neighbourhood search

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)

Related Items (7)

Discrete facility location in machine learning ⋮ Solving the bi‐objective capacitated p‐median problem with multilevel capacities using compromise programming and VNS ⋮ The continuous single source location problem with capacity and zone-dependent fixed cost: models and solution approaches ⋮ An efficient Benders decomposition for the \(p\)-median problem ⋮ Formulation and solution of a two-stage capacitated facility location problem with multilevel capacities ⋮ The continuous single-source capacitated multi-facility Weber problem with setup costs: formulation and solution methods ⋮ A multi-objective parallel variable neighborhood search for the bi-objective obnoxious p-median problem

Cites Work

• Unnamed Item
• Aggregation error for location models: Survey and analysis
• Worst-case analysis of demand point aggregation for the Euclidean \(p\)-median problem
• Analysis of aggregation errors for the \(p\)-median problem
• A genetic algorithm based approach for the uncapacitated continuous location-allocation problem
• An aggregation heuristic for large scale p-median problem
• Data surrogation error in \(p\)-median models
• Solving Large p-Median Problems with a Radius Formulation
• A Fast Algorithm For The Greedy Interchange For Large-Scale Clustering And Median Location Problems
• Worst-Case and Probabilistic Analysis of a Geometric Location Problem
• Variable neighborhood search for the p-median
• Row-Column Aggregation for Rectilinear Distance p-Median Problems

This page was built for publication: Solving large \(p\)-median problems by a multistage hybrid approach using demand points aggregation and variable neighbourhood search