Optimizing two-level reverse distribution networks with hybrid memetic algorithms

In a Two-Level Reverse Distribution Network, products are returned from customers to manufacturers through collection and refurbishing sites. The costs of the reverse chain often overtake the costs of the forward chain by many times. With some known algorithms for the problem as reference, we propose a hybrid memetic algorithm that uses linear programming and a heuristic for defining routes. Moreover, we describe heuristics for deciding locations, algorithms to define routes for the products, and problem-specific genetic operators. Memetic algorithms have returned the best results for all instances.