A Fast Algorithm For The Greedy Interchange For Large-Scale Clustering And Median Location Problems
From MaRDI portal
Publication:3042820
DOI10.1080/03155986.1983.11731889zbMath0527.90017OpenAlexW34103176MaRDI QIDQ3042820
Publication date: 1983
Published in: INFOR: Information Systems and Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/03155986.1983.11731889
computational experienceset partitioninggreedy interchange heuristiclarge randomly generated networkslarge scale clusteringuncapacitated median location
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Inventory, storage, reservoirs (90B05)
Related Items (43)
Making a state-of-the-art heuristic faster with data mining ⋮ Solving two location models with few facilities by using a hybrid heuristic: a real health resources case ⋮ Bi-objective optimisation model for installation scheduling in offshore wind farms ⋮ A new heuristic for solving the \(p\)-median problem in the plane ⋮ A simulated annealing based hyperheuristic for determining shipper sizes for storage and transportation ⋮ The \(p\)-median problem: a survey of metaheuristic approaches ⋮ A genetic algorithm for the \(p\)-median problem with pos/neg weights ⋮ K-medoids inverse regression ⋮ Computational study of large-scale \(p\)-median problems ⋮ On the exact solution of large-scale simple plant location problems ⋮ Some heuristic methods for solving \(p\)-median problems with a coverage constraint ⋮ Design and analysis of hybrid metaheuristics for the reliability \(p\)-median problem ⋮ Solving large \(p\)-median problems by a multistage hybrid approach using demand points aggregation and variable neighbourhood search ⋮ A hybrid artificial bee colony algorithm for the \(p\)-median problem with positive/negative weights ⋮ Discrete facility location in machine learning ⋮ The balanced \(p\)-median problem with unitary demand ⋮ A method for solving to optimality uncapacitated location problems ⋮ Formulation and solution of a two-stage capacitated facility location problem with multilevel capacities ⋮ An ant colony algorithm for the pos/neg weighted \(p\)-median problem ⋮ New local searches for solving the multi-source Weber problem ⋮ A clustering approach to the planar hub location problem ⋮ A Tabu search algorithm for solving the extended maximal availability location problem ⋮ A fast swap-based local search procedure for location problems ⋮ An adaptive multiphase approach for large unconditional and conditional \(p\)-median problems ⋮ A new local search for continuous location problems ⋮ Variable neighbourhood search: methods and applications ⋮ Variable neighborhood search: Principles and applications ⋮ Solving the uncapacitated facility location problem using tabu search ⋮ Improved metaheuristics for the quartet method of hierarchical clustering ⋮ Attraction probabilities in variable neighborhood search ⋮ Solving thep-Center problem with Tabu Search and Variable Neighborhood Search ⋮ J-MEANS: A new local search heuristic for minimum sum of squares clustering ⋮ Affinity propagation and uncapacitated facility location problems ⋮ Lagrangean heuristics for location problems ⋮ A gamma heuristic for the \(p\)-median problem ⋮ A Lagrangean heuristic for the maximal covering location problem ⋮ Improved starting solutions for the planar p-median problem ⋮ Heuristic solution of the multisource Weber problem as a \(p\)-median problem ⋮ Variable neighbourhood search: Methods and applications ⋮ P-Median Problems with an Additional Constraint on the Assignment Variables ⋮ Exemplar-based clustering via simulated annealing ⋮ Heuristic procedures for solving the discrete ordered median problem ⋮ An efficient hybrid particle swarm optimization algorithm for solving the uncapacitated continuous location-allocation problem
This page was built for publication: A Fast Algorithm For The Greedy Interchange For Large-Scale Clustering And Median Location Problems
