Three Meta-heuristic Algorithms for the Single-item Capacitated Lot-sizing Problem
عنوان مقاله: Three Meta-heuristic Algorithms for the Single-item Capacitated Lot-sizing Problem
شناسه ملی مقاله: JR_IJE-27-8_008
منتشر شده در شماره 8 دوره 27 فصل August در سال 1393
شناسه ملی مقاله: JR_IJE-27-8_008
منتشر شده در شماره 8 دوره 27 فصل August در سال 1393
مشخصات نویسندگان مقاله:
e Mehdizadeh - Faculty of Industrial and Mechanical Engineering, Qazvin Branch, Islamic Azad University, Qazvin, Iran
a Fatehi Kivi - Faculty of Industrial and Mechanical Engineering, Qazvin Branch, Islamic Azad University, Qazvin, Iran
خلاصه مقاله:
e Mehdizadeh - Faculty of Industrial and Mechanical Engineering, Qazvin Branch, Islamic Azad University, Qazvin, Iran
a Fatehi Kivi - Faculty of Industrial and Mechanical Engineering, Qazvin Branch, Islamic Azad University, Qazvin, Iran
This paper proposes a mixed integer programming model for single-item capacitated lot-sizingproblem with setup times, safety stock, demand shortages, outsourcing and inventory capacity. Due tothe 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 selectthe optimal levels of the algorithm’s performance influential factors. Computational results on a set ofrandomly generated instances show the efficiency of the HS against VDO and SA.
کلمات کلیدی: Lot-sizingSafety stocksSimulated AnnealingVibration damping OptimizationHarmony Search
صفحه اختصاصی مقاله و دریافت فایل کامل: https://civilica.com/doc/308845/