article
This paper provides an overview of the current state of research on multi-objective problems and compares two multi-objective metaheuristic methods: Multi-Objective Artificial Bee Colony (MOABC) and Non-Dominant Sorting Genetic Algorithm II (NSGA-II). The study evaluates the performance of these methods using three multi-objective test functions and three metrics: Generational Distance (GD), Spacing (SP), and Computational Time (CT). The results show that MOABC is the most suitable algorithm for multi-objective problems in terms of convergence and robustness, as indicated by the evaluation metrics.
This page summarises published work. The authoritative version sits with the publisher.
DOI: 10.1109/iraset57153.2023.10153049
Is something wrong with this record? Report it or request removal.
Discussion
Have you built on this work, tried to replicate it, or seen it applied in practice? Share what you know. Verified researchers and MARATTO™ domain experts can open a discussion, and any member can reply. Contributions are reviewed before they appear.
No discussion yet. Open the first thread.
New to MARATTO™? Create a free account.
