Quantum-Inspired Evolutionary Algorithm for Optimal Service-Matching Task Assignment
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, wit...
Main Authors: | Joan Vendrell, Solmaz Kia |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2022-09-01
|
Series: | Information |
Subjects: | |
Online Access: | https://www.mdpi.com/2078-2489/13/9/438 |
Similar Items
-
Multiple Hungarian Method for <i>k</i>-Assignment Problem
by: Boštjan Gabrovšek, et al.
Published: (2020-11-01) -
Quantum-inspired optimization for wavelength assignment
by: Aleksey S. Boev, et al.
Published: (2023-01-01) -
Quantum-Inspired Evolutionary Approach for the Quadratic Assignment Problem
by: Wojciech Chmiel, et al.
Published: (2018-10-01) -
Quantum-Inspired Distributed Memetic Algorithm
by: Guanghui Zhang, et al.
Published: (2022-12-01) -
Multi-round Cross Online Matching in Spatial-temporal Crowdsourcing
by: Qianqian JIN, et al.
Published: (2024-01-01)