Simulated annealing algorithm for solving an aggregate production planning model with product returns
سال انتشار: 1394
نوع سند: مقاله کنفرانسی
زبان: انگلیسی
مشاهده: 779
فایل این مقاله در 9 صفحه با فرمت PDF قابل دریافت می باشد
- صدور گواهی نمایه سازی
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
ICMNGCONF01_026
تاریخ نمایه سازی: 30 بهمن 1394
چکیده مقاله:
In this paper, we develop a mixed integer linear programming (MILP) model for aggregate production planning system with product returns. These returned products can either be disposed or be remanufactured to be sold as new ones again; hence the market demands can be satisfied by either newly produced products or remanufactured ones. The capacities of production, disposal and remanufacturing are limited. Due to NP-hard class of APP, we implement asimulated annealing (SA). Additionally, Taguchi method is conducted to calibrate the parameter of the meta-heuristics and select the optimal levels of the algorithm’s performance influential factors.
کلیدواژه ها:
نویسندگان
Hossein Alipour
Assistant Professor, Industrial Eng. Dept., Khalkhal Branch, Islamic Azad University, Khalkhal, Iran