A multi-stage facility location problem with staircase costs and splitting of commodities: model, heuristic approach and application
From MaRDI portal
Publication:991831
DOI10.1007/s00291-007-0114-3zbMath1193.90146OpenAlexW2088626788MaRDI QIDQ991831
Publication date: 8 September 2010
Published in: OR Spectrum (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00291-007-0114-3
facility locationvariable neighborhood searchvariable neighborhood descentcommodity splitstaircase costs
Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Related Items (5)
Design of regional production networks for second generation synthetic bio-fuel - A case study in northern Germany ⋮ Introduction of an underground waste container system-model and solution approaches ⋮ Mileage bands in freight transportation ⋮ Variable neighbourhood search: methods and applications ⋮ Variable neighbourhood search: Methods and applications
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Variable neighborhood search for the maximum clique
- Facility location models for distribution system design
- A branch-and-bound algorithm for the multi-level uncapacitated facility location problem
- Heuristics for the capacitated plant location model
- ADD-heuristics' starting procedures for capacitated plant location models
- Facility location models for distribution planning
- A Lagrangean heuristic for the facility location problem with staircase costs
- Solving the staircase cost facility location problem with decomposition and piecewise linearization
- Variable neighborhood search for the degree-constrained minimum spanning tree problem
- Variable neighborhood search
- A variable neighborhood search for graph coloring.
- Strategic facility location: A review
- A Comparison of Mixed-Integer Programming Models for Nonconvex Piecewise Linear Cost Minimization Problems
- An Overview of Representative Problems in Location Research
- A Dual-Based Procedure for Uncapacitated Facility Location
- A Dual-Based Procedure for Dynamic Facility Location
- An efficient heuristic procedure for the capacitated warehouse location problem
- A Plant and Warehouse Location Problem
- Variable neighborhood search for the p-median
- The Plant Location Problem: New Models and Research Prospects
- Integer Programming: Methods, Uses, Computations
- An Efficient Branch and Bound Algorithm for the Warehouse Location Problem
- On the Two-Level Uncapacitated Facility Location Problem
- Variable neighborhood search: Principles and applications
This page was built for publication: A multi-stage facility location problem with staircase costs and splitting of commodities: model, heuristic approach and application
