Abstract
This paper proposes a genetic algorithm (GA) as a heuristic for multilevel lot sizing, combined with the Bit Mod heuristic developed in this context, and invoking adaptive probabilities for crossover and mutation. The influence of various parameters under fixed and rolling horizons is detailed. Design of experiments methodology is used in this connection. In the rolling horizon, the behaviour of the GA and other rules are compared with and without freezing the plan. The performance of the GA is compared with the cost-modified Wagner Whitin algorithm and cost-modified silver meal methods. The superiority of the proposed method is discussed, and case studies are given.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: The International Journal of Advanced Manufacturing Technology
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
