A tabu search heuristic for reverse logistics network design

سال انتشار: 1391
نوع سند: مقاله کنفرانسی
زبان: انگلیسی
مشاهده: 1,798

فایل این مقاله در 7 صفحه با فرمت PDF قابل دریافت می باشد

استخراج به نرم افزارهای پژوهشی:

لینک ثابت به این مقاله:

شناسه ملی سند علمی:

IIEC09_285

تاریخ نمایه سازی: 26 اسفند 1391

چکیده مقاله:

Reverse logistics (RLs) network design issues have been popularly discussed in recent years. However, few papers in past literatures have been dedicated to the use of incentive effecton return quantity of used products. This study formulates an optimization model of RLs network design with the aim ofmanagement in allocating used product by coordinating collection centers and recovery facilities to ensure minimum cost. This work assumes collection centers as having multi-capacity levels and the model is multi-period. Due to the fact that problem is known as NP-hard, is proposed a hybrid heuristic methodsbased tabu search (TS) solution procedures to solve this problem. Finally, we discuss several dominance properties of optimalsolutions and for the sake of comparison a medium size numerical example is presented to show the efficiency of the model.

کلیدواژه ها:

dynamic reverse logistics ، mixed integer nonlinear programming model ، heuristic algorithm

نویسندگان

Mohammad Asghari

Ferdowsi University of Mashhad

Samaneh Nezhadali

Iran Chamber of Commerce, Industries and Mines

Mostafa Kazemi

Ferdowsi University of Mashhad