Solving a two-stage stochastic capacitated location-allocation problem with an improved PSO in emergency logistics

DOI10.1155/2017/6710929zbMath1426.90042OpenAlexW2617240928WikidataQ59147705 ScholiaQ59147705MaRDI QIDQ1993007

Ye Deng, Jianfei Qin, Jian Tang, Wanhong Zhu

Publication date: 5 November 2018

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2017/6710929

Mathematics Subject Classification ID

Stochastic programming (90C15) Transportation, logistics and supply chain management (90B06) Discrete location and assignment (90B80)

Cites Work

• Efficient solution of a class of location-allocation problems with stochastic demand and congestion
• A hybrid method for the probabilistic maximal covering location-allocation problem
• A new polynomial-time algorithm for linear programming
• Multi-source facility location-allocation and inventory problem
• Applying Lagrangian relaxation to the resolution of two-stage location problems
• Capacitated location allocation problem with stochastic location and fuzzy demand: a hybrid algorithm
• Theory and practice of uncertain programming
• A Note on the Optimal Positioning of Service Units
• An LP-based heuristic for two-stage capacitated facility location problems
• On the Complexity of Some Common Geometric Location Problems
• Location-Allocation Problems
• The generalized Weber problem with expected distances
• A capacitated facility location problem with constrained backlogging probabilities

This page was built for publication: Solving a two-stage stochastic capacitated location-allocation problem with an improved PSO in emergency logistics