A hybrid heuristic approach to solve the multi level capacitated lot sizing problem

Nenhuma Miniatura disponível



Título da Revista

ISSN da Revista

Título de Volume



This paper presents preliminary results found by a hybrid heuristic applied to solve the Multi-Level Capacitated Lot Sizing Problem (MLCLSP). The proposed method combines a multi-population genetic algorithm and fix-and-optimize heuristic. These methods are also integrated to a mathematical programming approach. For this, a mathematical reformulation of MLCLSP model is proposed to embed the exact solution of the model in the heuristic approaches. The hybrid heuristic is evaluated in two sets of benchmark instances. The solutions found are compared with those reached by other methods from literature. The preliminary results obtained indicate that the hybrid heuristic outperforms other approaches in the majority of problems solved. © 2011 IEEE.



Genetic algorithms, Heuristic algorithms, Lot sizing, Optimization, Production planning

Como citar

2011 IEEE Congress of Evolutionary Computation, CEC 2011, p. 1194-1201.