Three Meta-Heuristic Algorithms For the Single-Item Capacitated Lot-Sizing Problem

This paper proposes a mixed integer programming model for single-item capacitated lot-sizing problem with setup times, safety stock, demand shortages, outsourcing and inventory capacity. due to the complexity of problem, three meta-heuristics algorithms named simulated annealing (sa), vibration damping optimization (vdo) and harmony search (hs) have been used to solve this model. additionally, taguchi method is conducted to calibrate the parameters of the meta-heuristics and select the optimal levels of the algorithm's performance influential factors. computational results on a set of randomly generated instances show the efficiency of the hs against vdo and sa.