A genetic algorithm to solve the general multi-level lot-sizing problem with time-varying costs
چکیده
The multi-level lot-sizing (MLLS) problem in material requirements planning (MRP) systems belongs to those problems that industry manufacturers daily face in organizing their overall production plans. However, this combinatorial optimization problem can be solved optimally in a reasonable CPU only when very small instances are considered. This legitimates the search for heuristic techniques that achieve a satisfactory balance between computational demands and cost e!ectiveness. In this paper, we propose a solution method that exploits the virtues and relative simplicity of genetic algorithms to address combinatorial problems. The MLLS problem that is examined here is the most general version in which the possibility of time-varying costs is allowed. We develop a binary encoding genetic algorithm and design "ve speci"c genetic operators to ensure that exploration takes place within the set of feasible solutions. An experimental framework is set up to test the e$ciency of the proposed method, which turns out to rate high both in terms of cost e!ectiveness and execution speed. ( 2000 Elsevier Science B.V. All rights reserved.