A heuristic method for large-scale multi-facility location problems

DOI10.1016/S0305-0548(02)00191-0zbMath1088.90036OpenAlexW1983482916MaRDI QIDQ1765537

Yuri Levin, Adi Ben-Israel

Publication date: 23 February 2005

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0305-0548(02)00191-0

zbMATH Keywords

ClusteringLocationHeuristicCooper methodMulti-facility location problemsNearest-center reclassificationParallel heuristic method

Mathematics Subject Classification ID

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

Related Items

The Newton Bracketing Method for Convex Minimization: Convergence Analysis, Heuristics for a continuous multi-facility location problem with demand regions, The optimal solution set of the multi-source Weber problem, A Variational Inequality-Based Location-Allocation Algorithm for Locating Multiple Interactive Facilities, Distributionally robust Weber problem with uncertain demand, Accelerating the convergence in the single-source and multi-source Weber problems, A continuation approach for the capacitated multi-facility weber problem based on nonlinear SOCP reformulation, Optimization models for the dynamic facility location and allocation problem, An algorithm for generalized constrained multi-source Weber problem with demand substations, On the convergence of the Cooper's algorithm, A heuristic algorithm for constrained multi-source Weber problem - the variational inequality approach, The Newton bracketing method for the minimization of convex functions subject to affine constraints, An estimation algorithm using distance clustering of data., Single- and multi-objective defensive location problems on a network, A generalized Weiszfeld method for the multi-facility location problem, An ADMM-based location-allocation algorithm for nonconvex constrained multi-source Weber problem under gauge, A heuristic algorithm for constrained multi-source location problem with closest distance under gauge: the variational inequality approach

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the set partitioning type formulation for the discrete location problem
• On locating new facilities in a competitive environment
• Cluster analysis. A survey
• Cluster analysis and mathematical programming
• Allocation of discrete demand with changing costs
• Open questions concerning Weiszfeld's algorithm for the Fermat-Weber location problem
• Directional Newton methods in $n$ variables
• Competitive Location on a Network
• Local convergence in Fermat's problem
• A note on accelerating the weiszfeld procedure
• Heuristic Methods for Location-Allocation Problems
• A note on Fermat's problem
• The Newton bracketing method for convex minimization.