Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Aslimani et al. (2020) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: