Hybrid scatter search and path relinking for the capacitated \(p\)-median problem
From MaRDI portal
Publication:2570156
DOI10.1016/j.ejor.2004.08.016zbMath1079.90076OpenAlexW2094099970MaRDI QIDQ2570156
Publication date: 26 October 2005
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2004.08.016
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Search theory (90B40) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Related Items
STUDY ON BURST-b WEIGHT DISTRIBUTION OF CYCLIC CODES ⋮ Scatter search for an uncapacitated \(p\)-hub median problem ⋮ A scatter search-based heuristic to locate capacitated transshipment points ⋮ 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 ⋮ The most probable allocation solution for the p-median problem ⋮ Towards a machine learning-aided metaheuristic framework for a production/distribution system design problem ⋮ Primal and dual bounds for the vertex \(p\)-median problem with balance constraints ⋮ A directional approach to gradual cover ⋮ Solving the bi‐objective capacitated p‐median problem with multilevel capacities using compromise programming and VNS ⋮ Robust facility location in reverse logistics ⋮ Heuristic Solutions to the Facility Location Problem with General Bernoulli Demands ⋮ Variations in the flow approach to CFCLP-TC for multiobjective supply chain design ⋮ An effective VNS for the capacitated \(p\)-median problem ⋮ Cooperative co‐evolutionary scatter search for satellite module layout design ⋮ A cut and branch approach for the capacitated \(p\)-median problem based on Fenchel cutting planes ⋮ A comparative study of two hybrid grouping evolutionary techniques for the capacitated P-median problem ⋮ A multi-product production/distribution system design problem with direct shipments and lateral transshipments ⋮ Path relinking approach for multiple allocation hub maximal covering problem ⋮ Theoretical insights into the augmented-neural-network approach for combinatorial optimization ⋮ Neighborhood decomposition based variable neighborhood search and tabu search for maximally diverse grouping ⋮ Model-based capacitated clustering with posterior regularization ⋮ Hybrid genetic algorithms with selective crossover for the capacitated \(p\)-Median problem ⋮ An evolutionary method for complex-process optimization ⋮ A computational evaluation of a general branch-and-price framework for capacitated network location problems ⋮ Clustering search algorithm for the capacitated centered clustering problem ⋮ Lagrangean duals and exact solution to the capacitated \(p\)-center problem ⋮ Matheuristics for the capacitated p‐median problem ⋮ An approximation algorithm for the facility location problem with lexicographic minimax objective ⋮ Metaheuristic applications on discrete facility location problems: a survey
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Efficient algorithms for the capacitated concentrator location problem
- An exact algorithm for the capacitated facility location problems with single sourcing
- A tree search algorithm for the p-median problem
- A bionomic approach to the capacitated \(p\)-median problem
- A column generation approach to capacitated \(p\)-median problems
- Greedy randomized adaptive search procedures
- Scatter search. Methodology and implementation in C. With CD-ROM.
- A path relinking approach with ejection chains for the generalized assignment problem
- Variable neighborhood search for the p-median
- A Branch-and-Price algorithm for the Single Source Capacitated Plant Location Problem
- Capacitated clustering problems by hybrid simulated annealing and tabu search
- A tabu search heuristic for the generalized assignment problem
