Abstract
A hybrid version of a compact genetic algorithm (cGA) is presented as approach to solve the Multi-Level Capacitated Lot Sizing Problem. The present paper extends results reported in [18]. The hybrid method combines a fix and optimize heuristic with cGA aiming to improve solutions generated by cGA. Also a linear mathematical programming model is solved to first evaluated solution provided by cGA. The performance of the hybrid compact genetic algorithm (HcGA) is evaluated over two sets of benchmark instances. The results are compared against methods from literature recently proposed for the same problem: two time-oriented decomposition heuristics and a hybrid multi-population genetic algorithm. A superior performance of HcGA is reported mainly for instances dealing with setup times and against time-oriented decomposition heuristics.
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 callDisclaimer: 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.
