Discrete approximation heuristics for the capacitated continuous location-allocation problem with probabilistic customer locations

DOI10.1016/j.cor.2008.08.003zbMath1158.90374OpenAlexW2091051356MaRDI QIDQ1013385

J. Martínez

Publication date: 17 April 2009

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

Full work available at URL: https://doi.org/10.1016/j.cor.2008.08.003

zbMATH Keywords

heuristicscapacitated multisource Weber problemprobabilistic customer locations

Mathematics Subject Classification ID

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

Related Items (5)

Capacitated location allocation problem with stochastic location and fuzzy demand: a hybrid algorithm ⋮ A capacitated location-allocation model for flood disaster service operations with border crossing passages and probabilistic demand locations ⋮ Genetic algorithm for obstacle location-allocation problems with customer priorities ⋮ A new local search for continuous location problems ⋮ The capacitated multi-facility location–allocation problem with probabilistic customer location and demand: two hybrid meta-heuristic algorithms

Cites Work

• Unnamed Item
• Unnamed Item
• Asymptotic behavior of the Weber location problem on the plane
• Modelling imperfect advance demand information and analysis of optimal inventory policies
• A perturbation-based heuristic for the capacitated multisource Weber problem
• The stochastic transportation-location problem
• Heuristic solution of the multisource Weber problem as a \(p\)-median problem
• A localization and reformulation discrete programming approach for the rectilinear distance location-allocation problem
• A cellular heuristic for the multisource Weber problem.
• The plant location problem with demand-dependent setup costs and centralized allocation
• New heuristic methods for the capacitated multi-facility Weber problem
• Efficient heuristics for the rectilinear distance capacitated multi-facility Weber problem
• Global Optimization Procedures for the Capacitated Euclidean and l_p Distance Multifacility Location-Allocation Problems
• NP-Hard, Capacitated, Balanced p-Median Problems on a Chain Graph with a Continuum of Link Demands
• Mathematical Models of Road Travel Distances
• Technical Note—Location Theory, Dominance, and Convexity: Some Further Results
• Optimal Facility Location for Normally and Exponentially Distributed Points
• Probabilistic formulations of the multifacility weber problem
• Heuristic Methods for Location-Allocation Problems
• An Always-Convergent Numerical Scheme for a Random Locational Equilibrium Problem
• Modelling Inter-city Road Distances by Mathematical Functions
• The Transportation-Location Problem
• The noising methods: A generalization of some metaheuristics

This page was built for publication: Discrete approximation heuristics for the capacitated continuous location-allocation problem with probabilistic customer locations