A hybrid genetic algorithm and variable neighborhood search for multi-family capacitated lot-sizing problem
From MaRDI portal
Publication:1687655
DOI10.1016/j.endm.2017.03.014zbMath1387.90284OpenAlexW2606593865MaRDI QIDQ1687655
Publication date: 4 January 2018
Full work available at URL: https://doi.org/10.1016/j.endm.2017.03.014
Applications of mathematical programming (90C90) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (2)
An effective multi-objective particle swarm optimization for the multi-item capacitated lot-sizing problem with set-up times and backlogging ⋮ A variable neighborhood search for multi-family capacitated lot-sizing problem
Cites Work
- A GLNPSO for multi-level capacitated lot-sizing and scheduling problem in the poultry industry
- Combining the principles of variable neighborhood decomposition search and the Fix\&Optimize heuristic to solve multi-level lot-sizing and scheduling problems
- Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches
- Variable neighborhood search
- A variable neighborhood search with an effective local search for uncapacitated multilevel lot-sizing problems
- Lot sizing and furnace scheduling in small foundries
- A variable neighborhood decomposition search algorithm for multilevel capacitated lot-sizing problems
- An effective heuristic for the CLSP with set-up times
This page was built for publication: A hybrid genetic algorithm and variable neighborhood search for multi-family capacitated lot-sizing problem
