Solving probabilistic multi-facility Weber problem by vector quantization
From MaRDI portal
Recommendations
- A location-allocation heuristic for the capacitated multi-facility Weber problem with probabilistic customer locations
- Solving the uncapacitated multi-facility Weber problem by vector quantization and self-organizing maps
- New heuristic methods for the capacitated multi-facility Weber problem
- Efficient heuristics for the rectilinear distance capacitated multi-facility Weber problem
- Discrete approximation heuristics for the capacitated continuous location-allocation problem with probabilistic customer locations
Cites work
- Accelerating convergence in the Fermat-Weber location problem
- An Always-Convergent Numerical Scheme for a Random Locational Equilibrium Problem
- An optimal method for solving the (generalized) multi-Weber problem
- Global Convergence of a Generalized Iterative Procedure for the Minisum Location Problem with lp Distances
- Heuristic Methods for Location-Allocation Problems
- scientific article; zbMATH DE number 1253061 (Why is no real title available?)
- Kohonen maps for solving a class of location-allocation problems
- Location-Allocation Problems
- On the Complexity of Some Common Geometric Location Problems
- Optimal Facility Location for Normally and Exponentially Distributed Points
- Probabilistic formulations of the multifacility weber problem
- Properties and Solution Methods for Large Location-Allocation Problems
- Self-organizing feature maps for solving location--allocation problems with rectilinear distances.
- Solving the uncapacitated multi-facility Weber problem by vector quantization and self-organizing maps
- The noising methods: A generalization of some metaheuristics
- The stochastic transportation-location problem
Cited in
(7)- Discrete approximation heuristics for the capacitated continuous location-allocation problem with probabilistic customer locations
- Multi-facility green Weber problem
- Simulation and optimization of ant colony optimization algorithm for the stochastic uncapacitated location-allocation problem
- The planar hub location problem: a probabilistic clustering approach
- Solving the uncapacitated multi-facility Weber problem by vector quantization and self-organizing maps
- Location models with stochastic demand points
- Adaptation of the probability changing method for Weber problem with an arbitrary metric
This page was built for publication: Solving probabilistic multi-facility Weber problem by vector quantization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1027991)
