A heuristic aproach to solve disassembly lot sizing problems

Abstract

In disassembly lot sizing problems the final objective is organize the schedule for disassembly operations in order to recover parts from an initial product in order to satisfy a given demand. This kind of reverse logistic procedures are becoming more and more important every day mainly as a consequence of environmental issues. When a product has arrived at the end of its life their parts can be recycled or used again but we need to organize the operations required in order to obtain the maxim profit and to respect some important constrains. The one studied is a two levels problem without commonality parts. In this project we propose two different methods to solve this disassembly lot sizing problem. The method 1 is divided in three different stages. During the first one, an initial solution is obtained using a fix-and-optimize heuristic. Since the solution after this algorithm can be feasible or not, an algorithm to fix it is proposed in the second stage. In the last stage we propose a tabo research in order to improve the solution. We have used another method which includes exact resolution with integer relaxation and simulated annealing to improve this initial solution. In the last section we show how both methods perform and we compare them.