Hybedrized NSGA-II and MOEA/D with Harmony Search Algorithm to Solve Multi-objective Optimization Problems

• Published in: Neural Information Processing Vol. 9489; pp. 606 - 614
• Main Authors: Doush, Iyad Abu, Bataineh, Mohammad Qasem
• Format: Book Chapter
• Language: English
• Published: Switzerland Springer International Publishing AG 01.01.2015; Springer International Publishing
• Series: Lecture Notes in Computer Science
• Subjects: Harmony search algorithm; Multi-objective optimization evolutionary algorithms; Multi-objective optimization problems; Pattern recognition
• ISBN: 3319265318; 9783319265315
• ISSN: 0302-9743; 1611-3349
• DOI: 10.1007/978-3-319-26532-2_67

A multi-objective optimization problem is an area concerned an optimization problem involving more than one objective function to be optimized simultaneously. Several techniques have been proposed to solve Multi-Objective Optimization Problems. The two most famous algorithms are: NSGA-II and MOEA/D. Harmony Search is relatively a new heuristic evolutionary algorithm that has successfully proven to solve single objective optimization problems. In this paper, we hybridized two well-known multi-objective optimization evolutionary algorithms: NSGA-II and MOEA/D with Harmony Search. We studied the efficiency of the proposed novel algorithms to solve multi-objective optimization problems. To evaluate our work, we used well-known datasets: ZDT, DTLZ and CEC2009. We evaluate the algorithm performance using Inverted Generational Distance (IGD). The results showed that the proposed algorithms outperform in solving problems with multiple local fronts in terms of IGD as compared to the original ones (i.e., NSGA-II and MOEA/D).