A variable neighborhood search heuristic for the design of multicommodity production-distribution networks with alternative facility configurations
From MaRDI portal
(Redirected from Publication:657059)
Recommendations
- Designing a distribution network in a supply chain system: formulation and efficient solution procedure
- A multi-product production/distribution system design problem with direct shipments and lateral transshipments
- Meta-heuristic approaches with memory and evolution for a multi-product production/distribution system design problem
- The design of production-distribution networks: a mathematical programming approach
- Dual-ascent and primal heuristics for production-assembly-distribution system design
Cites work
- scientific article; zbMATH DE number 711782 (Why is no real title available?)
- scientific article; zbMATH DE number 1062113 (Why is no real title available?)
- A Lagrangian relax-and-cut approach for the two-stage capacitated facility location problem
- A Multi-Exchange Heuristic for the Single-Source Capacitated Facility Location Problem
- A Multiexchange Local Search Algorithm for the Capacitated Facility Location Problem
- A Multiplier Adjustment Method for the Generalized Assignment Problem
- A Plant and Warehouse Location Problem
- A bibliography for some fundamental problem categories in discrete location science
- A framework for robust and flexible optimisation using metaheuristics, with applications in supply chain design
- A multi-commodity, multi-plant, capacitated facility location problem: Formulation and efficient heuristic solution.
- A simple tabu search for warehouse location
- A tabu search approach to the uncapacitated facility location problem
- A tabu search procedure for multicommodity location/allocation with balancing requirements
- A tabu search with slope scaling for the multicommodity capacitated location problem with balancing requirements
- An LP-based heuristic for two-stage capacitated facility location problems
- Capacitated Warehouse Location with Concave Costs
- Designing a distribution network in a supply chain system: formulation and efficient solution procedure
- Designing distribution systems with transport economies of scale
- Distribution network design: New problems and related models
- Facility location and capacity acquisition: An integrated approach
- Facility location models for distribution system design
- Fixed-cost transportation problems
- Future paths for integer programming and links to artificial intelligence
- Heuristics for the capacitated plant location model
- Lagrangean heuristics for location problems
- Multicommodity Distribution System Design by Benders Decomposition
- Near-optimal solutions to large-scale facility location problems
- Optimal Facility Location with Concave Costs
- Production, Transportation, and Distribution Planning in a Multi-Commodity Tri-Echelon System
- Site Location via Mixed-integer Programming
- Solving the simple plant location problem by genetic algorithm
- The design of production-distribution networks: a mathematical programming approach
- Variable neighborhood search
Cited in
(17)- Learning variable neighborhood search for a scheduling problem with time windows and rejections
- Solving multifacility Huff location models on networks using variable neighborhood search and multi-start local search metaheuristics
- Design of a distribution network using primal-dual decomposition
- Designing a sustainable supply chain network integrated with vehicle routing: a comparison of hybrid swarm intelligence metaheuristics
- A multi-product production/distribution system design problem with direct shipments and lateral transshipments
- Meta-heuristic approaches with memory and evolution for a multi-product production/distribution system design problem
- Design of a quality control network for an international food company
- A supervised learning-driven heuristic for solving the facility location and production planning problem
- Dual-ascent and primal heuristics for production-assembly-distribution system design
- A large neighborhood search heuristic for supply chain network design
- A distribution network design problem in the automotive industry: MIP formulation and heuristics
- An efficient heuristic approach for a multi-period logistics network redesign problem
- A bi-objective integrated procurement, production, and distribution problem of a multi-echelon supply chain network design: a new tuned MOEA
- Variable neighborhood search for the bi-objective post-sales network design problem: a fitness landscape analysis approach
- A matheuristic for tactical locomotive and driver scheduling for the swiss national railway company SBB Cargo AG
- Model and metaheuristics for a scheduling problem integrating procurement, sale and distribution decisions
- Designing a sustainable closed-loop supply chain network based on triple bottom line approach: a comparison of metaheuristics hybridization techniques
This page was built for publication: A variable neighborhood search heuristic for the design of multicommodity production-distribution networks with alternative facility configurations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q657059)
