Abstract
The machine-part cell formation is a NP- complete combinational optimization problem. Past research has shown that although the genetic algorithm (GA) can get high quality solutions, special selection strategy, crossover and mutation operators as well as the parameters must be defined previously to solve the problem efficiently and flexibly. In this paper, an improved permutation code PBIL is adopted to solve the machine-part cell formation problem. Simulation results on five well known problems show that the PBIL can get satisfied solutions more simply and efficiently.
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.
