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

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

Bhattacharyya, S. P., & Sarkar, K. (2014). Adaptive mutation-driven search for global minima in 3D coulomb clusters: A new method with preliminary applications. In Advances in Intelligent Systems and Computing (Vol. 236, pp. 1237–1243). Springer Verlag. https://doi.org/10.1007/978-81-322-1602-5_129

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free