This paper proposes a quantum-inspired evolutionary algorithm (QiEA) to solve an optimal service-matching task-assignment problem.Our proposed algorithm comes with the advantage of generating always feasible population individuals and, thus, eliminating the necessity for a repair step.That is, with respect to other quantum-inspired evolutionary algorithms, our proposed QiEA algorithm presents a new way of collapsing the Memory Card quantum state that integrates the problem constraints in order to avoid later adjusting operations of the system to make it feasible.This results in lower computations and also faster convergence.
We compare our proposed QiEA algorithm with three commonly used benchmark methods: the greedy algorithm, Hungarian Humidifiers And Vaporizers method and Simplex, in five different case studies.The results show that the quantum approach presents better scalability and interesting properties that can be used in a wider class of assignment problems where the matching is not perfect.