Abstract
Production planning problems with setup decisions, which were formulated as mixed integer programmes (MIP), are solved in this study. The integer component of the MIP solution is determined by three evolution algorithms used in this study. Firstly, a traditional genetic algorithm (GA) uses conventional crossover and mutation operators for generating new chromosomes (solutions). Secondly, a modified GA uses not only the conventional operators but also a sibling operator, which stochastically produces new chromosomes from old ones using the sensitivity information of an associated linear programme. Thirdly, a sibling evolution algorithm uses only the sibling operator to reproduce. Based on the experiments done in this study, the sibling evolution algorithm performs the best among all the algorithms used in this study.
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.
