{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,28]],"date-time":"2026-07-28T20:46:02Z","timestamp":1785271562248,"version":"3.55.0"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"18","license":[{"start":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T00:00:00Z","timestamp":1743120000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T00:00:00Z","timestamp":1743120000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100007251","name":"National Research University Higher School of Economics","doi-asserted-by":"publisher","award":["Basic Research Program"],"award-info":[{"award-number":["Basic Research Program"]}],"id":[{"id":"10.13039\/501100007251","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Comput & Applic"],"published-print":{"date-parts":[[2025,6]]},"DOI":"10.1007\/s00521-025-11155-z","type":"journal-article","created":{"date-parts":[[2025,3,31]],"date-time":"2025-03-31T08:36:23Z","timestamp":1743410183000},"page":"12253-12279","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["A genetic engineering algorithm for the generalized quadratic assignment problem"],"prefix":"10.1007","volume":"37","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3695-604X","authenticated-orcid":false,"given":"Majid","family":"Sohrabi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5939-9795","authenticated-orcid":false,"given":"Amir M.","family":"Fathollahi-Fard","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5891-6597","authenticated-orcid":false,"given":"Vasilii A.","family":"Gromov","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8456-9736","authenticated-orcid":false,"given":"Maxim A.","family":"Dulebenets","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,3,28]]},"reference":[{"key":"11155_CR1","unstructured":"Lee, C. G., and Ma, Z. (2004). The generalized quadratic assignment problem. Research Rep., Dept., Mechanical Industrial Eng., Univ. Toronto, Canada, M5S."},{"key":"11155_CR2","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2023.106802","volume":"126","author":"AM Fathollahi-Fard","year":"2023","unstructured":"Fathollahi-Fard AM, Wong KY, Aljuaid M (2023) An efficient adaptive large neighborhood search algorithm based on heuristics and reformulations for the generalized quadratic assignment problem. Eng Appl Artif Intell 126:106802","journal-title":"Eng Appl Artif Intell"},{"key":"11155_CR3","unstructured":"Martello, S., and Toth, P. (1990). Knapsack problems: algorithms and computer implementations. John Wiley and Sons, Inc."},{"key":"11155_CR4","doi-asserted-by":"crossref","unstructured":"Hochbaum, D. S. (2005). Complexity and algorithms for convex network optimization and other nonlinear problems. 4OR, 3(3), 171\u2013216.","DOI":"10.1007\/s10288-005-0078-6"},{"issue":"1","key":"11155_CR5","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1109\/4235.585893","volume":"1","author":"DH Wolpert","year":"1997","unstructured":"Wolpert DH, Macready WG (1997) No free lunch theorems for optimization. IEEE Trans Evol Comput 1(1):67\u201382","journal-title":"IEEE Trans Evol Comput"},{"issue":"3","key":"11155_CR6","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1016\/0377-2217(92)90077-M","volume":"60","author":"DG Cattrysse","year":"1992","unstructured":"Cattrysse DG, Van Wassenhove LN (1992) A survey of algorithms for the generalized assignment problem. Eur J Oper Res 60(3):260\u2013272","journal-title":"Eur J Oper Res"},{"issue":"1","key":"11155_CR7","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1016\/0377-2217(93)E0174-V","volume":"82","author":"M Laguna","year":"1995","unstructured":"Laguna M, Kelly JP, Gonz\u00e1lez-Velarde J, Glover F (1995) Tabu search for the multilevel generalized assignment problem. Eur J Oper Res 82(1):176\u2013189","journal-title":"Eur J Oper Res"},{"issue":"1","key":"11155_CR8","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/S0377-2217(00)00108-9","volume":"132","author":"JA D\u0131az","year":"2001","unstructured":"D\u0131az JA, Fern\u00e1ndez E (2001) A tabu search heuristic for the generalized assignment problem. Eur J Oper Res 132(1):22\u201338","journal-title":"Eur J Oper Res"},{"issue":"2","key":"11155_CR9","doi-asserted-by":"publisher","first-page":"548","DOI":"10.1016\/j.ejor.2004.08.015","volume":"169","author":"M Yagiura","year":"2006","unstructured":"Yagiura M, Ibaraki T, Glover F (2006) A path relinking approach with ejection chains for the generalized assignment problem. Eur J Oper Res 169(2):548\u2013569","journal-title":"Eur J Oper Res"},{"key":"11155_CR10","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1007\/s10732-010-9144-0","volume":"17","author":"GR Mateus","year":"2011","unstructured":"Mateus GR, Resende MG, Silva RM (2011) GRASP with path-relinking for the generalized quadratic assignment problem. Journal of Heuristics 17:527\u2013565","journal-title":"Journal of Heuristics"},{"issue":"10","key":"11155_CR11","doi-asserted-by":"publisher","first-page":"3926","DOI":"10.1016\/j.apm.2009.01.014","volume":"33","author":"L Liu","year":"2009","unstructured":"Liu L, Gao X (2009) Fuzzy weighted equilibrium multi-job assignment problem and genetic algorithm. Appl Math Model 33(10):3926\u20133935","journal-title":"Appl Math Model"},{"issue":"1","key":"11155_CR12","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/s10107-010-0381-7","volume":"131","author":"A Billionnet","year":"2012","unstructured":"Billionnet A, Elloumi S, Lambert A (2012) Extending the QCR method to general mixed-integer programs. Math Program 131(1):381\u2013401","journal-title":"Math Program"},{"issue":"1","key":"11155_CR13","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/s10589-012-9474-y","volume":"54","author":"A Billionnet","year":"2013","unstructured":"Billionnet A, Elloumi S, Lambert A (2013) An efficient compact quadratic convex reformulation for general integer quadratic programs. Comput Optim Appl 54(1):141\u2013162","journal-title":"Comput Optim Appl"},{"issue":"2","key":"11155_CR14","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1016\/j.ejor.2013.08.015","volume":"235","author":"T Robenek","year":"2014","unstructured":"Robenek T, Umang N, Bierlaire M, Ropke S (2014) A branch-and-price algorithm to solve the integrated berth allocation and yard assignment problem in bulk ports. Eur J Oper Res 235(2):399\u2013411","journal-title":"Eur J Oper Res"},{"issue":"3","key":"11155_CR15","first-page":"221","volume":"34","author":"A McKendall","year":"2017","unstructured":"McKendall A, Li C (2017) A tabu search heuristic for a generalized quadratic assignment problem. J Ind Prod Eng 34(3):221\u2013231","journal-title":"J Ind Prod Eng"},{"key":"11155_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.swevo.2019.01.004","volume":"46","author":"W Chmiel","year":"2019","unstructured":"Chmiel W (2019) Evolutionary algorithm using conditional expectation value for quadratic assignment problem. Swarm Evol Comput 46:1\u201327","journal-title":"Swarm Evol Comput"},{"issue":"3","key":"11155_CR17","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1287\/ijoc.2018.0840","volume":"31","author":"D Bergman","year":"2019","unstructured":"Bergman D (2019) An exact algorithm for the quadratic multiknapsack problem with an application to event seating. INFORMS J Comput 31(3):477\u2013492","journal-title":"INFORMS J Comput"},{"issue":"1","key":"11155_CR18","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/s10479-018-3092-8","volume":"286","author":"M Guignard","year":"2020","unstructured":"Guignard M (2020) Strong RLT1 bounds from decomposable Lagrangean relaxation for some quadratic 0\u20131 optimization problems with linear constraints. Ann Oper Res 286(1):173\u2013200","journal-title":"Ann Oper Res"},{"key":"11155_CR19","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2020.104933","volume":"120","author":"C D\u2019Ambrosio","year":"2020","unstructured":"D\u2019Ambrosio C, Martello S, Monaci M (2020) Lower and upper bounds for the non-linear generalized assignment problem. Comput Oper Res 120:104933","journal-title":"Comput Oper Res"},{"issue":"3","key":"11155_CR20","doi-asserted-by":"publisher","first-page":"1066","DOI":"10.1016\/j.ejor.2020.11.035","volume":"292","author":"A Silva","year":"2021","unstructured":"Silva A, Coelho LC, Darvish M (2021) Quadratic assignment problem variants: A survey and an effective parallel memetic iterated tabu search. Eur J Oper Res 292(3):1066\u20131084","journal-title":"Eur J Oper Res"},{"issue":"3","key":"11155_CR21","doi-asserted-by":"publisher","first-page":"788","DOI":"10.1016\/j.ejor.2021.04.001","volume":"296","author":"Q Zhou","year":"2022","unstructured":"Zhou Q, Hao JK, Wu Q (2022) A hybrid evolutionary search for the generalized quadratic multiple knapsack problem. Eur J Oper Res 296(3):788\u2013803","journal-title":"Eur J Oper Res"},{"key":"11155_CR22","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2022.117644","volume":"205","author":"M Song","year":"2022","unstructured":"Song M, Cheng L (2022) Solving the reliability-oriented generalized assignment problem by Lagrangian relaxation and Alternating Direction Method of Multipliers. Expert Syst Appl 205:117644","journal-title":"Expert Syst Appl"},{"key":"11155_CR23","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1134\/S000511792403007X","volume":"85","author":"M Sohrabi","year":"2024","unstructured":"Sohrabi M, Fathollahi-Fard AM, Gromov VA (2024) Genetic Engineering Algorithm (GEA): An Efficient Metaheuristic Algorithm for Solving Combinatorial Optimization Problems. Autom Remote Control 85:252\u2013262. https:\/\/doi.org\/10.1134\/S000511792403007X","journal-title":"Autom Remote Control"},{"issue":"2","key":"11155_CR24","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1137\/0202009","volume":"2","author":"JH Holland","year":"1973","unstructured":"Holland JH (1973) Genetic algorithms and the optimal allocation of trials. SIAM J Comput 2(2):88\u2013105","journal-title":"SIAM J Comput"},{"issue":"6","key":"11155_CR25","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1109\/2.294849","volume":"27","author":"M Srinivas","year":"1994","unstructured":"Srinivas M, Patnaik LM (1994) Genetic algorithms: A survey. Computer 27(6):17\u201326","journal-title":"Computer"},{"issue":"1","key":"11155_CR26","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/0305-0548(93)E0024-N","volume":"22","author":"PW Poon","year":"1995","unstructured":"Poon PW, Carter JN (1995) Genetic algorithm crossover operators for ordering applications. Comput Oper Res 22(1):135\u2013147","journal-title":"Comput Oper Res"},{"key":"11155_CR27","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/j.cor.2015.09.006","volume":"67","author":"L Cui","year":"2016","unstructured":"Cui L, Li G, Lin Q, Chen J, Lu N (2016) Adaptive differential evolution algorithm with novel mutation strategies in multiple sub-populations. Comput Oper Res 67:155\u2013173","journal-title":"Comput Oper Res"},{"key":"11155_CR28","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1016\/j.swevo.2018.07.002","volume":"44","author":"A Lin","year":"2019","unstructured":"Lin A, Sun W, Yu H, Wu G, Tang H (2019) Global genetic learning particle swarm optimization with diversity enhancement by ring topology. Swarm Evol Comput 44:571\u2013583","journal-title":"Swarm Evol Comput"},{"issue":"2","key":"11155_CR29","doi-asserted-by":"publisher","first-page":"1167","DOI":"10.1016\/j.ejor.2005.09.004","volume":"176","author":"JF Cordeau","year":"2007","unstructured":"Cordeau JF, Gaudioso M, Laporte G, Moccia L (2007) The service allocation problem at the Gioia Tauro maritime terminal. Eur J Oper Res 176(2):1167\u20131184","journal-title":"Eur J Oper Res"},{"key":"11155_CR30","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1016\/j.swevo.2018.02.013","volume":"44","author":"M Jain","year":"2019","unstructured":"Jain M, Singh V, Rani A (2019) A novel nature-inspired algorithm for optimization: Squirrel search algorithm. Swarm Evol Comput 44:148\u2013175","journal-title":"Swarm Evol Comput"},{"issue":"1","key":"11155_CR31","doi-asserted-by":"publisher","DOI":"10.1088\/1742-6596\/1740\/1\/012050","volume":"1740","author":"PS Kostenetskiy","year":"2021","unstructured":"Kostenetskiy PS, Chulkevich RA, Kozyrev VI (2021) HPC Resources of the Higher School of Economics. J Phys: Conf Ser 1740(1):012050. https:\/\/doi.org\/10.1088\/1742-6596\/1740\/1\/012050","journal-title":"J Phys: Conf Ser"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-025-11155-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00521-025-11155-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-025-11155-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T14:48:20Z","timestamp":1750171700000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00521-025-11155-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3,28]]},"references-count":31,"journal-issue":{"issue":"18","published-print":{"date-parts":[[2025,6]]}},"alternative-id":["11155"],"URL":"https:\/\/doi.org\/10.1007\/s00521-025-11155-z","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"value":"0941-0643","type":"print"},{"value":"1433-3058","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,3,28]]},"assertion":[{"value":"3 December 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 February 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 March 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that there are no conflicts of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}