Three Meta-heuristic Algorithms for the Single-item Capacitated Lot-sizing Problem

سال انتشار: 1393
نوع سند: مقاله ژورنالی
زبان: انگلیسی
مشاهده: 565

فایل این مقاله در 10 صفحه با فرمت PDF قابل دریافت می باشد

استخراج به نرم افزارهای پژوهشی:

لینک ثابت به این مقاله:

شناسه ملی سند علمی:

JR_IJE-27-8_008

تاریخ نمایه سازی: 12 آبان 1393

چکیده مقاله:

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

نویسندگان

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