Abstract

Multiobjective Optimization Problems (MOP) can be found in many issues of scientific research, engineering, and in everyday social life. A MOP problem has several objectives that conflict with one another which must be optimized simultaneously. This paper presents a quantum-inspired evolutionary algorithm (QEA) to solve continuous multiobjective optimization problem (MOP). The proposed method employs Fast Nondominated Sorting and Crowding Distance from NSGA-II and implements all common operators of genetic algorithms (GA), such as crossover and mutations with additional Quantum Gate quantum operators. The proposed method is then run in a distributed manner and is proven to be able to significantly outperform the hypervolume and MOEA/D metrics and have hypervolumes that are comparable to NSGA-II while maintaining a better average Δ’ in all testing problems. From this result, it is concluded that using quantum-inspired individual genetic algorithms to solve continuous MOP can produce hypervolume and Δ’ metrics that are good in all specified test problems.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call