Abstract
An improved grouping genetic algorithm is proposed to solve the one-dimensional bin packing problem. In this algorithm, a new crossover operator is constructed according to the characteristics of the encoding. At the same time, a replacement insertion method is designed to improve the mutation operation. The new mutation operation prevents the algorithm from falling into a local optimum and improves the transmission speed of the best individual in the chromosome. The analysis and comparison of experimental results show that the proposed algorithm can effectively solve the one-dimensional bin packing problem and has reliable global convergence.
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.
