A multi-level annealing genetic algorithm for capacitated dynamic lot-sizing problem of MRP II

A multi-level annealing genetic algorithm for capacitated dynamic lot-sizing problem of MRP II

0.00 Avg rating0 Votes
Article ID: iaor20023577
Country: China
Volume: 23
Issue: 2
Start Page Number: 58
End Page Number: 59
Publication Date: Feb 2001
Journal: Chinese Journal of Systems Engineering and Electronics
Authors: ,
Keywords: genetic algorithms, lot sizing
Abstract:

The capacitated dynamic lot-sizing problem (CLSP) is an effective methodology to deal with inconsistency between lot-sizing and capacity planning. By using a penalty function the CLSP is transformed into an uncapacitated lot-sizing problem (ULSP). A multi-level annealing genetic algorithm (MLAGA) is proposed to solve the transformed ULSP. The result of a real world example for a machine shop shows that the algorithm is effective.

Reviews

Required fields are marked *. Your email address will not be published.