Reverse Logistics Optimization: Application to Reusable Containers
Zied Jemai (),
Guillaume Goudenege and
Chengbin Chu ()
Additional contact information
Zied Jemai: LGI - Laboratoire Génie Industriel - EA 2606 - CentraleSupélec
Chengbin Chu: LGI - Laboratoire Génie Industriel - EA 2606 - CentraleSupélec
Post-Print from HAL
Abstract:
Reverse Logistics is now considered as an interesting source of economies in supply chain management. Through different activities, this logistics has received increasing attention from researchers and practitioners. In this paper, we are interested in a tactical problem by focusing on the optimization of return flows of reusable containers, while considering an existing network. This situation is very encountered by third part logistics companies. The optimization model we propose is a MILP which minimizes the total cost of these return flows. In order to be realistic, we want to use this model on large size networks. The key point is the computation time which exponentially increases with the size of the problem. A simple heuristic is also proposed in order to reduce this computational time. Finally, a numerical experiment is presented to demonstrate the performance of the developed model as well as the efficiency of the proposed heuristic.
Keywords: Reverse Logistics; Optimization Model; Heuristic; Reusable containers (search for similar items in EconPapers)
Date: 2011-05-25
References: Add references at CitEc
Citations:
Published in International Conference on Industrial Engineering and Systems Management (IESM), May 2011, Metz, France
There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:hal:journl:hal-01672428
Access Statistics for this paper
More papers in Post-Print from HAL
Bibliographic data for series maintained by CCSD ().