Knapsack problems: algorithms and computer implementations
Knapsack problems: algorithms and computer implementations
A dual-based procedure for stochastic facility location
Operations Research
A Multi-Stage Stochastic Integer Programming Approach for Capacity Expansion under Uncertainty
Journal of Global Optimization
Bounds for the single source modular capacitated plant location problem
Computers and Operations Research
Fuzzy random facility location problems with recourse
SMC'09 Proceedings of the 2009 IEEE international conference on Systems, Man and Cybernetics
Recourse-based facility-location problems in hybrid uncertain environment
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics - Special issue on gait analysis
Survey: Facility location dynamics: An overview of classifications and applications
Computers and Industrial Engineering
Information Sciences: an International Journal
Hi-index | 0.01 |
This paper addresses the problem of minimizing the expected cost of locating a number of single product facilities and allocating uncertain customer demand to these facilities. The total costs consist of two components: firstly linear transportation cost and secondly the costs of investing in a facility as well as maintaining and operating it. These facility costs are general and non-linear in shape and could express both changing economies of scale and diseconomies of scale. We formulate the problem as a two-stage stochastic programming model where both demand and short-run costs may be uncertain at the investment time. We use a solution method based on Lagrangean relaxation, and show computational results for a slaughterhouse location case from the Norwegian meat industry.