A Hyperheuristic Approach for Dynamic Multilevel Capacitated Lot Sizing with Linked Lot Sizes for APS implementations

Abstract

This study is concerned with solving real-life sized APS (Advanced Planning and Scheduling) problemspractically. Specifically, the problem of Multilevel Capacitated Lot Sizing Problem with linked lot sizes (MLCLSP-L) isconsidered. The problem is a classical, practical and notoriously hard problem. We propose a new modeling techniquefor MLCLSP-L based on a GA-driven hyperheuristic, which enables modeling of some issues previously not modeled.Proposed model uses an indirect representation by allowing GA search through a space of low level heuristics’combinations. Each one of the low level heuristics is simple and determines the detailed production plan of a machinein a period. The solution is constructed through combination of these low level heuristics. New model is demonstratedby solving moderate size test problem along with software developed .”