یک روش الگوریتم ژنتیک برای توسعه شبکه چند پله لجستیک معکوس برای بازده محصول
|کد مقاله||سال انتشار||مقاله انگلیسی||ترجمه فارسی||تعداد کلمات|
|51625||2006||14 صفحه PDF||سفارش دهید||7749 کلمه|
Publisher : Elsevier - Science Direct (الزویر - ساینس دایرکت)
Journal : Omega, Volume 34, Issue 1, January 2006, Pages 56–69
Traditionally, product returns have been viewed as an unavoidable cost of doing business, forfeiting any chance of cost savings. As cost pressures continue to mount in this era of economic downturns, a growing number of firms have begun to explore the possibility of managing product returns in a more cost-efficient manner. However, few studies have addressed the problem of determining the number and location of centralized return centers (i.e., reverse consolidation points) where returned products from retailers or end-customers were collected, sorted, and consolidated into a large shipment destined for manufacturers’ or distributors’ repair facilities. To fill the void in such a line of research, this paper proposes a nonlinear mixed-integer programming model and a genetic algorithm that can solve the reverse logistics problem involving product returns. The usefulness of the proposed model and algorithm was validated by its application to an illustrative example dealing with products returned from online sales.