Solving probabilistic multi-facility Weber problem by vector quantization

DOI10.1007/S00291-008-0157-0zbMath1163.90622OpenAlexW2059102303MaRDI QIDQ1027991

J. Blot

Publication date: 30 June 2009

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

Full work available at URL: https://doi.org/10.1007/s00291-008-0157-0

zbMATH Keywords

heuristicsvector quantizationcontinuous location-allocation

Mathematics Subject Classification ID

Continuous location (90B85) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (2)

Simulation and optimization of ant colony optimization algorithm for the stochastic uncapacitated location-allocation problem ⋮ Location models with stochastic demand points

Cites Work

• Unnamed Item
• An optimal method for solving the (generalized) multi-Weber problem
• The stochastic transportation-location problem
• Accelerating convergence in the Fermat-Weber location problem
• Kohonen maps for solving a class of location-allocation problems
• Self-organizing feature maps for solving location--allocation problems with rectilinear distances.
• On the Complexity of Some Common Geometric Location Problems
• Solving the uncapacitated multi-facility Weber problem by vector quantization and self-organizing maps
• Location-Allocation Problems
• Properties and Solution Methods for Large Location-Allocation Problems
• Optimal Facility Location for Normally and Exponentially Distributed Points
• Probabilistic formulations of the multifacility weber problem
• Global Convergence of a Generalized Iterative Procedure for the Minisum Location Problem with lp Distances
• Heuristic Methods for Location-Allocation Problems
• An Always-Convergent Numerical Scheme for a Random Locational Equilibrium Problem
• The noising methods: A generalization of some metaheuristics

This page was built for publication: Solving probabilistic multi-facility Weber problem by vector quantization