Simulated annealing algorithm for solving an aggregate production planning model with product returns
عنوان مقاله: Simulated annealing algorithm for solving an aggregate production planning model with product returns
شناسه ملی مقاله: ICMNGCONF01_026
منتشر شده در کنفرانس بین المللی پژوهشهای نوین در مدیریت و مهندسی صنایع در سال 1394
شناسه ملی مقاله: ICMNGCONF01_026
منتشر شده در کنفرانس بین المللی پژوهشهای نوین در مدیریت و مهندسی صنایع در سال 1394
مشخصات نویسندگان مقاله:
Hossein Alipour - Assistant Professor, Industrial Eng. Dept., Khalkhal Branch, Islamic Azad University, Khalkhal, Iran
خلاصه مقاله:
Hossein Alipour - Assistant Professor, Industrial Eng. Dept., Khalkhal Branch, Islamic Azad University, Khalkhal, Iran
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.
کلمات کلیدی: Aggregate Production Planning, Product Returns, Taguchi method
صفحه اختصاصی مقاله و دریافت فایل کامل: https://civilica.com/doc/435055/