Variable neighborhood descent heuristic for solving reverse logistics multi-item dynamic lot-sizing problems
From MaRDI portal
Publication:1652102
DOI10.1016/J.COR.2015.10.004zbMath1391.90027DBLPjournals/cor/SifalerasK17OpenAlexW2187912024WikidataQ57780802 ScholiaQ57780802MaRDI QIDQ1652102
Angelo Sifaleras, Ioannis Konstantaras
Publication date: 11 July 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2015.10.004
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Inventory, storage, reservoirs (90B05)
Related Items (6)
Multi-period green reverse logistics network design: an improved Benders-decomposition-based heuristic approach ⋮ A hybrid CPU-GPU parallelization scheme of variable neighborhood search for inventory optimization problems ⋮ Towards circular economy in production planning: challenges and opportunities ⋮ Effective matheuristics for the multi-item capacitated lot-sizing problem with remanufacturing ⋮ Robust formulations for economic lot-sizing problem with remanufacturing ⋮ On multi-item economic lot-sizing with remanufacturing and uncapacitated production
Uses Software
Cites Work
- Reverse logistics and closed-loop supply chain: a comprehensive review to explore the future
- A hybrid VNS approach for the short-term production planning and scheduling: a case study in the pulp and paper industry
- A two phase variable neighborhood search for the multi-product inventory routing problem
- Uncapacitated production planning with multiple product types, returned product remanufacturing, and demand substitution
- Variable neighbourhood search: methods and applications
- Designing and reporting on computational experiments with heuristic methods
- Remanufacturing planning for the reverse Wagner/Whitin models
- Quantitative models for sustainable supply chain management: developments and directions
- A variable neighborhood search with an effective local search for uncapacitated multilevel lot-sizing problems
- A reduced variable neighborhood search algorithm for uncapacitated multilevel lot-sizing problems
- Dynamic capacitated lot-sizing problems: a classification and review of solution approaches
- Inventory policies for the economic lot-sizing problem with remanufacturing and final disposal options
- Single item lot sizing problems
- General variable neighborhood search for the multi-product dynamic lot sizing problem in closed-loop supply chain
- Dynamic Version of the Economic Lot Size Model
- A variable neighborhood search for the multi-product inventory routing problem
- MPI Parallelization of Variable Neighborhood Search
- Neighbourhood search meta-heuristics for capacitated lot-sizing with sequence-dependent setups
- Dynamic lot sizing with product returns and remanufacturing
- OR FORUM—The Evolution of Closed-Loop Supply Chain Research
- Minimum cost network flows: Problems, algorithms, and software
This page was built for publication: Variable neighborhood descent heuristic for solving reverse logistics multi-item dynamic lot-sizing problems
