2010
DOI: 10.1631/jzus.c1000137
|View full text |Cite
|
Sign up to set email alerts
|

A regeneratable dynamic differential evolution algorithm for neural networks with integer weights

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2012
2012
2020
2020

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(4 citation statements)
references
References 27 publications
0
3
0
Order By: Relevance
“…This step was done to find out the best individual xbest, G of current generation, in which G is the index of generation. Bao et al (2010) stated that there are three main steps of DE, which are mutation, crossover, and selection [5]. These steps were performed sequentially and were repeated during the optimization cycle.…”
Section: Differential Evolutionmentioning
confidence: 99%
“…This step was done to find out the best individual xbest, G of current generation, in which G is the index of generation. Bao et al (2010) stated that there are three main steps of DE, which are mutation, crossover, and selection [5]. These steps were performed sequentially and were repeated during the optimization cycle.…”
Section: Differential Evolutionmentioning
confidence: 99%
“…DE's unique population memory capability gives the algorithm a strong global search capability and robust performance. As a highly efficient parallel search algorithm with few controlled parameters, the DE algorithm has been widely used in neuron networks [3,4], power systems [5,6], vehicle routing problems [7][8][9][10][11] and many other fields [12][13][14][15][16][17][18][19][20]. Like other intelligent algorithms, however, the DE algorithm also has disadvantages such as precocity, strong parameter dependence and difficulty in obtaining global optimum values for high-dimensional complex objective functions [21][22][23][24][25][26][27].…”
Section: Introductionmentioning
confidence: 99%
“…Moreover, they are usually larger than 1000 dimensions and solutions. Differential evolution (DE) which is considered as an important branch of the evolutionary algorithms is widely used to solve optimization problems in many fields [1][2][3]. Therefore, we are inspired to apply the differential algorithm to solve the multistage goal programming model of the DPPO problem.…”
Section: Introductionmentioning
confidence: 99%