A computational comparison of several formulations for the multi-period incremental service facility location problem

DOI10.1007/s11750-009-0106-3zbMath1201.90107OpenAlexW2099583895MaRDI QIDQ610997

Maria Albareda-Sambola, Elena Fernández, Yolanda Hinojosa, Laureano Fernando Escudero Bueno, Antonio Alonso-Ayuso

Publication date: 13 December 2010

Published in: Top (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11750-009-0106-3

zbMATH Keywords

impulse variablesmulti-period location-assignmentpure 0-1 formulationsstep variables

Mathematics Subject Classification ID

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

Related Items (8)

Heuristic algorithms for solving an integrated dynamic center facility location -- network design model ⋮ Fix-and-relax-coordination for a multi-period location-allocation problem under uncertainty ⋮ On solving a large-scale problem on facility location and customer assignment with interaction costs along a time horizon ⋮ Mathematical optimization models for reallocating and sharing health equipment in pandemic situations ⋮ Multi-period capacitated facility location under delayed demand satisfaction ⋮ A cutting-plane approach for large-scale capacitated multi-period facility location using a specialized interior-point method ⋮ On efficient matheuristic algorithms for multi-period stochastic facility location-assignment problems ⋮ Effective location models for sorting recyclables in public management

Cites Work

• Unnamed Item
• The use of state space relaxation for the dynamic facility location problem
• The multi-period incremental service facility location problem
• A comparative study of approaches to dynamic location problems
• A Langrangean heuristic for the \(p_ k\)-median dynamic location problem
• A perfect forward procedure for a single facility dynamic location/relocation problem
• A note on ``A perfect forward procedure for a single facility dynamic location/relocation problem
• BFC, A branch-and-fix coordination algorithmic framework for solving some types of stochastic pure and mixed 0--1 programs.
• A multiperiod two-echelon multicommodity capacitated plant location problem
• Dynamic supply chain design with inventory
• Dynamic multi-commodity capacitated facility location: a mathematical modeling framework for strategic supply chain planning
• The Air Traffic Flow Management Problem with Enroute Capacities
• Multifacility-Type Capacity Expansion Planning: Algorithms and Complexities
• The Dynamics of Plant Layout
• The Multiregion Dynamic Capacity Expansion Problem: An Improved Heuristic
• A Dual-Based Procedure for Uncapacitated Facility Location
• The Multiregion Dynamic Capacity Expansion Problem, Part I
• A Dual-Based Procedure for Dynamic Facility Location
• An Algorithm for Solving Dynamic Capacitated Plant Location Problems with Discrete Expansion Sizes
• The Multiperiod Location-Allocation Problem with Relocation of Facilities
• An Improved Long-Run Model for Multiple Warehouse Location
• Dynamic facility location: The progressive p-median problem
• A multiobjective model for the dynamic location of landfills
• Multi-Dimensional Location Problems
• Solving the dynamic facility location problem
• On solving complex multi-period location models using simulated annealing.

This page was built for publication: A computational comparison of several formulations for the multi-period incremental service facility location problem