2012 Loughborough Antennas &Amp; Propagation Conference (LAPC) 2012
DOI: 10.1109/lapc.2012.6403005
|View full text |Cite
|
Sign up to set email alerts
|

Hybrid multiobjective optimization using modified cuckoo search algorithm in linear array synthesis

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2013
2013
2022
2022

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 7 publications
(4 citation statements)
references
References 6 publications
0
4
0
Order By: Relevance
“…After proving to be efficient and fast and cost-effective for solving single-objective problems, the CS metaheuristic optimization algorithm has been extended to the multiobjective version by Yang and Deb. 29 This version has been used to solve various problems; for further information and a more in-depth analysis of the diverse applications, the reader may refer to Wang et al, 30 Rani et al, 31 and Fister et al 32 The NSCS was developed by He et al 33 According to Deb et al, 25 each solution must be compared to the entire population, in order to determine if it is dominated by another solution. Then, a sorting by fronts is done in the following order: the first front contains the solutions that are nondominated by other solutions.…”
Section: Nscs Algorithmmentioning
confidence: 99%
“…After proving to be efficient and fast and cost-effective for solving single-objective problems, the CS metaheuristic optimization algorithm has been extended to the multiobjective version by Yang and Deb. 29 This version has been used to solve various problems; for further information and a more in-depth analysis of the diverse applications, the reader may refer to Wang et al, 30 Rani et al, 31 and Fister et al 32 The NSCS was developed by He et al 33 According to Deb et al, 25 each solution must be compared to the entire population, in order to determine if it is dominated by another solution. Then, a sorting by fronts is done in the following order: the first front contains the solutions that are nondominated by other solutions.…”
Section: Nscs Algorithmmentioning
confidence: 99%
“…• Hybrid multiobjective optimization using modified cuckoo search algorithm in linear array synthesis [67].…”
Section: Multi-objective Optimizationmentioning
confidence: 99%
“…The CS algorithm, developed by Yang and Deb in 2009, is one of the most powerful population-based optimization search techniques [38]. Because of its global convergence property [39][40][41][42], the CS has been successfully applied to optimize many real-world engineering design problems, such as wind turbine blades [43], antenna arrays [44][45][46][47][48][49][50][51][52], power systems [53], travelling salesman [54], structural design problems [55], wireless communications [56][57], flow shop scheduling problem [58], job shop scheduling problem [59], model order reduction [60], control systems [61], transmission lines [62], and image processing [63]. The main purpose of this paper is to report a new approach and extend our work in [49][50][51][52][53] and explore the performance of the CS algorithm in the design and optimization of IIR DDs and DIs in comparison with other methods.…”
Section: Introductionmentioning
confidence: 99%