Skip navigation
Please use this identifier to cite or link to this item: http://repository.iitr.ac.in/handle/123456789/19000
Full metadata record
DC FieldValueLanguage
dc.contributor.authorDeep, K.-
dc.contributor.authorShashi-
dc.contributor.authorKatiyar V.K.-
dc.date.accessioned2020-12-03T06:29:39Z-
dc.date.available2020-12-03T06:29:39Z-
dc.date.issued2011-
dc.identifier.citationProceedings of 2011 International Conference on Communication Systems and Network Technologies, CSNT 2011, (2011), 614- 618. Katra, Jammu-
dc.identifier.isbn9.78E+12-
dc.identifier.urihttps://doi.org/10.1109/CSNT.2011.132-
dc.identifier.urihttp://repository.iitr.ac.in/handle/123456789/19000-
dc.description.abstractIn this paper recently developed real coded genetic algorithms are applied to the challenging problem of finding the minimum energy configuration of a cluster of identical atoms interacting through the Lennard-Jones potential. Finding the global optimum of this function is very difficult because it has a large number of local minima, which grows exponentially with molecule size. Computational results for atomic cluster containing up to 15 atoms are obtained and presented. The obtained results show the remarkable performance of newly developed real coded genetic algorithms as compared to to the earlier published results. © 2011 IEEE.-
dc.description.sponsorshipIEEE;MIR Labs;MTT-S-
dc.language.isoen_US-
dc.relation.ispartofProceedings of 2011 International Conference on Communication Systems and Network Technologies, CSNT 2011-
dc.subjectAtomic cluster-
dc.subjectGlobal optimization-
dc.subjectLennard-Jones potential-
dc.subjectReal coded genetic algorithm-
dc.subjectAtomic clusters-
dc.subjectComputational results-
dc.subjectGlobal optimum-
dc.subjectLennard-Jones potential-
dc.subjectLocal minimums-
dc.subjectMinimum energy configuration-
dc.subjectMolecule sizes-
dc.subjectReal coded genetic algorithm-
dc.subjectAtomic beams-
dc.subjectAtoms-
dc.subjectCommunication systems-
dc.subjectGenetic algorithms-
dc.subjectGlobal optimization-
dc.subjectOptimization-
dc.subjectClustering algorithms-
dc.titleGlobal optimization of lennard-jones potential using newly developed real coded genetic algorithms-
dc.typeConference Paper-
dc.scopusid8561208900-
dc.scopusid8301540900-
dc.scopusid6603690424-
dc.affiliationDeep, K., Department of Mathematics, Indian Institute of Technology Roorkee, Roorkee, India-
dc.affiliationShashi, Department of Mathematics, Indian Institute of Technology Roorkee, Roorkee, India-
dc.affiliationKatiyar, V.K., Department of Mathematics, Indian Institute of Technology Roorkee, Roorkee, India-
dc.description.correspondingauthorDeep, K.; Department of Mathematics, Indian Institute of Technology Roorkee, Roorkee, India; email: kusumfma@iitr.ernet.in-
dc.identifier.conferencedetails2011 International Conference on Communication Systems and Network Technologies, CSNT 2011, Katra, Jammu, 3-5 June 2011-
Appears in Collections:Conference Publications [MA]

Files in This Item:
There are no files associated with this item.
Show simple item record


Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.