{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T15:24:06Z","timestamp":1775489046271,"version":"3.50.1"},"reference-count":22,"publisher":"MDPI AG","issue":"9","license":[{"start":{"date-parts":[[2022,9,17]],"date-time":"2022-09-17T00:00:00Z","timestamp":1663372800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Balsells Fellowship"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information"],"abstract":"<jats:p>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 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 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.<\/jats:p>","DOI":"10.3390\/info13090438","type":"journal-article","created":{"date-parts":[[2022,9,18]],"date-time":"2022-09-18T23:39:22Z","timestamp":1663544362000},"page":"438","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Quantum-Inspired Evolutionary Algorithm for Optimal Service-Matching Task Assignment"],"prefix":"10.3390","volume":"13","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3645-8692","authenticated-orcid":false,"given":"Joan","family":"Vendrell","sequence":"first","affiliation":[{"name":"Department of Mechanical and Aerospace Engineering, University of California Irvine, Irvine, CA 92697, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Solmaz","family":"Kia","sequence":"additional","affiliation":[{"name":"Department of Mechanical and Aerospace Engineering, University of California Irvine, Irvine, CA 92697, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2022,9,17]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"4400","DOI":"10.1109\/LRA.2022.3148472","article-title":"A distributed service-matching coverage via heterogeneous agents","volume":"7","author":"Chung","year":"2022","journal-title":"IEEE Robot. Autom. Lett."},{"key":"ref_2","unstructured":"MacKay, D. (2003). Information Theory, Inference and Learning Algorithms, Cambridge University Press."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"909","DOI":"10.1287\/mnsc.32.8.909","article-title":"A Survey of exact algorithms for the simple assembly line balancing problem","volume":"32","author":"Baybars","year":"1986","journal-title":"Manag. Sci."},{"key":"ref_4","first-page":"1665","article-title":"Literature review of assembly line balancing problems","volume":"73","author":"Sivasankaran","year":"2014","journal-title":"Int. J. Adv. Technol."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1016\/j.trc.2019.01.019","article-title":"Real-time city-scale ridesharing via linear assignment problems","volume":"101","author":"Simonetto","year":"2019","journal-title":"Transp. Res. Part C Emerg. Technol."},{"key":"ref_6","first-page":"439","article-title":"The Assignment Problem","volume":"Volume 1","author":"Berninghaus","year":"2001","journal-title":"Beitr\u00e4ge zur mikro- und zur makro\u00f6konomik"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/S0167-6377(03)00062-2","article-title":"A note on maximizing a submodular set function subject to a knapsack constraint","volume":"32","author":"Sviridenko","year":"2004","journal-title":"Oper. Res. Lett."},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Williamson, D.P., and Shmoys, D.B. (2011). The Design of Approximation Algorithms, Cambridge University Press.","DOI":"10.1017\/CBO9780511921735"},{"key":"ref_9","unstructured":"Woit, P. (2022). Introduction. Quantum Theory, Groups and Representations: An Introduction, Department of Mathematics, Columbia University."},{"key":"ref_10","unstructured":"Soloviev, V.P., Bielza, C., and Larranaga, P. (July, January 28). Quantum-inspired estimation Of distribution algorithm to solve the travelling salesman problem. Proceedings of the IEEE Congress on Evolutionary Computation, Krak\u00f3w, Poland."},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Khoshnoud, F., de Silva, C.W., and Ibrahim, I. (2017, January 5\u20138). Quantum entanglement of autonomous vehicles for cyber-physical security. Proceedings of the IEEE International Conference on Systems, Man, and Cybernetics, Banff, AB, Canada.","DOI":"10.1109\/SMC.2017.8123026"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"4966","DOI":"10.1016\/j.eswa.2009.12.017","article-title":"A quantum-inspired genetic algorithm for k-means clustering","volume":"37","author":"Xiao","year":"2010","journal-title":"Expert Syst. Appl."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"1994","DOI":"10.1109\/LWC.2021.3089876","article-title":"Intelligent trajectory planning in UAV-mounted wireless networks: A quantum-inspired reinforcement learning perspective","volume":"10","author":"Li","year":"2021","journal-title":"IEEE Wirel. Commun. Lett."},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Chen, C., Yang, P., Zhou, X., and Dong, D. (2008, January 6\u20138). A Quantum-inspired Q-learning algorithm for indoor robot navigation. Proceedings of the IEEE International Conference on Networking, Sensing and Control, Sanya, China.","DOI":"10.1109\/ICNSC.2008.4525476"},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Rajesh, V., Parameshwar, U., and Mohana, N. (2021, January 27\u201328). Quantum Convolutional neural networks (QCNN) using deep learning for computer vision applications. Proceedings of the International Conference on Recent Trends on Electronics, Information, Communication and Technology, Bangalore, India.","DOI":"10.1109\/RTEICT52294.2021.9574030"},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"580","DOI":"10.1109\/TEVC.2002.804320","article-title":"Quantum-inspired evolutionary algorithm for a class of combinatorial optimization","volume":"6","author":"Han","year":"2002","journal-title":"IEEE Trans. Evol. Comput."},{"key":"ref_17","unstructured":"Combarro, E.F. (2020). A Practical Introduction to Quantum Computing: From Qubits to Quantum Machine Learning and Beyond, CERN OpenLab."},{"key":"ref_18","unstructured":"Messiah, A. (1999). Quantum Mechanics, Dover Publications Inc."},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Hershey, J.R., and Olsen, P.A. (2007, January 15\u201320). Approximating the Kullback Leibler divergence between Gaussian mixture models. Proceedings of the IEEE International Conference on Acoustics, Speech and Signal Processing, Honolulu, HI, USA.","DOI":"10.1109\/ICASSP.2007.366913"},{"key":"ref_20","unstructured":"Streichert, F. (2018). Introduction to Evolutionary Algorithms. Evolutionary Computation 1, University of T\u00fcbingen."},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"Chmiel, W., and Kwiecie\u0144, J. (2022). Quantum-inspired evolutionary approach for the quadratic assignment problem. Entorpy, 20.","DOI":"10.3390\/e20100781"},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/s10732-010-9136-0","article-title":"Quantum-inspired evolutionary algorithms: A survey and empirical study","volume":"17","author":"Zhang","year":"2011","journal-title":"J. Heuristics"}],"container-title":["Information"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2078-2489\/13\/9\/438\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T00:33:22Z","timestamp":1760142802000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2078-2489\/13\/9\/438"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,17]]},"references-count":22,"journal-issue":{"issue":"9","published-online":{"date-parts":[[2022,9]]}},"alternative-id":["info13090438"],"URL":"https:\/\/doi.org\/10.3390\/info13090438","relation":{},"ISSN":["2078-2489"],"issn-type":[{"value":"2078-2489","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,9,17]]}}}