2016 IEEE Congress on Evolutionary Computation (CEC) 2016
DOI: 10.1109/cec.2016.7743969
|View full text |Cite
|
Sign up to set email alerts
|

Hybrid parameter control approach applied to a diversity-based multi-objective memetic algorithm for frequency assignment problems

Abstract: In order to address the difficult issue of parameter setting within a diversity-based Multi-objective Evolutionary Algorithm (MOEA), we recently proposed a hybrid control scheme based on both Fuzzy Logic Controllers (FLCs) and Hyperheuristics (HHs). The method simultaneously adapts both symbolic and numeric parameters and was shown to be effective when controlling a diversity-based MOEA applied to a range of benchmark problems. Here, we show that the hybrid control scheme generalises to other meta-heuristics b… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 18 publications
0
2
0
Order By: Relevance
“…The strength of multi-objective optimization has motivated researchers to develop a multi-objectivized version of the FAP [49]. In this form, the problem is treated as a single-objective minimization task in a multi-objective framework with a main objective and additional objectives that measure diversity in terms of the distance to the closest neighbour [50] or the average distance to all individuals, and which may be maximized [51][52][53].…”
Section: (Vii) Network Perturbationmentioning
confidence: 99%
See 1 more Smart Citation
“…The strength of multi-objective optimization has motivated researchers to develop a multi-objectivized version of the FAP [49]. In this form, the problem is treated as a single-objective minimization task in a multi-objective framework with a main objective and additional objectives that measure diversity in terms of the distance to the closest neighbour [50] or the average distance to all individuals, and which may be maximized [51][52][53].…”
Section: (Vii) Network Perturbationmentioning
confidence: 99%
“…One generalization assumes that, given a simple graph 𝐺 = (𝑉, 𝐸), each node 𝑖 of 𝑉 is associated with a list 𝐿 of allowed colours [51,52]. The lists are not necessarily of the same length.…”
Section: (I) Set or List Colouring Problemmentioning
confidence: 99%