Dynamic Switched Crowding and New Multiobjective DSC-MOAGDE

Unified Space Approach-based Dynamic Switched Crowding (DSC): A New Method for Designing Pareto-based Multi/Many-Objective Algorithms

DSC (Dynamic Switched Crowding)- is based on a new theory developed for the design of multi-objective optimization algorithms. DSC-MOAGDE is the first algorithm designed based on this theory. Three powerful versions of DSC-MOAGDE have been designed specifically for Real World Engineering Optimization Problems. DSC-MOAGDE can effectively find the Pareto-optimal solution set for Real World Engineering Design Problems where objective functions are in conflict.

------------------------------------------------------------------------------------------------------------------------------------------

The first implementation of DSC-based archive handling method is the DSC-MOAGDE

1) DSC-MOAGDE :

Unified space approach-based Dynamic Switched Crowding (DSC): A new method for designing Pareto-based multi/many-objective algorithms

https://www.sciencedirect.com/science/article/pii/S2210650222001626

------------------------------------------------------------------------------------------------------------------------------------------

The second implementation of DSC-based archive handling method is the DSC-MOSOS

2) DSC-MOSOS:

Combined heat and power economic emission dispatch using dynamic switched crowding based multi-objective symbiotic organism search algorithm

https://www.sciencedirect.com/science/article/pii/S1568494623011249?via%3Dihub

https://www.mathworks.com/matlabcentral/fileexchange/155697-dsc-mosos/?s_tid=LandingPageTabfx

------------------------------------------------------------------------------------------------------------------------------------------

Dear researchers, please check this link to learn milestone methods for the design of meta-heuristic optimization algorithms and to review competitive and state-of-the-art optimization algorithms.

https://se.mathworks.com/matlabcentral/fileexchange/119793-competitive-meta-heuristics-and-benchmark-problems-suite