Two-Dimensional Quantum Genetic Algorithm: Application to Task Allocation Problem

Abstract

This paper presents a Two-Dimensional Quantum Genetic Algorithm (2D-QGA), which is a new variety of QGA. This variety will allow the user to take the advantages of quantum computation while solving the problems which are suitable for two-dimensional (2D) representation or can be represented in tabular form. The performance of 2D-QGA is compared to two-dimensional GA (2D-GA), which is used to solve two-dimensional problems as well. The comparison study is performed by applying both the algorithm to the task allocation problem. The performance of 2D-QGA is better than 2D-GA while comparing execution time, convergence iteration, minimum cost generated, and population size.

Integrating Environmental and Economic Considerations in Charging Station Planning: An Improved Quantum Genetic Algorithm

“…QGA uses a completely new encoding scheme and population updating mechanism, applying the probability amplitude of quantum bits to chromosome encoding. This allows a single chromosome to express the superposition of multiple states, greatly enhancing the algorithm's searching ability [32][33][34].…”

Optimization of a Rural Portfolio Credit Granting System Using Improved Two-Dimensional Strip Packing Grouping Delay Problem

“…Li et al [15] proposed the hybrid adaptive genetic algorithm (HAGA) for solving the NP-hard two-dimensional rectangular packing problem to maximize the filling rate of a rectangular sheet. Mondal and Tsourdos [16] presented a two-dimensional quantum genetic algorithm (2D-QGA), which is a new variety of QGA. Recently, reinforcement learning has been added to the two-dimensional packing problem.…”