Heuristics for the dynamic facility location problem with modular capacities
From MaRDI portal
Publication:2029361
DOI10.1016/j.ejor.2020.08.018zbMath1487.90447OpenAlexW3050209628WikidataQ115162881 ScholiaQ115162881MaRDI QIDQ2029361
Daniel Aloise, Leandro C. Coelho, Allyson Silva, Caroline Rocha
Publication date: 3 June 2021
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2020.08.018
Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Related Items (2)
A supervised learning-driven heuristic for solving the facility location and production planning problem ⋮ Approximating dynamic weighted vertex cover with soft capacities
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fix-and-relax-coordination for a multi-period location-allocation problem under uncertainty
- Solving a dynamic facility location problem with partial closing and reopening
- Graphs, networks and algorithms.
- Facility location models for distribution system design
- Modeling and solving a logging camp location problem
- A comparison of heuristics and relaxations for the capacitated plant location problem
- A genetic algorithm-based heuristic for the dynamic integrated forward/reverse logistics network for 3PLs
- Facility location and supply chain management. A review
- Randomized rounding: A technique for provably good algorithms and algorithmic proofs
- On dependent randomized rounding algorithms
- Dynamic trees as search trees via Euler tours, applied to the network simplex algorithm
- A Lagrangean heuristic for a modular capacitated location problem
- A genetic algorithm for the weight setting problem in OSPF routing
- A modular capacitated multi-objective model for locating maritime search and rescue vessels
- Disaggregated Benders decomposition and branch-and-cut for solving the budget-constrained dynamic uncapacitated facility location and network design problem
- Improved approximation algorithms for capacitated facility location problems
- Strategic facility location: A review
- Algorithms for the variable sized bin packing problem
- Dynamic location of modular manufacturing facilities with relocation of individual modules
- A bibliography for some fundamental problem categories in discrete location science
- Solving the hub location problem with modular link capacities
- A multiperiod set covering location model for dynamic redeployment of ambulances
- Dynamic multi-commodity capacitated facility location: a mathematical modeling framework for strategic supply chain planning
- Solving the simple plant location problem by genetic algorithm
- Exactly solving a two-level location problem with modular node capacities
- LP-Based Algorithms for Capacitated Facility Location
- A Dual-Based Procedure for Dynamic Facility Location
- An Algorithm for Solving Dynamic Capacitated Plant Location Problems with Discrete Expansion Sizes
- Improved Approximation Algorithms for the Uncapacitated Facility Location Problem
- Analysis of a Local Search Heuristic for Facility Location Problems
- Lagrangian Heuristics for Large-Scale Dynamic Facility Location with Generalized Modular Capacities
- Local Search Heuristics for k-Median and Facility Location Problems
- Capacity planning and warehouse location in supply chains with uncertain demands
- Facility location and capacity acquisition: An integrated approach
- Location Science
- A hybrid genetic algorithm for the weight setting problem in OSPF/IS‐IS routing
- Solving the dynamic facility location problem
- A Multiexchange Local Search Algorithm for the Capacitated Facility Location Problem
- On solving complex multi-period location models using simulated annealing.
- An algorithm for the capacitated, multi-commodity multi-period facility location problem.
- Variable neighborhood search: Principles and applications
This page was built for publication: Heuristics for the dynamic facility location problem with modular capacities
