کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
8101128 1522115 2016 28 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Advanced cross-entropy in closed-loop supply chain planning
ترجمه فارسی عنوان
انتروپی متقاطع پیشرفته در برنامه ریزی زنجیره تامین حلقه بسته
کلمات کلیدی
متقاطع آنتروپی، انتروپی متقابل پیشرفته، الگوریتم ژنتیک، زنجیره تامین حلقه بسته،
موضوعات مرتبط
مهندسی و علوم پایه مهندسی انرژی انرژی های تجدید پذیر، توسعه پایدار و محیط زیست
چکیده انگلیسی
Developing new methodologies for nondeterministic polynomial (NP-hard) problems such as supply chain network design is always a major consideration for academia and practitioners. In this paper a cross-entropy (CE) based solution methodology is developed in order to cope with complex combinatorial problems. The NP-hard problem of designing and planning a closed-loop supply chain (CLSC) is considered. Furthermore, a multi-product multi-period CLSC network in a mixed-integer programming structure is regarded. On the other side, cross-entropy is one of the newly developed and successful metaheuristic algorithms. Thus, in order to achieve better solutions in comparison with current solution methodologies, a cross-entropy algorithm is developed for the first time in CLSC design and planning. Then, the capabilities of the cross-entropy algorithm are elevated, in order to achieve solutions that are more robust. Therefore, an algorithm, which is called “advanced cross-entropy” (ACE) is proposed. Finally, two presented CE-based algorithms are compared with a developed genetic algorithm (GA) for the same problem. GA is the most well-known metaheuristic algorithm, which has been abundantly developed in CLSC. Results prove that both of proposed CE-based algorithms dominate current methodologies. Both can find acceptable solutions in comparison with GA. Furthermore, the proposed advanced cross-entropy performs even better than CE in the quality of solutions and time.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Journal of Cleaner Production - Volume 135, 1 November 2016, Pages 201-213
نویسندگان
, , , ,