An improved Lagrangian relaxation-based heuristic for a joint location-inventory problem
From MaRDI portal
Publication:337612
DOI10.1016/j.cor.2014.03.006zbMath1348.90387OpenAlexW1986517752WikidataQ59166646 ScholiaQ59166646MaRDI QIDQ337612
Dima Nazzal, Olga Battaïa, Ali H. Diabat
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: http://oatao.univ-toulouse.fr/20100/1/Diabat_20100.pdf
Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59) Inventory, storage, reservoirs (90B05) Discrete location and assignment (90B80)
Related Items
Multiple-vendor, multiple-retailer based vendor-managed inventory, Incorporating price-dependent demands into a multi-echelon closed-loop network considering the lost sales and backorders: a case study of wireless network, A combined statistical selection procedure measured by the expected opportunity cost, A hybrid tabu search based heuristic for the periodic distribution inventory problem with perishable goods, A capacitated facility location and inventory management problem with single sourcing, Integrating disassembly line balancing in the planning of a reverse logistics network from the perspective of a third party provider, Location and two-echelon inventory network design with economies and diseconomies of scale in facility operating costs, Optimizing a multi-echelon location-inventory problem with joint replenishment: a Lipschitz \(\epsilon\)-optimal approach using Lagrangian relaxation, Integrating supplier selection decisions into an inventory location problem for designing the supply chain network, Throughput optimization for the Robotic Cell Problem with Controllable Processing Times, An integrated supply chain problem: a nested Lagrangian relaxation approach, Optimizing allocation in a warehouse network, A heuristic algorithm for solving large location-inventory problems with demand uncertainty, A generalized Benders decomposition based algorithm for an inventory location problem with stochastic inventory capacity constraints, A blood bank network design problem with integrated facility location, inventory and routing decisions, Modeling logistics service providers in a non-cooperative supply chain, Lagrangian relaxation of the generic materials and operations planning model
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A column generation-based heuristic algorithm for an inventory routing problem with perishable goods
- The optimal and heuristic solutions of a distribution network
- Designing a distribution network in a supply chain system: formulation and efficient solution procedure
- A genetic algorithm for a single product network design model with lead time and safety stock considerations
- Plant location with minimum inventory
- A multi-commodity, multi-plant, capacitated facility location problem: Formulation and efficient heuristic solution.
- Outbound supply chain network design with mode selection, lead times and capacitated vehicle distribution centers
- An inventory-location model: Formulation, solution algorithm and computational results
- A continuous approximation approach for the integrated facility-inventory allocation problem
- A Lagrangian relaxation approach to simultaneous strategic and tactical planning in supply chain design
- Efficient solution of large scale, single-source, capacitated plant location problems
- Production/distribution system design with inventory considerations
- Capacitated warehouse location model with risk pooling
- Warehouse-Retailer Network Design Problem
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- Planning and coordination of production and distribution facilities for multiple commodities
