An efficient heuristic algorithm for the capacitated \(p\)-median problem

DOI10.1007/s10288-012-0223-yzbMath1282.90160OpenAlexW2086874970MaRDI QIDQ385459

Hamid Reza Ahadi, Masoud Yaghini, Mohsen Momeni, Mohammadreza Sarmadi

Publication date: 2 December 2013

Published in: 4OR (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10288-012-0223-y

zbMATH Keywords

heuristic algorithmlocal branching algorithmcapacitated \(p\)-median problemlocation-allocation problemrelaxation induced neighborhood search method

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items

Matheuristics for the single-path design-balanced service network design problem, Solving the bi‐objective capacitated p‐median problem with multilevel capacities using compromise programming and VNS

Uses Software

• OR-Library
• SPOT

Cites Work

• A genetic algorithm for solving a capacitated \(p\)-median problem
• The \(p\)-median problem: a survey of metaheuristic approaches
• An effective VNS for the capacitated \(p\)-median problem
• Clustering search algorithm for the capacitated centered clustering problem
• A genetic algorithm based approach for the uncapacitated continuous location-allocation problem
• Two exact algorithms for the capacitated \(p\)-median problem
• Local branching
• A column generation approach to capacitated \(p\)-median problems
• Exploring relaxation induced neighborhoods to improve MIP solutions
• Comparison of genetic algorithms, random restart and two-opt switching for solving large location-allocation problems
• A fast swap-based local search procedure for location problems
• A cut and branch approach for the capacitated \(p\)-median problem based on Fenchel cutting planes
• A scatter search heuristic for the capacitated clustering problem
• Hybrid scatter search and path relinking for the capacitated \(p\)-median problem
• Tuning an Algorithm Using Design of Experiments
• Fine-Tuning of Algorithms Using Fractional Experimental Designs and Local Search
• Solution methods for thep-median problem: An annotated bibliography
• Heuristic Methods for Location-Allocation Problems
• A branch‐and‐price algorithm for the capacitated p‐median problem
• Capacitated clustering problems by hybrid simulated annealing and tabu search
• Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph
• Using experimental design to find effective parameter settings for heuristics
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item