Abstract
A new global optimization algorithm, based on the concept of excitable walkers, is proposed. The walkers perform parallel Monte Carlo walks on the locally minimized potential energy surface, and effectively repel each other in an appropriate order parameter space. The algorithm is applied to different nanocluster systems (Lennard–Jones and binary metallic clusters) and is proved to be very efficient in locating the global minima of multiple-funnel potential energy surfaces.
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 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.
