Autor: |
Nassime Aslimani, Talbi El-ghazali, Rachid Ellaia |
Jazyk: |
angličtina |
Rok vydání: |
2020 |
Předmět: |
|
Zdroj: |
Algorithms, Vol 13, Iss 9, p 204 (2020) |
Druh dokumentu: |
article |
ISSN: |
1999-4893 |
DOI: |
10.3390/a13090204 |
Popis: |
Multi-objective optimization problems (MOPs) have been widely studied during the last decades. In this paper, we present a new approach based on Chaotic search to solve MOPs. Various Tchebychev scalarization strategies have been investigated. Moreover, a comparison with state of the art algorithms on different well known bound constrained benchmarks shows the efficiency and the effectiveness of the proposed Chaotic search approach. |
Databáze: |
Directory of Open Access Journals |
Externí odkaz: |
|
Nepřihlášeným uživatelům se plný text nezobrazuje |
K zobrazení výsledku je třeba se přihlásit.
|