Hybrid resolution approaches for dynamic assignment problem of reusable containers

Abstract

In this study, we are interested in the reusing activities of reverse logistics. We focus on the dynamic assignment of reusable containers problem (e.g. gas bottles, beverages, pallets, maritime containers, etc.). The objective is to minimize the collect, reloading, storage and redistribution operations costs over a fixed planning horizon taking into account the greenhouse gas emissions. We present a new generic Mixed Integer Programming (MIP) model for the problem. The proposed model was solved using the IBM ILOG CPLEX optimization software; this method yield exact solutions, but it is very time consuming. So we adapted two hybrid approaches using a genetic algorithm to solve the problem at a reduced time (The second hybrid approach is enhanced with a local search procedure based on the Variable Neighborhood Search VNS). The numerical results show that both developed hybrid approaches generate high-quality solutions in a moderate computational time, especially the second hybrid method.