An Algorithm for Solving Dynamic Capacitated Plant Location Problems with Discrete Expansion Sizes
From MaRDI portal
Publication:3978841
Recommendations
Cited in
(41)- An algorithm for the capacitated, multi-commodity multi-period facility location problem.
- On solving complex multi-period location models using simulated annealing.
- Modeling and solving a logging camp location problem
- A large-scale multilocation capacity planning model
- Multi-period capacitated location with modular equipments
- Robust supply chain network design with multi-products for a company in the food sector
- Capacity management in public service facility networks: a model, computational tests and a case study
- The Multiregion Dynamic Capacity Expansion Problem: An Improved Heuristic
- Facility location models for distribution system design
- Solving a dynamic facility location problem with partial closing and reopening
- On the capacitated concentrator location problem: a reformulation by discretization
- The plant location problem with discrete capacities and indivisible customers
- Evasive flow capture: a multi-period stochastic facility location problem with independent demand
- On solving a large-scale problem on facility location and customer assignment with interaction costs along a time horizon
- Multi-period facility location and capacity expansion with modular capacities and convex short-term costs
- Heuristics for the dynamic facility location problem with modular capacities
- Location and layout planning. A survey
- An integrated approach to dynamic plant location and capacity planning
- Using Lagrangian relaxation to locate hydrogen production facilities under uncertain demand: a case study from Norway
- GENETIC ALGORITHM SOLUTION FOR MULTI-PERIOD TWO-ECHELON INTEGRATED COMPETITIVE/UNCOMPETITIVE FACILITY LOCATION PROBLEM
- Efficient primal-dual heuristic for a dynamic location problem
- An Algorithm for the Facility Location Problem with Consideration to the Constructing Period :A Case for Two Construction Periods
- Testing facility location and dynamic capacity planning for pandemics with demand uncertainty
- The location routing problem with facility sizing decisions
- Locations on time-varying networks
- Dynamic location of modular manufacturing facilities with relocation of individual modules
- scientific article; zbMATH DE number 3892904 (Why is no real title available?)
- Capacity Acquisition and Disposal with Discrete Facility Sizes
- Dynamic multi-commodity capacitated facility location: a mathematical modeling framework for strategic supply chain planning
- A new formulation and Benders decomposition for the multi-period maximal covering facility location problem with server uncertainty
- Lagrangian heuristics for large-scale dynamic facility location with generalized modular capacities
- Some personal views on the current state and the future of locational analysis
- The dynamic relocation and phase-out of a hybrid two-echelon plant/warehousing facility: A multiple objective approach
- A genetic algorithm-based heuristic for the dynamic integrated forward/reverse logistics network for 3PLs
- Dynamic-demand capacitated facility location problems with and without relocation
- The dynamic facility location problem with mobile production units: a waste recycling application
- A computational comparison of several formulations for the multi-period incremental service facility location problem
- Add/drop procedures for the capacitated plant location problem
- Computational comparison of two formulations for dynamic supply chain reconfiguration with capacity expansion and contraction
- Design of regional production networks for second generation synthetic bio-fuel - A case study in northern Germany
- A dynamic distribution model for combat logistics.
This page was built for publication: An Algorithm for Solving Dynamic Capacitated Plant Location Problems with Discrete Expansion Sizes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3978841)