Abbas, Iraq and Al-Salami, Qusay (2023) Inverted Generational Distance Bat Algorithm for Many-Objective Optimization Problems. In: 4th International Conference on Administrative & Financial Sciences, 3rd-4th/May/2023.
![[thumbnail of Research Article]](https://eprints.cihanuniversity.edu.iq/style/images/fileicons/text.png)
Artical_ISCAFS_01-07-2023.pdf - Published Version
Available under License Creative Commons Attribution Non-commercial No Derivatives.
Download (38kB)
Abstract
Evolutionary Algorithms (EAs) can be used to solve extremely large-scale Many-Objective Optimization Problems (MOPs/I). Multi-Objective BAT Algorithm based on Inverted Generational Distance MOBAT / IGD, a dominance-decomposition bat algorithm, solves this problem. Due to the Tchebycheff Strategy leader selection process, addressing the issues concurrently inside the BAT foundation may result in rapid convergence. In this paper decomposing the MOP as a Tchebycheff Approach set simplifies it. Dominance allows leaders to scan less densely populated areas, avoiding local optima and producing a more diverse estimated Pareto front as well creating the executives archive. MOBAT/IGD was evaluated to various decomposition-based development methods utilizing 35 standard MOPs. MATLAB produced all results (R2017b).
Item Type: | Conference or Workshop Item (Paper) |
---|---|
Uncontrolled Keywords: | Bat Algorithm; Inverted Generational Distance; Many-Objective Optimization Problems. |
Subjects: | H Social Sciences > HJ Public Finance H Social Sciences > HN Social history and conditions. Social problems. Social reform |
Divisions: | Department of Business Administration > Research papers |
Depositing User: | ePrints Editor |
Date Deposited: | 31 Oct 2024 00:36 |
Last Modified: | 31 Oct 2024 00:36 |
URI: | https://eprints.cihanuniversity.edu.iq/id/eprint/2520 |