Adaptive mutation-driven search for global minima in 3D coulomb clusters: A new method with preliminary applications

S. P. Bhattacharyya, Kanchan Sarkar

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

A single-string-based evolutionary algorithm that adaptively learns to control the mutation probability (pm) and mutation intensity (Δm) has been developed and used to investigate the ground-state configurations and energetics of 3D clusters of a finite number (N) of ‘point-like’ charged particles. The particles are confined by a harmonic potential that is either isotropic or anisotropic. The energy per particle (EN /N) and its first and second differences are analyzed as functions of confinement anisotropy, to understand the nature of structural transition in these systems.

Original languageEnglish (US)
Title of host publication2nd International Conference on Soft Computing for Problem Solving, SocProS 2012, Proceedings
EditorsB.V. Babu, Atulya Nagar, Jagdish Chand Bansal, Millie Pant, Kusum Deep, Kanad Ray, Umesh Gupta
PublisherSpringer- Verlag
Pages1237-1243
Number of pages7
ISBN (Electronic)9788132216018
DOIs
StatePublished - Jan 1 2014
Event2nd International Conference on Soft Computing for Problem Solving, SocProS 2012 - Jaipur, India
Duration: Dec 28 2012Dec 30 2012

Publication series

NameAdvances in Intelligent Systems and Computing
Volume236
ISSN (Print)2194-5357

Other

Other2nd International Conference on Soft Computing for Problem Solving, SocProS 2012
CountryIndia
CityJaipur
Period12/28/1212/30/12

Keywords

  • 3D Coulomb clusters
  • Genetic algorithm
  • Mutation intensity
  • Mutation probability
  • Simulated annealing

Fingerprint Dive into the research topics of 'Adaptive mutation-driven search for global minima in 3D coulomb clusters: A new method with preliminary applications'. Together they form a unique fingerprint.

Cite this