CIVILICA We Respect the Science
(ناشر تخصصی کنفرانسهای کشور / شماره مجوز انتشارات از وزارت فرهنگ و ارشاد اسلامی: ۸۹۷۱)

Modeling Techniques and Optimization Tools In Reverse Logistics Networks

عنوان مقاله: Modeling Techniques and Optimization Tools In Reverse Logistics Networks
شناسه ملی مقاله: MANAGTOOLS01_095
منتشر شده در اولین کنفرانس بین المللی ابزار و تکنیکهای مدیریت در سال 1393
مشخصات نویسندگان مقاله:

Abdolhossein Sadrnia - Associated Professor in university of Quchan advanced technologies

خلاصه مقاله:
Reverse and closed-loop logistics networks that make an infrastructure to recover used product in end-of life has attracted growing attention due to stringent pressures from environmental legislative, social requirements and economic benefits. In this reason effective and efficient design of reverse andclosed-loop logistics are being main concerns in supply chains by practitioners and researchers. An optimized reverse supply chain is anappropriate network of facilities and activities that procure, produce, and collecting used products from customers. Varieties of reverse and closed-looplogistics problems modeling methods have lately become very valuable tools for solving them. The complexity of the mathematical models precludes thepossibility of developing a general algorithm and technique for solving all the models in the subject. Therefore, the variety of heuristics and meta-heuristicsalgorithms have been deployed in the past years to overcome the problem. In this paper, a comprehensive modeling method and solution techniques thathave been used by scholars for developing reverse and closed-loop logistics network since 1995 are listed. A brief review of methods and techniques characteristics and its applications issue in reverse and closed-loop logistics network design are investigated.

کلمات کلیدی:
Reverse logistics, Closed-loop supply chain, logistics, Logistics network design, Heuristics and meta-heuristics algorithms, Genetic algorithm

صفحه اختصاصی مقاله و دریافت فایل کامل: https://civilica.com/doc/476836/