Back to Search
Start Over
Extension of the Directed Search Domain algorithm for multi-objective optimization to higher dimensions.
- Source :
-
Annals of Operations Research . Sep2024, Vol. 340 Issue 2/3, p1125-1160. 36p. - Publication Year :
- 2024
-
Abstract
- This paper addresses the problem of generating an evenly distributed set of Pareto solutions. It appears in real-life applications related to multi-objective optimization when it is important to represent the entire Pareto front with a minimal cost. There exist only a few algorithms which are able to tackle this problem in a general formulation. The Directed Search Domain (DSD) algorithm has proved to be efficient and quite universal. It has successfully been applied to different challengeable test cases. In this paper for the first time the DSD approach is systematically extended and applied to problems with higher dimensions. The modified algorithm does not have any formal limitation on the number of objective functions that is important for practical applications. The efficacy of the algorithm is demonstrated on a number of test cases. [ABSTRACT FROM AUTHOR]
- Subjects :
- *SEARCH algorithms
*ALGORITHMS
Subjects
Details
- Language :
- English
- ISSN :
- 02545330
- Volume :
- 340
- Issue :
- 2/3
- Database :
- Academic Search Index
- Journal :
- Annals of Operations Research
- Publication Type :
- Academic Journal
- Accession number :
- 179325799
- Full Text :
- https://doi.org/10.1007/s10479-024-06117-y