2022
DOI: 10.1007/s00521-021-06811-z
|View full text |Cite
|
Sign up to set email alerts
|

Multi-objective learner performance-based behavior algorithm with five multi-objective real-world engineering problems

Abstract: In this work, a new multiobjective optimization algorithm called multiobjective learner performance-based behavior algorithm is proposed. The proposed algorithm is based on the process of transferring students from high school to college. The proposed technique produces a set of non-dominated solutions. To judge the ability and efficacy of the proposed multiobjective algorithm, it is evaluated against a group of benchmarks and five real-world engineering optimization problems. Additionally, to evaluate the pro… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
4
3

Relationship

1
6

Authors

Journals

citations
Cited by 20 publications
(2 citation statements)
references
References 37 publications
0
2
0
Order By: Relevance
“…A multiobjective metaheuristic optimizer was used in this investigation. In multi-objective optimization problems [27][28][29][30], there are two or more optimization goals that compete with each other. This means that reaching one goal will make it harder to reach another.…”
Section: Related Workmentioning
confidence: 99%
“…A multiobjective metaheuristic optimizer was used in this investigation. In multi-objective optimization problems [27][28][29][30], there are two or more optimization goals that compete with each other. This means that reaching one goal will make it harder to reach another.…”
Section: Related Workmentioning
confidence: 99%
“…As pointed out in [46], there are several reasons to conclude that it is difficult to measure the time complexity of multi-objective evolutionary algorithms; however it is important to examine it. According to [42], one generation of NSGA-II has complexity O(M × N 2 ), which is governed by the non-dominated sorting part of the algorithm.…”
Section: Computational Complexitymentioning
confidence: 99%