We address in this study the dynamic assignment problem of reusable containers. The objective is optimizing the collect, exploitation, storage and redistribution operations under a carbon emission constraint over a finite planning horizon. We present a new generic mathematical model, which describes the mentioned problem. A Mixed Integer Programming (MIP) model was developed to solve the problem, the model which is very time consuming, was tested on Cplex (Software optimizer). We then adapted two hybrid approaches based on a genetic algorithm to solve the problem at a reduced time cost. The second configuration of the proposed hybrid method is enhanced with a local search procedure based on the Variable Neighborhood Search (VNS). The numerical results have shown that both developed hybrid approaches generate high-quality solutions in a moderate computational time, especially the second hybrid method.
Hydride algorithms for assignment problem of reusable containers in closed loop supply chain
1 Views
1 Downloads