A variable neighborhood decomposition search algorithm for multilevel capacitated lot-sizing problems
From MaRDI portal
Publication:2840764
DOI10.1016/j.endm.2012.10.018zbMath1268.90166MaRDI QIDQ2840764
Chao Xie, Qiu Hong Zhao, Yi-Yong Xiao
Publication date: 23 July 2013
Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.endm.2012.10.018
variable neighborhood decomposition search; accurate mixed integer programming; multi-level capacitated lot-sizing (MLCLSP)
90C11: Mixed integer programming
90C59: Approximation methods and heuristics in mathematical programming
Related Items
Variable neighborhood search for the pharmacy duty scheduling problem, A hybrid genetic algorithm and variable neighborhood search for multi-family capacitated lot-sizing problem, A variable neighborhood search for multi-family capacitated lot-sizing problem, A modeling framework and local search solution methodology for a production-distribution problem with supplier selection and time-aggregated quantity discounts
Uses Software
Cites Work
- Variable neighborhood search
- A reduced variable neighborhood search algorithm for uncapacitated multilevel lot-sizing problems
- Variable neighbourhood decomposition search for \(0\)-\(1\) mixed integer programs
- A Lagrangean-Based Heuristic for Dynamic Multilevel Multiitem Constrained Lotsizing with Setup Times
- An effective heuristic for the CLSP with set-up times
