Abstract
This study proposes methods to improve the convergence of the novel optimization method, Big Bang–Big Crunch (BB–BC). Uniform population method has been used to generate uniformly distributed random points in the Big Bang phase. Chaos has been utilized to rapidly shrink those points to a single representative point via a center of mass in the Big Crunch phase. The proposed algorithm has been named as Uniform Big Bang–Chaotic Big Crunch (UBB–CBC). The performance of the UBB–CBC optimization algorithm demonstrates superiority over the BB–BC optimization for the benchmark functions.
Sign-in/Register to access full text options 
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: Communications in Nonlinear Science and Numerical Simulation
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.
