Lower and upper bounds for a two-stage capacitated facility location problem with handling costs
From MaRDI portal
Publication:2514748
DOI10.1016/j.ejor.2013.10.047zbMath1304.90124OpenAlexW1991803161MaRDI QIDQ2514748
Jinfeng Li, Christian Prins, Feng Chu, Zhanguo Zhu
Publication date: 3 February 2015
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2013.10.047
Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Related Items
Solving the robust two-stage capacitated facility location problem with uncertain transportation costs, Two-phase semi-Lagrangian relaxation for solving the uncapacitated distribution centers location problem for B2C E-commerce, Hybrid metaheuristics to solve a multiproduct two‐stage capacitated facility location problem, An effective hybrid approach to the two-stage capacitated facility location problem, Formulation and solution of a two-stage capacitated facility location problem with multilevel capacities, Multi-level facility location problems, The continuous single-source capacitated multi-facility Weber problem with setup costs: formulation and solution methods
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A comparison of heuristics and relaxations for the capacitated plant location problem
- Efficient primal-dual heuristic for a dynamic location problem
- A branch-and-price algorithm for the capacitated facility location problem
- A review of hierarchical facility location models
- A scatter search-based heuristic to locate capacitated transshipment points
- Meta-heuristic approaches with memory and evolution for a multi-product production/distribution system design problem
- Scatter search for the single source capacitated facility location problem
- Lower and upper bounds for a capacitated plant location problem with multicommodity flow
- Applying Lagrangian relaxation to the resolution of two-stage location problems
- Lagrangian heuristics for the two-echelon, single-source, capacitated facility location problem
- A multi-commodity, multi-plant, capacitated facility location problem: Formulation and efficient heuristic solution.
- A tabu search with slope scaling for the multicommodity capacitated location problem with balancing requirements
- A slope scaling/Lagrangean perturbation heuristic with long-term memory for multicommodity capacitated fixed-charge network design
- Algorithms for a facility location problem with stochastic customer demand and immobile servers
- Dynamic multi-commodity capacitated facility location: a mathematical modeling framework for strategic supply chain planning
- Constructing Railroad Blocking Plans to Minimize Handling Costs
- A Multi-Exchange Heuristic for the Single-Source Capacitated Facility Location Problem
- An LP-based heuristic for two-stage capacitated facility location problems
- An Overview of Representative Problems in Location Research
- Production, Transportation, and Distribution Planning in a Multi-Commodity Tri-Echelon System
- Dynamic slope scaling and trust interval techniques for solving concave piecewise linear network flow problems
- Planning and coordination of production and distribution facilities for multiple commodities
