
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.
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 1 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
