A variable neighborhood decomposition search algorithm for multilevel capacitated lot-sizing problems

DOI10.1016/j.endm.2012.10.018zbMath1268.90166OpenAlexW2094823485MaRDI 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

zbMATH Keywords

variable neighborhood decomposition searchaccurate mixed integer programmingmulti-level capacitated lot-sizing (MLCLSP)

Mathematics Subject Classification ID

Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (4)

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

• CPLEX

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

This page was built for publication: A variable neighborhood decomposition search algorithm for multilevel capacitated lot-sizing problems