A variable neighborhood search heuristic for the design of multicommodity production-distribution networks with alternative facility configurations
From MaRDI portal
Publication:657059
DOI10.1007/s00291-009-0182-7zbMath1229.90027MaRDI QIDQ657059
Nicolas Zufferey, Houssam Amrani, Alain Martel, Polina Makeeva
Publication date: 13 January 2012
Published in: OR Spectrum (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00291-009-0182-7
tabu search; variable neighborhood search; location-allocation problem; facilities configuration; production-distribution networks
90C59: Approximation methods and heuristics in mathematical programming
90B10: Deterministic network models in operations research
Related Items
Variable neighborhood search for the bi-objective post-sales network design problem: a fitness landscape analysis approach, A bi-objective integrated procurement, production, and distribution problem of a multi-echelon supply chain network design: a new tuned MOEA, Model and metaheuristics for a scheduling problem integrating procurement, sale and distribution decisions, Design of a distribution network using primal-dual decomposition, Designing a sustainable closed-loop supply chain network based on triple bottom line approach: a comparison of metaheuristics hybridization techniques
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A simple tabu search for warehouse location
- Facility location models for distribution system design
- Designing a distribution network in a supply chain system: formulation and efficient solution procedure
- Heuristics for the capacitated plant location model
- A tabu search approach to the uncapacitated facility location problem
- Designing distribution systems with transport economies of scale
- Variable neighborhood search
- A multi-commodity, multi-plant, capacitated facility location problem: Formulation and efficient heuristic solution.
- A tabu search with slope scaling for the multicommodity capacitated location problem with balancing requirements
- A framework for robust and flexible optimisation using metaheuristics, with applications in supply chain design
- A Lagrangian relax-and-cut approach for the two-stage capacitated facility location problem
- Distribution network design: New problems and related models
- Near-optimal solutions to large-scale facility location problems
- Lagrangean heuristics for location problems
- Future paths for integer programming and links to artificial intelligence
- A tabu search procedure for multicommodity location/allocation with balancing requirements
- A bibliography for some fundamental problem categories in discrete location science
- Solving the simple plant location problem by genetic algorithm
- A Multiplier Adjustment Method for the Generalized Assignment Problem
- A Multi-Exchange Heuristic for the Single-Source Capacitated Facility Location Problem
- An LP-based heuristic for two-stage capacitated facility location problems
- Fixed-cost transportation problems
- Capacitated Warehouse Location with Concave Costs
- Multicommodity Distribution System Design by Benders Decomposition
- A Plant and Warehouse Location Problem
- Production, Transportation, and Distribution Planning in a Multi-Commodity Tri-Echelon System
- Optimal Facility Location with Concave Costs
- Site Location via Mixed-integer Programming
- A Multiexchange Local Search Algorithm for the Capacitated Facility Location Problem
