{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T03:16:51Z","timestamp":1761621411008,"version":"build-2065373602"},"reference-count":58,"publisher":"MDPI AG","issue":"10","license":[{"start":{"date-parts":[[2018,10,12]],"date-time":"2018-10-12T00:00:00Z","timestamp":1539302400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>The paper focuses on the opportunity of the application of the quantum-inspired evolutionary algorithm for determining minimal costs of the assignment in the quadratic assignment problem. The idea behind the paper is to present how the algorithm has to be adapted to this problem, including crossover and mutation operators and introducing quantum principles in particular procedures. The results have shown that the performance of our approach in terms of converging to the best solutions is satisfactory. Moreover, we have presented the results of the selected parameters of the approach on the quality of the obtained solutions.<\/jats:p>","DOI":"10.3390\/e20100781","type":"journal-article","created":{"date-parts":[[2018,10,12]],"date-time":"2018-10-12T10:54:03Z","timestamp":1539341643000},"page":"781","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":20,"title":["Quantum-Inspired Evolutionary Approach for the Quadratic Assignment Problem"],"prefix":"10.3390","volume":"20","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4773-9123","authenticated-orcid":false,"given":"Wojciech","family":"Chmiel","sequence":"first","affiliation":[{"name":"Faculty of Electrical Engineering, Automatics, Computer Science and Biomedical Engineering, AGH University of Science and Technology, al. Mickiewicza 30, 30-059 Krak\u00f3w, Poland"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8225-7605","authenticated-orcid":false,"given":"Joanna","family":"Kwiecie\u0144","sequence":"additional","affiliation":[{"name":"Faculty of Electrical Engineering, Automatics, Computer Science and Biomedical Engineering, AGH University of Science and Technology, al. Mickiewicza 30, 30-059 Krak\u00f3w, Poland"}]}],"member":"1968","published-online":{"date-parts":[[2018,10,12]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Burkard, R., Dell\u2019Amico, M., and Martello, S. (2009). Assignment Problems, SIAM Society for Industrial and Applied Mathematics.","DOI":"10.1137\/1.9780898717754"},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1145\/321958.321975","article-title":"P-complete approximation problems","volume":"23","author":"Sahni","year":"1976","journal-title":"J. ACM"},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Laporte, G., Nickel, S., and Saldanha da Gama, F. (2015). The quadratic assignment problem. Location Science, Springer International Publishing.","DOI":"10.1007\/978-3-319-13111-5"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1016\/j.ejor.2005.09.032","article-title":"A survey for the quadratic assignment problem","volume":"176","author":"Loiola","year":"2007","journal-title":"Eur. J. Oper. Res."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/s10589-005-4562-x","article-title":"A tabu search algorithm for the quadratic assignment problem","volume":"30","author":"Misevicius","year":"2005","journal-title":"Comput. Optim. Appl."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0898-1221(94)00147-2","article-title":"Simulated annealing and tabu search in the long run: A comparison on {QAP} tasks","volume":"28","author":"Battiti","year":"1994","journal-title":"Comput. Math. Appl."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1016\/S0377-2217(03)00438-7","article-title":"The extended concentric tabu for the quadratic assignment problem","volume":"160","author":"Drezner","year":"2005","journal-title":"Eur. J. Oper. Res."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1080\/07408178708975376","article-title":"Solving quadratic assignment problems by \u2018Simulated Annealing\u2019","volume":"19","author":"Wilhelm","year":"1987","journal-title":"IIE Trans."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"497","DOI":"10.15388\/Informatica.2003.037","article-title":"A modified simulated annealing algorithm for the quadratic assignment problem","volume":"14","year":"2003","journal-title":"Informatica"},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1162\/106454699568728","article-title":"Ant algorithms for discrete optimization","volume":"5","author":"Dorigo","year":"1999","journal-title":"Artif. Life"},{"key":"ref_11","unstructured":"Lv, C., Zhao, H., and Yang, X. (2011, January 24\u201326). Particle swarm optimization algorithm for quadratic assignment problem. Proceedings of the 2011 International Conference on Computer Science and Network Technology (ICCSNT), Harbin, China."},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Saad, A., Dahal, K., Sarfraz, M., and Roy, R. (2007). A particle swarm approach to quadratic assignment problems. Soft Computing in Industrial Applications, Springer.","DOI":"10.1007\/978-3-540-70706-6"},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"615","DOI":"10.1007\/978-3-319-23437-3_53","article-title":"Bees algorithm for the quadratic assignment problem on CUDA platform","volume":"Volume 391","author":"Chmiel","year":"2016","journal-title":"Man\u2013Machine Interactions 4"},{"key":"ref_14","first-page":"513","article-title":"A comparison of nature inspired algorithms for the quadratic assignment problem","volume":"65","author":"Chmiel","year":"2017","journal-title":"Bull. Pol. Acad. Sci.-Tech."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0305-0548(93)E0020-T","article-title":"A genetic approach to the quadratic assignment problem","volume":"22","author":"Tate","year":"1995","journal-title":"Comput. Oper. Res."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1287\/ijoc.15.3.320.16076","article-title":"A new genetic algorithm for the quadratic assignment problem","volume":"15","author":"Drezner","year":"2003","journal-title":"INFORMS J. Comput."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1016\/j.orl.2004.11.001","article-title":"Compounded genetic algorithms for the quadratic assignment problem","volume":"33","author":"Drezner","year":"2005","journal-title":"Oper. Res. Lett."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"717","DOI":"10.1016\/j.cor.2006.05.004","article-title":"Extensive experiments with hybrid genetic algorithms for the solution of the quadratic assignment problem","volume":"35","author":"Drezner","year":"2008","journal-title":"Comput. Oper. Res."},{"key":"ref_19","first-page":"109","article-title":"A quantum-inspired evolutionary algorithm for multiobjective image segmentation","volume":"1","author":"Talbi","year":"2007","journal-title":"Int. J. Math. Phys. Eng. Sci."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"81","DOI":"10.3328\/TL.2009.01.01.81-93","article-title":"A quantum-inspired genetic algorithm for dynamic continuous network design problem","volume":"1","author":"Lin","year":"2009","journal-title":"Transp. Lett."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"1086","DOI":"10.1016\/j.comcom.2008.12.036","article-title":"An adaptive-evolution-based quantum-inspired evolutionary algorithm for QoS multicasting in IP\/DWDM networks","volume":"32","author":"Xing","year":"2009","journal-title":"Comput. Commun."},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Huang, D.S., Zhang, X.P., and Huang, G.B. (2005). A hybrid quantum-inspired genetic algorithm for flow shop scheduling. Advances in Intelligent Computing, Springer.","DOI":"10.1007\/11538356_66"},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"Li, B.B., and Wang, L. (2006). A hybrid quantum-inspired genetic algorithm for multi-objective scheduling. ICIC Intelligent Computing, Springer.","DOI":"10.1007\/11816157_64"},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"927","DOI":"10.1016\/j.cor.2009.07.002","article-title":"A novel competitive co-evolutionary quantum genetic algorithm for stochastic job shop scheduling problem","volume":"37","author":"Gu","year":"2010","journal-title":"Comput. Oper. Res."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"1441","DOI":"10.1007\/s10845-015-1060-6","article-title":"An elitist quantum-inspired evolutionary algorithm for the flexible job-shop scheduling problem","volume":"28","author":"Wu","year":"2017","journal-title":"J. Intell. Manuf."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"1627","DOI":"10.1109\/TPWRS.2008.2004743","article-title":"Quantum-inspired evolutionary algorithm for real and reactive power dispatch","volume":"23","author":"Vlachogiannis","year":"2008","journal-title":"IEEE Trans. Power Syst."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"1279","DOI":"10.1016\/j.eswa.2009.06.013","article-title":"An effective hybrid quantum-inspired evolutionary algorithm for parameter estimation of chaotic systems","volume":"37","author":"Wang","year":"2010","journal-title":"Expert Syst. Appl."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1016\/j.pnsc.2007.11.012","article-title":"Quantum-inspired evolutionary tuning of SVM parameters","volume":"18","author":"Luo","year":"2008","journal-title":"Prog. Nat. Sci."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1016\/j.asoc.2017.07.035","article-title":"Parallel quantum-inspired evolutionary algorithms for community detection in social networks","volume":"61","author":"Gupta","year":"2017","journal-title":"Appl. Soft Comput."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"255","DOI":"10.15388\/Informatica.2009.249","article-title":"Testing of hybrid genetic algorithms for structured quadratic assignment problems","volume":"20","author":"Rubliauskas","year":"2009","journal-title":"Informatica"},{"key":"ref_31","doi-asserted-by":"crossref","unstructured":"Skersys, T., Butleris, R., and Butkiene, R. (2012). Computational study of four genetic algorithm variants for solving the quadratic assignment problem. Information and Software Technologies, Springer.","DOI":"10.1007\/978-3-642-33308-8"},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"584","DOI":"10.1016\/j.eswa.2014.08.011","article-title":"Memetic search for the quadratic assignment problem","volume":"42","author":"Benlic","year":"2015","journal-title":"Expert Syst. Appl."},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1016\/j.ipl.2016.03.002","article-title":"A hybrid biased random key genetic algorithm for the quadratic assignment problem","volume":"116","year":"2016","journal-title":"Inf. Process. Lett."},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1016\/j.swevo.2018.02.005","article-title":"Multi-objective Gene-pool optimal mixing evolutionary algorithm with the interleaved multi-start scheme","volume":"40","author":"Luong","year":"2018","journal-title":"Swarm Evol. Comput."},{"key":"ref_35","first-page":"157","article-title":"A sule\u2019s method initiated genetic algorithm for solving QAP formulation in facility layout design: A real world application","volume":"84","author":"Atencio","year":"2016","journal-title":"J. Theor. Appl. Inf. Technol."},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"917","DOI":"10.1016\/S0305-0548(99)00067-2","article-title":"A greedy genetic algorithm for the quadratic assignment problem","volume":"27","author":"Ahuja","year":"2000","journal-title":"Comput. Oper. Res."},{"key":"ref_37","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/j.procs.2014.05.394","article-title":"A new recombination operator for the genetic algorithm solution of the quadratic assignment problem","volume":"32","author":"Tosun","year":"2014","journal-title":"Procedia Comput. Sci."},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/j.swevo.2015.03.002","article-title":"Chaos driven discrete artificial bee algorithm for location and assignment optimisation problems","volume":"25","author":"Metlicka","year":"2015","journal-title":"Swarm Evol. Comput."},{"key":"ref_39","doi-asserted-by":"crossref","first-page":"9252","DOI":"10.1016\/j.eswa.2015.07.070","article-title":"A multi-agent based optimization method applied to the quadratic assignment problem","volume":"42","author":"Sghir","year":"2015","journal-title":"Expert Syst. Appl."},{"key":"ref_40","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/j.ins.2012.06.032","article-title":"Migrating birds optimization: A new metaheuristic approach and its performance on quadratic assignment problem","volume":"217","author":"Duman","year":"2012","journal-title":"Inf. Sci."},{"key":"ref_41","doi-asserted-by":"crossref","unstructured":"Oliveira, S., Hussin, M.S., Roli, A., Dorigo, M., and St\u00fctzle, T. (2017, January 5\u20138). Analysis of the population-based ant colony optimization algorithm for the TSP and the QAP. Proceedings of the 2017 IEEE Congress on Evolutionary Computation (CEC), San Sebastian, Spain.","DOI":"10.1109\/CEC.2017.7969511"},{"key":"ref_42","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1016\/j.eswa.2015.09.032","article-title":"Particle swarm algorithm variants for the quadratic assignment problems\u2014A probabilistic learning approach","volume":"44","author":"Hafiz","year":"2016","journal-title":"Expert Syst. Appl."},{"key":"ref_43","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1016\/j.engappai.2016.02.004","article-title":"A novel multistart hyper-heuristic algorithm on the grid for the quadratic assignment problem","volume":"52","author":"Dokeroglu","year":"2016","journal-title":"Eng. Appl. Artif. Intell."},{"key":"ref_44","doi-asserted-by":"crossref","unstructured":"Tasgetiren, M.F., Pan, Q.K., Ozturkoglu, Y., and Cotur, O.K. (2017, January 5\u20138). Variable block insertion heuristic for the quadratic assignment problem. Proceedings of the 2017 IEEE Congress on Evolutionary Computation (CEC), San Sebastian, Spain.","DOI":"10.1109\/CEC.2017.7969515"},{"key":"ref_45","doi-asserted-by":"crossref","unstructured":"Yuan, Y., Ong, Y.S., Gupta, A., Tan, P.S., and Xu, H. (2016, January 22\u201325). Evolutionary multitasking in permutation-based combinatorial optimization problems: Realization with TSP, QAP, LOP, and JSP. Proceedings of the 2016 IEEE Region 10 Conference (TENCON), Singapore.","DOI":"10.1109\/TENCON.2016.7848632"},{"key":"ref_46","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/j.cie.2016.11.023","article-title":"A stagnation-aware cooperative parallel breakout local search algorithm for the quadratic assignment problem","volume":"103","author":"Aksan","year":"2017","journal-title":"Comput. Ind. Eng."},{"key":"ref_47","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/j.asoc.2015.06.061","article-title":"A great deluge and tabu search hybrid with two-stage memory support for quadratic assignment problem","volume":"36","author":"Acan","year":"2015","journal-title":"Appl. Soft Comput."},{"key":"ref_48","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"},{"key":"ref_49","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1057\/jors.1977.29","article-title":"Hospital layout as a quadratic assignment problem","volume":"28","author":"Elshafei","year":"1977","journal-title":"J. Oper. Res. Soc."},{"key":"ref_50","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/0041-1647(72)90111-6","article-title":"Campus building arrangement using topaz","volume":"6","author":"Dickey","year":"1972","journal-title":"Transp. Res."},{"key":"ref_51","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/j.cor.2005.05.004","article-title":"The quadratic assignment problem in the context of the printed circuit board assembly process","volume":"34","author":"Duman","year":"2007","journal-title":"Comput. Oper. Res."},{"key":"ref_52","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_53","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1049\/cce:19990303","article-title":"Quantum computing: An introduction","volume":"10","author":"Hey","year":"1999","journal-title":"Comput. Control Eng. J."},{"key":"ref_54","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/j.jmaa.2008.12.065","article-title":"A novel parallel quantum genetic algorithm for stochastic job shop scheduling","volume":"355","author":"Gu","year":"2009","journal-title":"J. Math. Anal. Appl."},{"key":"ref_55","doi-asserted-by":"crossref","unstructured":"Lahoz-Beltra, R. (2016). Quantum genetic algorithms for computer scientists. Computers, 5.","DOI":"10.3390\/computers5040024"},{"key":"ref_56","first-page":"109","article-title":"Comparison of crossover operators for the quadratic assignment problem","volume":"34","author":"Kilda","year":"2005","journal-title":"Inf. Technol. Control"},{"key":"ref_57","first-page":"117","article-title":"Performance of swarm algorithms for permutation problems","volume":"15","author":"Chmiel","year":"2009","journal-title":"Automatyka"},{"key":"ref_58","unstructured":"Chmiel, W., and Kadluczka, P. (2008, January 24\u201327). A multi-phase diversification method of population in the evolutionary algorithm. Proceedings of the XVI National Conference on Discrete Process Automation, Zakopane, Poland."}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/20\/10\/781\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T15:25:12Z","timestamp":1760196312000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/20\/10\/781"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,10,12]]},"references-count":58,"journal-issue":{"issue":"10","published-online":{"date-parts":[[2018,10]]}},"alternative-id":["e20100781"],"URL":"https:\/\/doi.org\/10.3390\/e20100781","relation":{},"ISSN":["1099-4300"],"issn-type":[{"type":"electronic","value":"1099-4300"}],"subject":[],"published":{"date-parts":[[2018,10,12]]}}}