2008
DOI: 10.1016/j.physa.2007.07.075
|View full text |Cite
|
Sign up to set email alerts
|

A genetic algorithm for the 1D electron gas

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
7
0

Year Published

2011
2011
2022
2022

Publication Types

Select...
6

Relationship

1
5

Authors

Journals

citations
Cited by 6 publications
(7 citation statements)
references
References 18 publications
0
7
0
Order By: Relevance
“…In the case when the number of the input factors is not large, such problems are solved by the so called brute force method [16]. However, when there are a sufficiently large number of the input factors, solution to this problem can be obtained using the machine learning methods, for example, using the genetic algorithms [5,[17][18][19][20][21][22].…”
Section: Description Of the Approachmentioning
confidence: 99%
“…In the case when the number of the input factors is not large, such problems are solved by the so called brute force method [16]. However, when there are a sufficiently large number of the input factors, solution to this problem can be obtained using the machine learning methods, for example, using the genetic algorithms [5,[17][18][19][20][21][22].…”
Section: Description Of the Approachmentioning
confidence: 99%
“…It is worth mentioning that in the genetic algorithm me have develop for the 1D electron gas in Ref. [32], instead of using the RPA pseudopotential in Eq. ( 9) we assume that u (r) is an unknown function and the algorithm is designed to completely obtain it.…”
Section: Parameterized Pdfmentioning
confidence: 99%
“…In Physics they have been used in calculations that involve from simple quantum systems [27] to astrophysical systems [28], running through lattice models for spin glasses [29], molecules [30] and clusters [31]. More recently [32] we have developed a genetic algorithm for the PDF of the one-dimensional electron gas in what, at our knowledge, is the first application of this kind of algorithm to describe many-body systems in the thermodynamic limit..…”
Section: Introductionmentioning
confidence: 99%
“…Recent years have witnessed significant progress in the development of evolutionary algorithms (EAs) for multi-objective optimization problems (Huang & Liu, 2010;Knowles & Corne, 2000;Lara, Sanchez, Coello Coello, & Schütze, 2010;Li & Zhang, 2009;Siegfried, Bleuler, Laumanns, Zitzler, & Kinzelbach, 2009;Soylu & Köksalan, 2010;Stoico, Renzi, & Vericat, 2008;Wanner, Guimaraes, Takahashi, Lowther, & Ramirez, 2008;Xue, Sanderson, & Graves, 2009;Yang, Kwan, & Chang, 2008). Multi-objective evolutionary algorithms (MOEAs) aim at finding a set of representative Pareto optimal solutions in a single run.…”
Section: Introductionmentioning
confidence: 99%