2009
DOI: 10.1016/j.aeue.2008.04.001
|View full text |Cite
|
Sign up to set email alerts
|

Array pattern optimization using electromagnetism-like algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
19
0

Year Published

2011
2011
2019
2019

Publication Types

Select...
5
4

Relationship

1
8

Authors

Journals

citations
Cited by 43 publications
(20 citation statements)
references
References 13 publications
0
19
0
Order By: Relevance
“…Compared with the other methods, EM is a much more powerful algorithm for global optimization [26]. EM has been used in the areas of function optimization, resource constraint project scheduling problems [29], flowshop scheduling problem [30], array pattern optimization [31] and FOPID control optimization [32]. EM includes four phases: initialization of the algorithm, local search, calculation of total force vector, and movement according to the total force [26−28].…”
Section: Original Electromagnetism-like Algorithmmentioning
confidence: 99%
“…Compared with the other methods, EM is a much more powerful algorithm for global optimization [26]. EM has been used in the areas of function optimization, resource constraint project scheduling problems [29], flowshop scheduling problem [30], array pattern optimization [31] and FOPID control optimization [32]. EM includes four phases: initialization of the algorithm, local search, calculation of total force vector, and movement according to the total force [26−28].…”
Section: Original Electromagnetism-like Algorithmmentioning
confidence: 99%
“…Such decision variables represent a different threshold point th that is used for the segmentation. Therefore, the complete population is represented as: (26) Where t represents the iteration number, T refers to the transpose operator, N is the size of the population and 1, 2,3 c  is set for RGB images while 1 c  is chosen for gray scale images. For this problem, the boundaries of the search space are set to 0 l  and 255 u  , which correspond to image intensity levels.…”
Section: Particle Representationmentioning
confidence: 99%
“…Although the EMO algorithm shares some characteristics to PSO and ACO, recent works have exhibited its better accuracy regarding optimal parameters [18 -21], yet showing convergence [22]. In recent works, EMO has been used to solve different sorts of engineering problems such as flow-shop scheduling [23], communications [24], vehicle routing [25], array pattern optimization in circuits [26], neural network training [27], image processing [28] and control systems [29]. Although EMO algorithm shares several characteristics to other evolutionary approaches, recent works (see [18][19][20][21]) have exhibited a better EMO's performance in terms of computation time and precision when it is compared with other methods such as GA, PSO and ACO.…”
Section: Introductionmentioning
confidence: 99%
“…It has been effectively used in different sorts of research and engineering problems, such as neural network training [6], vehicle routing problems [7] flow shop scheduling problems [8], communication [9], array pattern optimization in circuits [10], image processing [11], intelligent forecasting [12], and control systems [13] and so on. But EMA exist some defects such as premature convergence etc.…”
Section: Introductionmentioning
confidence: 99%