A New Chaotic-Based Approach for Multi-Objective Optimization

Abstract

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.

Keywords

• multi-objective optimization
• large-scale optimization
• Chaotic search
• Tchebychev scalarization