این سایت در حال حاضر پشتیبانی نمی شود و امکان دارد داده های نشریات بروز نباشند
International Journal of Engineering، جلد ۲۷، شماره ۱۲، صفحات ۱۸۹۷-۱۹۰۶
عنوان فارسی
چکیده فارسی مقاله
کلیدواژه‌های فارسی مقاله
عنوان انگلیسی Deterministic and Metaheuristic Solutions for Closed-loop Supply Chains with Continuous Price Decrease
چکیده انگلیسی مقاله In a global economy, an efficient supply chain as a main core competency empowers enterprises to provide products or services at the right time in the right quantity, at a low cost. This paper is to plan a single product, multi-echelon, multi-period closed loop supply chain for high-tech products (which have continuous price decrease). Ultimately, considering components rated to procurement, production, distribution, recycling and disposal, the final decisions are made. To solve the mixed integer linear programming (MILP) model for closed loop supply chain (CLSC) network plan of the paper, four heuristics-based methods including genetic algorithm (GA), particle swarm optimization (PSO), differential evolution (DE), and artificial bee colony (ABC) are proposed. Finally, the computational results of these four methods are compared with the solutions obtained by GAMS optimization software. The solution revealed that the ABC methodology performs comparatively better in terms of both quality of solutions and computational time.
کلیدواژه‌های انگلیسی مقاله
نویسندگان مقاله Hasan Khademi Zare |
IE yazd, Yazd University

Mohammad Ali Vahdat-Zad |
Industrial Engineering, University of Yazd

A. Sadegheih |
IE yazd, Yazd University

Hamid Reza Kamali |
Industrial Engineering, University of Yazd

نشانی اینترنتی http://www.ije.ir/article_72435_c089f4a90fa2ef48b932d7cae593e3fa.pdf
فایل مقاله اشکال در دسترسی به فایل - ./files/site1/rds_journals/409/article-409-2062606.pdf
کد مقاله (doi)
زبان مقاله منتشر شده en
موضوعات مقاله منتشر شده
نوع مقاله منتشر شده
برگشت به: صفحه اول پایگاه   |   نسخه مرتبط   |   نشریه مرتبط   |   فهرست نشریات