Solving the robust two-stage capacitated facility location problem with uncertain transportation costs
DOI10.1007/s11590-016-1036-2zbMath1382.90047OpenAlexW2368219494MaRDI QIDQ1677305
Igor Grujičić, Zorica Stanimirović, Stefan Mišković
Publication date: 10 November 2017
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-016-1036-2
simulated annealingrobust optimizationevolutionary algorithmmemetic algorithmtwo-stage facility location
Minimax problems in mathematical programming (90C47) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Related Items (6)
Cites Work
- Unnamed Item
- Unnamed Item
- A scatter search-based heuristic to locate capacitated transshipment points
- Applying Lagrangian relaxation to the resolution of two-stage location problems
- Robust discrete optimization and network flows
- An exact method for the two-echelon, single-source, capacitated facility location problem
- A Lagrangian relax-and-cut approach for the two-stage capacitated facility location problem
- The simple plant location problem: Survey and synthesis
- Obtaining test problems via Internet
- Robust strategies for facility location under uncertainty
- Recent advances in robust optimization: an overview
- Lower and upper bounds for a two-stage capacitated facility location problem with handling costs
- An LP-based heuristic for two-stage capacitated facility location problems
- The Theory and Practice of Simulated Annealing
This page was built for publication: Solving the robust two-stage capacitated facility location problem with uncertain transportation costs