LAUSR

Multi-objective optimization is important for many businesses, science, and engineering applications. Existing evolutionary algorithms for multi-objective optimization problems based on single chain encoding still have difficulties in obtaining high-quality results. This paper presents a new DNA genetic algorithm that uses a novel double-strand DNA encoding, a set of new genetic operators, and two new ranking criteria to obtain solutions that closely approximate the Pareto-optimal front. The extensive experiments were performed using a set of comprehensive benchmark bi-objective and tri-objective test problems. The experimental results show that this algorithm outperforms a set of the state-of-the-art evolutionary algorithms on several well-accepted performance metrics.