An effective VNS for the capacitated \(p\)-median problem

DOI10.1016/j.ejor.2006.12.055zbMath1160.90496OpenAlexW2085399058MaRDI QIDQ932177

Krzysztof Fleszar, Khalil S. Hindi

Publication date: 10 July 2008

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2006.12.055

zbMATH Keywords

hybrid heuristicsvariable neighbourhood searchcapacitated \(p\)-median problemcapacitated clustering problem

Mathematics Subject Classification ID

Search theory (90B40) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (23)

An integration of mixed VND and VNS: the case of the multivehicle covering tour problem ⋮ STUDY ON BURST-b WEIGHT DISTRIBUTION OF CYCLIC CODES ⋮ A variable neighbourhood search algorithm for the open vehicle routing problem ⋮ Variable neighborhood search for the pharmacy duty scheduling problem ⋮ Strengthening the reliability fixed-charge location model using clique constraints ⋮ Variable neighborhood search for location routing ⋮ A matheuristic for large-scale capacitated clustering ⋮ An efficient heuristic algorithm for the capacitated \(p\)-median problem ⋮ Design and analysis of hybrid metaheuristics for the reliability \(p\)-median problem ⋮ Variable neighbourhood structures for cycle location problems ⋮ The most probable allocation solution for the p-median problem ⋮ Primal and dual bounds for the vertex \(p\)-median problem with balance constraints ⋮ Solving the bi‐objective capacitated p‐median problem with multilevel capacities using compromise programming and VNS ⋮ An Image-Based Approach to Detecting Structural Similarity Among Mixed Integer Programs ⋮ Mathematical formulations and solution methods for the uncapacitated \(r\)-allocation \(p\)-hub maximal covering problem ⋮ A comparative study of two hybrid grouping evolutionary techniques for the capacitated P-median problem ⋮ Variable neighbourhood search: methods and applications ⋮ Model-based capacitated clustering with posterior regularization ⋮ Variable neighbourhood search: Methods and applications ⋮ Clustering search algorithm for the capacitated centered clustering problem ⋮ An iterative variable-based fixation heuristic for the 0-1 multidimensional knapsack problem ⋮ Lagrangean duals and exact solution to the capacitated \(p\)-center problem ⋮ Matheuristics for the capacitated p‐median problem

Uses Software

• OR-Library

Cites Work

• Unnamed Item
• Greedy random adaptive memory programming search for the capacitated clustering problem
• Solving capacitated clustering problems
• Efficient algorithms for the capacitated concentrator location problem
• A bionomic approach to the capacitated \(p\)-median problem
• Variable neighborhood search
• A column generation approach to capacitated \(p\)-median problems
• Variable neighborhood decomposition search
• A tabu search heuristic and adaptive memory procedure for political districting
• A scatter search heuristic for the capacitated clustering problem
• A path relinking approach with ejection chains for the generalized assignment problem
• Hybrid scatter search and path relinking for the capacitated \(p\)-median problem
• Solving the \(p\)-median problem with pos/neg weights by variable neighborhood search and some results for special cases
• Efficient solution of large scale, single-source, capacitated plant location problems
• Variable neighborhood search for the p-median
• Capacitated clustering problems by hybrid simulated annealing and tabu search
• A new method for solving capacitated location problems based on a set partitioning approach

This page was built for publication: An effective VNS for the capacitated \(p\)-median problem