An Algorithm for Solving Dynamic Capacitated Plant Location Problems with Discrete Expansion Sizes

DOI10.1287/OPRE.39.3.423zbMATH Open0742.90049OpenAlexW2060789779MaRDI QIDQ3978841FDOQ3978841

Authors: Alexander Shulman 

Publication date: 25 June 1992

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.39.3.423

Recommendations

• An integrated approach to dynamic plant location and capacity planning
• A multiperiod two-echelon multicommodity capacitated plant location problem
• Solving the dynamic facility location problem
• Add/drop procedures for the capacitated plant location problem

zbMATH Keywords

heuristicscapacity expansionLagrangian relaxationmixed 0-1 linear formulationmultiperiod facility location

Mathematics Subject Classification ID

Dynamic programming (90C39) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Boolean programming (90C09) Discrete location and assignment (90B80)

Cited In (41)

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

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)