Discrete approximation heuristics for the capacitated continuous location-allocation problem with probabilistic customer locations
From MaRDI portal
(Redirected from Publication:1013385)
Recommendations
- A location-allocation heuristic for the capacitated multi-facility Weber problem with probabilistic customer locations
- New heuristic methods for the capacitated multi-facility Weber problem
- The capacitated multi-facility location–allocation problem with probabilistic customer location and demand: two hybrid meta-heuristic algorithms
- Solving probabilistic multi-facility Weber problem by vector quantization
- Location and allocation based branch and bound algorithms for the capacitated multi-facility Weber problem
Cites work
- A cellular heuristic for the multisource Weber problem.
- A localization and reformulation discrete programming approach for the rectilinear distance location-allocation problem
- A perturbation-based heuristic for the capacitated multisource Weber problem
- An Always-Convergent Numerical Scheme for a Random Locational Equilibrium Problem
- Asymptotic behavior of the Weber location problem on the plane
- Efficient heuristics for the rectilinear distance capacitated multi-facility Weber problem
- Global Optimization Procedures for the Capacitated Euclidean and lp Distance Multifacility Location-Allocation Problems
- Heuristic Methods for Location-Allocation Problems
- Heuristic solution of the multisource Weber problem as a \(p\)-median problem
- scientific article; zbMATH DE number 1803764 (Why is no real title available?)
- scientific article; zbMATH DE number 3027356 (Why is no real title available?)
- Mathematical Models of Road Travel Distances
- Modelling imperfect advance demand information and analysis of optimal inventory policies
- Modelling Inter-city Road Distances by Mathematical Functions
- New heuristic methods for the capacitated multi-facility Weber problem
- NP-Hard, Capacitated, Balanced p-Median Problems on a Chain Graph with a Continuum of Link Demands
- Optimal Facility Location for Normally and Exponentially Distributed Points
- Probabilistic formulations of the multifacility weber problem
- Technical Note—Location Theory, Dominance, and Convexity: Some Further Results
- The noising methods: A generalization of some metaheuristics
- The plant location problem with demand-dependent setup costs and centralized allocation
- The stochastic transportation-location problem
- The Transportation-Location Problem
Cited in
(9)- Solving probabilistic multi-facility Weber problem by vector quantization
- A location-allocation heuristic for the capacitated multi-facility Weber problem with probabilistic customer locations
- Capacitated location allocation problem with stochastic location and fuzzy demand: a hybrid algorithm
- Genetic algorithm for obstacle location-allocation problems with customer priorities
- A new local search for continuous location problems
- Constructive heuristics for the uncapacitated continuous location-allocation problem
- A capacitated location-allocation model for flood disaster service operations with border crossing passages and probabilistic demand locations
- The capacitated multi-facility location–allocation problem with probabilistic customer location and demand: two hybrid meta-heuristic algorithms
- The discrete facility location problem with balanced allocation of customers
This page was built for publication: Discrete approximation heuristics for the capacitated continuous location-allocation problem with probabilistic customer locations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1013385)
