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

S. P. Bhattacharyya; Kanchan Sarkar

doi:10.1007/978-81-322-1602-5_129

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

S. P. Bhattacharyya, Kanchan Sarkar

Chemical Engineering and Materials Science

Research output: Chapter in Book/Report/Conference proceeding › Conference 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 language	English (US)
Title of host publication	2nd International Conference on Soft Computing for Problem Solving, SocProS 2012, Proceedings
Editors	B.V. Babu, Atulya Nagar, Jagdish Chand Bansal, Millie Pant, Kusum Deep, Kanad Ray, Umesh Gupta
Publisher	Springer Verlag
Pages	1237-1243
Number of pages	7
ISBN (Electronic)	9788132216018
DOIs	https://doi.org/10.1007/978-81-322-1602-5_129
State	Published - 2014
Event	2nd International Conference on Soft Computing for Problem Solving, SocProS 2012 - Jaipur, India Duration: Dec 28 2012 → Dec 30 2012

Publication series

Name	Advances in Intelligent Systems and Computing
Volume	236
ISSN (Print)	2194-5357

Other

Other	2nd International Conference on Soft Computing for Problem Solving, SocProS 2012
Country/Territory	India
City	Jaipur
Period	12/28/12 → 12/30/12

Bibliographical note

Funding Information:
K. Sarkar thanks the CSIR, Government of India, New Delhi, for the award of senior research fellowship, and S.P.B. thanks the DAE, Government of India, for the award of Raja Ramanna Fellowship.

Publisher Copyright:
© Springer India 2014.

Keywords

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

Publisher link

10.1007/978-81-322-1602-5_129

Find It

Find It at U of M Libraries

Cite this

Bhattacharyya, S. P., & Sarkar, K. (2014). Adaptive mutation-driven search for global minima in 3D coulomb clusters: A new method with preliminary applications. In B. V. Babu, A. Nagar, J. C. Bansal, M. Pant, K. Deep, K. Ray, & U. Gupta (Eds.), 2nd International Conference on Soft Computing for Problem Solving, SocProS 2012, Proceedings (pp. 1237-1243). (Advances in Intelligent Systems and Computing; Vol. 236). Springer Verlag. https://doi.org/10.1007/978-81-322-1602-5_129

Adaptive mutation-driven search for global minima in 3D coulomb clusters: A new method with preliminary applications. / Bhattacharyya, S. P.; Sarkar, Kanchan.
2nd International Conference on Soft Computing for Problem Solving, SocProS 2012, Proceedings. ed. / B.V. Babu; Atulya Nagar; Jagdish Chand Bansal; Millie Pant; Kusum Deep; Kanad Ray; Umesh Gupta. Springer Verlag, 2014. p. 1237-1243 (Advances in Intelligent Systems and Computing; Vol. 236).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Bhattacharyya, SP & Sarkar, K 2014, Adaptive mutation-driven search for global minima in 3D coulomb clusters: A new method with preliminary applications. in BV Babu, A Nagar, JC Bansal, M Pant, K Deep, K Ray & U Gupta (eds), 2nd International Conference on Soft Computing for Problem Solving, SocProS 2012, Proceedings. Advances in Intelligent Systems and Computing, vol. 236, Springer Verlag, pp. 1237-1243, 2nd International Conference on Soft Computing for Problem Solving, SocProS 2012, Jaipur, India, 12/28/12. https://doi.org/10.1007/978-81-322-1602-5_129

Bhattacharyya SP, Sarkar K. Adaptive mutation-driven search for global minima in 3D coulomb clusters: A new method with preliminary applications. In Babu BV, Nagar A, Bansal JC, Pant M, Deep K, Ray K, Gupta U, editors, 2nd International Conference on Soft Computing for Problem Solving, SocProS 2012, Proceedings. Springer Verlag. 2014. p. 1237-1243. (Advances in Intelligent Systems and Computing). doi: 10.1007/978-81-322-1602-5_129

Bhattacharyya, S. P. ; Sarkar, Kanchan. / Adaptive mutation-driven search for global minima in 3D coulomb clusters : A new method with preliminary applications. 2nd International Conference on Soft Computing for Problem Solving, SocProS 2012, Proceedings. editor / B.V. Babu ; Atulya Nagar ; Jagdish Chand Bansal ; Millie Pant ; Kusum Deep ; Kanad Ray ; Umesh Gupta. Springer Verlag, 2014. pp. 1237-1243 (Advances in Intelligent Systems and Computing).

@inproceedings{58d748103517483d86dde82caa337bc5,

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

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 {\textquoteleft}point-like{\textquoteright} 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.",

keywords = "3D Coulomb clusters, Genetic algorithm, Mutation intensity, Mutation probability, Simulated annealing",

author = "Bhattacharyya, {S. P.} and Kanchan Sarkar",

note = "Funding Information: K. Sarkar thanks the CSIR, Government of India, New Delhi, for the award of senior research fellowship, and S.P.B. thanks the DAE, Government of India, for the award of Raja Ramanna Fellowship. Publisher Copyright: {\textcopyright} Springer India 2014.; 2nd International Conference on Soft Computing for Problem Solving, SocProS 2012 ; Conference date: 28-12-2012 Through 30-12-2012",

year = "2014",

doi = "10.1007/978-81-322-1602-5_129",

language = "English (US)",

series = "Advances in Intelligent Systems and Computing",

publisher = "Springer Verlag",

pages = "1237--1243",

editor = "B.V. Babu and Atulya Nagar and Bansal, {Jagdish Chand} and Millie Pant and Kusum Deep and Kanad Ray and Umesh Gupta",

booktitle = "2nd International Conference on Soft Computing for Problem Solving, SocProS 2012, Proceedings",

}

TY - GEN

T1 - Adaptive mutation-driven search for global minima in 3D coulomb clusters

T2 - 2nd International Conference on Soft Computing for Problem Solving, SocProS 2012

AU - Bhattacharyya, S. P.

AU - Sarkar, Kanchan

N1 - Funding Information: K. Sarkar thanks the CSIR, Government of India, New Delhi, for the award of senior research fellowship, and S.P.B. thanks the DAE, Government of India, for the award of Raja Ramanna Fellowship. Publisher Copyright: © Springer India 2014.

PY - 2014

Y1 - 2014

N2 - 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.

AB - 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.

KW - 3D Coulomb clusters

KW - Genetic algorithm

KW - Mutation intensity

KW - Mutation probability

KW - Simulated annealing

UR - http://www.scopus.com/inward/record.url?scp=84928037081&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84928037081&partnerID=8YFLogxK

U2 - 10.1007/978-81-322-1602-5_129

DO - 10.1007/978-81-322-1602-5_129

M3 - Conference contribution

AN - SCOPUS:84928037081

T3 - Advances in Intelligent Systems and Computing

SP - 1237

EP - 1243

BT - 2nd International Conference on Soft Computing for Problem Solving, SocProS 2012, Proceedings

A2 - Babu, B.V.

A2 - Nagar, Atulya

A2 - Bansal, Jagdish Chand

A2 - Pant, Millie

A2 - Deep, Kusum

A2 - Ray, Kanad

A2 - Gupta, Umesh

PB - Springer Verlag

Y2 - 28 December 2012 through 30 December 2012

ER -

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

Abstract

Publication series

Other

Bibliographical note

Keywords

Publisher link

Find It

Other files and links

Fingerprint

Cite this