A location-allocation heuristic for the capacitated multi-facility Weber problem with probabilistic customer locations

DOI10.1016/J.EJOR.2008.10.014zbMath1176.90656OpenAlexW1996720640MaRDI QIDQ1042058

J. Blot

Publication date: 7 December 2009

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2008.10.014

zbMATH Keywords

heuristicsexpected distancefacility location-allocationprobabilistic capacitated Weber problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59)

Related Items (6)

Integer linear programming models for grid-based light post location problem ⋮ A directional approach to gradual cover ⋮ Variations in the flow approach to CFCLP-TC for multiobjective supply chain design ⋮ An algorithm for generalized constrained multi-source Weber problem with demand substations ⋮ The capacitated multi-facility location–allocation problem with probabilistic customer location and demand: two hybrid meta-heuristic algorithms ⋮ Spatial uncertainty in harvest scheduling

Uses Software

• CPLEX
• GSL

Cites Work

• Unnamed Item
• Unnamed Item
• Modelling imperfect advance demand information and analysis of optimal inventory policies
• Stochastic multi-facility minisum location problem involving Euclidean distances
• The stochastic transportation-location problem
• Accelerating convergence in the Fermat-Weber location problem
• Programming challenges. The programming contest training manual.
• An efficient algorithm for determining the convex hull of a finite planar set
• Global Optimization Procedures for the Capacitated Euclidean and l_p Distance Multifacility Location-Allocation Problems
• Using Block Norms for Location Modeling
• NP-Hard, Capacitated, Balanced p-Median Problems on a Chain Graph with a Continuum of Link Demands
• Mathematical Models of Road Travel Distances
• 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
• Convex Analysis
• Modelling Inter-city Road Distances by Mathematical Functions
• The Transportation-Location Problem

This page was built for publication: A location-allocation heuristic for the capacitated multi-facility Weber problem with probabilistic customer locations