{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T10:45:51Z","timestamp":1770288351269,"version":"3.49.0"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2020,2,10]],"date-time":"2020-02-10T00:00:00Z","timestamp":1581292800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,2,10]],"date-time":"2020-02-10T00:00:00Z","timestamp":1581292800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Oper Res Int J"],"published-print":{"date-parts":[[2021,9]]},"DOI":"10.1007\/s12351-020-00549-7","type":"journal-article","created":{"date-parts":[[2020,2,10]],"date-time":"2020-02-10T04:21:46Z","timestamp":1581308506000},"page":"1663-1690","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["A greedy evolutionary hybridization algorithm for the optimal network and quadratic assignment problem"],"prefix":"10.1007","volume":"21","author":[{"given":"Mouhamadou A. M. T.","family":"Bald\u00e9","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Serigne","family":"Gueye","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Babacar M.","family":"Ndiaye","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,2,10]]},"reference":[{"key":"549_CR1","doi-asserted-by":"publisher","first-page":"901","DOI":"10.3233\/JIFS-162141","volume":"33","author":"M Abdel-Baset","year":"2017","unstructured":"Abdel-Baset M, Wu H, Zhou Y, Abdel-fatah L (2017) Elite opposition-flower pollination algorithm for quadratic assignment problem. J Intell Fuzzy Syst 33:901\u2013911","journal-title":"J Intell Fuzzy Syst"},{"key":"549_CR2","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1016\/j.asoc.2018.08.047","volume":"73","author":"M Abdel-Baset","year":"2018","unstructured":"Abdel-Baset M, Manogaran G, El-Shahat D, Mirjalili S (2018) Integrating the whale algorithm with Tabu search for quadratic assignment problem: a new approach for locating hospital departments. Appl Soft Comput J 73:530\u2013546","journal-title":"Appl Soft Comput J"},{"issue":"2","key":"549_CR4","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1287\/ijoc.6.2.126","volume":"6","author":"R Battiti","year":"1994","unstructured":"Battiti R, Tecchiolli G (1994) The reactive tabu search. ORSA J Comput 6(2):126\u2013140","journal-title":"ORSA J Comput"},{"key":"549_CR5","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1287\/ijoc.6.2.154","volume":"6","author":"JC Bean","year":"1994","unstructured":"Bean JC (1994) Genetic algorithms and random keys for sequencing and optimization. ORSA J Comput 6:154\u201360","journal-title":"ORSA J Comput"},{"issue":"9","key":"549_CR6","first-page":"4800","volume":"219","author":"U Benlic","year":"2013","unstructured":"Benlic U, Hao K J (2013c) Breakout local search for the quadratic assignment problem. Appl Math Comput 219(9:4800\u20134815","journal-title":"Appl Math Comput"},{"key":"549_CR8","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1023\/A:1008293323270","volume":"10","author":"RE Burkard","year":"1997","unstructured":"Burkard RE, Karisch SE, Rendl F (1997) Qaplib\u2014a quadratic assignment problem library. J Global Optim 10:391\u2013403","journal-title":"J Global Optim"},{"key":"549_CR9","volume-title":"Handbook of genetic algorithms","author":"L Davis","year":"1991","unstructured":"Davis L (1991) Handbook of genetic algorithms. Van Nostrand, New York"},{"issue":"1 Part 2","key":"549_CR10","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1057\/jors.1977.29","volume":"28","author":"AN Elshafei","year":"1977","unstructured":"Elshafei AN (1977) Hospital layout as a quadratic assignment problem. Oper Res Q 28(1 Part 2):167\u2013179","journal-title":"Oper Res Q"},{"key":"549_CR11","series-title":"DIMACS series in discrete mathematics and theoretical computer science","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1090\/dimacs\/016\/08","volume-title":"Genetic hybrids for the quadratic assignment problem","author":"C Fleurent","year":"1994","unstructured":"Fleurent C, Ferland JA (1994) Genetic hybrids for the quadratic assignment problem, vol 16. DIMACS series in discrete mathematics and theoretical computer science. American Mathematical Society, Providence, pp 173\u201387"},{"issue":"6","key":"549_CR12","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1145\/367766.368168","volume":"5","author":"RW Floyd","year":"1962","unstructured":"Floyd RW (1962) Algorithm 97: shortest path. Commun ACM 5(6):345","journal-title":"Commun ACM"},{"key":"549_CR13","series-title":"International series in operations research & management science","doi-asserted-by":"publisher","DOI":"10.1007\/0-387-22827-6_1","volume-title":"Tutorials on emerging methodologies and applications in operations research","author":"I Gamvros","year":"2005","unstructured":"Gamvros I, Golden B, Raghavan S, Stanojevi\u0107 D (2005) Heuristic search for network design. In: Greenberg HJ (ed) Tutorials on Emerging methodologies and applications in operations research.  International series in operations research & management science, vol 76. Springer, New York, NY"},{"key":"549_CR14","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"M-R Garey","year":"1979","unstructured":"Garey M-R, Johnson D-S (1979) Computers and intractability: a guide to the theory of NP-completeness. W. H. Freeman & Co., New York, NY, USA"},{"key":"549_CR15","volume-title":"Genetic algorithms in search, optimization, and machine learning","author":"DE Goldberg","year":"1989","unstructured":"Goldberg DE (1989) Genetic algorithms in search, optimization, and machine learning. Addison-Wesley Publishing Company, Reading"},{"key":"549_CR16","unstructured":"Gueye S, Ndiaye BM, Josselin D, Poss M, Faye RM, Michelon P, Genre-Grandpierre C, Ciari F (2015) Using mobile phone data for spatial planning simulation and optimization technologies (SPOT), data for development challenge Senegal. In: Book of Abstracts: Scientific Papers, N T15:516\u2013534"},{"issue":"3","key":"549_CR17","doi-asserted-by":"publisher","first-page":"727","DOI":"10.1287\/moor.17.3.727","volume":"17","author":"SW Hadley","year":"1992","unstructured":"Hadley SW, Rendl F, Wolkowicz H (1992) A new lower bound via projection for the quadratic assignment problem. Math Oper Res 17(3):727\u2013739","journal-title":"Math Oper Res"},{"key":"549_CR18","volume-title":"Adaptation in natural and artificial systems","author":"JH Holland","year":"1975","unstructured":"Holland JH (1975) Adaptation in natural and artificial systems. University of Michigan Press, Ann Arbor, MI"},{"key":"549_CR19","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/BFb0120827","volume":"9","author":"J Krarup","year":"1978","unstructured":"Krarup J, Pruzan PM (1978) Computer-aided layout design. Math Program Study 9:75\u201394","journal-title":"Math Program Study"},{"key":"549_CR20","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1287\/mnsc.9.4.586","volume":"9","author":"EL Lawler","year":"1963","unstructured":"Lawler EL (1963) The quadratic assignment problem. Manag Sci 9:586\u2013599","journal-title":"Manag Sci"},{"key":"549_CR21","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/BF00253805","volume":"1","author":"Y Li","year":"1992","unstructured":"Li Y, Pardalos PM (1992) Generating quadratic assignment test problems with known optimal permutations. Comput Optim Appl 1:163\u2013184","journal-title":"Comput Optim Appl"},{"key":"549_CR22","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/s001680200112","volume":"37","author":"J-L Lin","year":"2003","unstructured":"Lin J-L, Feng C-M (2003) A bi-level programming model for the land use-network design problem. Ann Region Sci 37:93\u2013105","journal-title":"Ann Region Sci"},{"key":"549_CR23","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/0166-0462(78)90010-8","volume":"8","author":"M Los","year":"1978","unstructured":"Los M (1978) Simultaneous optimization of land use and transportation. A synthesis of the quadratic assignment problem and the optimal network problem. Region Sci Urban Econ 8:21\u201342","journal-title":"Region Sci Urban Econ"},{"key":"549_CR24","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/0191-2615(79)90005-5","volume":"13B","author":"M Los","year":"1979","unstructured":"Los M (1979) A discrete-convex programming approach to simultaneous optimization of land use and transportation. Transp Res B 13B:33\u201348","journal-title":"Transp Res B"},{"issue":"3","key":"549_CR25","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/0034-3331(73)90011-0","volume":"3","author":"L Lundqvist","year":"1973","unstructured":"Lundqvist L (1973) Integrated location\u2014transportation analysis; a decomposition approach. Region Urban Econ 3(3):233\u2013262","journal-title":"Region Urban Econ"},{"key":"549_CR26","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1287\/opre.16.1.150","volume":"16","author":"CE Nugent","year":"1968","unstructured":"Nugent CE, Vollman TE Ruml (1968) An experimental comparison of techniques for the assignment of facilities to locations. J Oper Res 1:150\u201373","journal-title":"J Oper Res"},{"key":"549_CR27","volume-title":"The traffic assignment problem: models and methods","author":"M Patriksson","year":"1994","unstructured":"Patriksson M (1994) The traffic assignment problem: models and methods. Link\u00f6ping Institute of Technology, Link\u00f6ping"},{"key":"549_CR28","unstructured":"Roucairol C (1987) Du sequentiel au parall\u00e8le: la recherche arborescente et son application \u00e0 la programmation quadratique en variables 0 et 1, 1987. Th\u00e8se d\u2019Etat, Universit\u00e8 Pierre et Marie Curie, Paris, France"},{"key":"549_CR29","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/0041-1647(69)90152-X","volume":"3","author":"AJ Scott","year":"1969","unstructured":"Scott AJ (1969) The optimal network problem: some computational procedures. Transp Res 3:201\u2013210","journal-title":"Transp Res"},{"key":"549_CR30","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1287\/mnsc.22.2.172","volume":"22","author":"M Scriabin","year":"1975","unstructured":"Scriabin M, Vergin RC (1975) Comparison of computer algorithms and visual based methods for plant layout. Manag Sci 22:172\u2013187","journal-title":"Manag Sci"},{"key":"549_CR31","unstructured":"Sean L (2013) Essentials of metaheuristics, Lulu, 2nd edn. http:\/\/cs.gmu.edu\/~sean\/book\/metaheuristics\/"},{"key":"549_CR32","volume-title":"Urban transportation networks: equilibrium analysis with mathematical programming techniques","author":"Y Sheffi","year":"1984","unstructured":"Sheffi Y (1984) Urban transportation networks: equilibrium analysis with mathematical programming techniques. Prentice Hall, Englewood Cliffs"},{"issue":"1","key":"549_CR33","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1287\/ijoc.2.1.33","volume":"2","author":"J Skorin-kapov","year":"1990","unstructured":"Skorin-kapov J (1990) Tabu search applied to the quadratic assingnment problem. ORSA J Comput 2(1):33\u201345","journal-title":"ORSA J Comput"},{"issue":"3","key":"549_CR34","doi-asserted-by":"publisher","first-page":"1519","DOI":"10.1016\/j.ejor.2005.01.066","volume":"174","author":"T St\u00fctzle","year":"2006","unstructured":"St\u00fctzle T (2006) Iterated local search for the quadratic assignment problem. Eur J Oper Res 174(3):1519\u20131539","journal-title":"Eur J Oper Res"},{"key":"549_CR35","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0966-8349(95)00008-6","volume":"3","author":"ED Taillard","year":"1995","unstructured":"Taillard ED (1995) Comparison of iterative searches for the quadratic assingnment problem. Locat Sci 3:87\u2013105","journal-title":"Locat Sci"},{"key":"549_CR36","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0305-0548(93)E0020-T","volume":"22","author":"DE Tate","year":"1985","unstructured":"Tate DE, Smith AE (1985) A genetic approach to the quadratic assignment problem. Comput Oper Res 22:73\u201383","journal-title":"Comput Oper Res"},{"key":"549_CR37","unstructured":"Thonemann UW, B\u00f6lte A (1994) An improved simulated annealing algorithm for the quadratic assignment problem. Working paper, School of Business, Department of Production and Operations Research, University of Paderborn, Germany"},{"issue":"1","key":"549_CR38","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1080\/07408178708975376","volume":"19","author":"MR Wilheilm","year":"1987","unstructured":"Wilheilm MR, Ward TL (1987) Solving quadratic assignment problems by simulated annealing. IIE Trans 19(1):107\u2013119","journal-title":"IIE Trans"},{"key":"549_CR39","first-page":"37","volume":"1364","author":"Y Xiong","year":"1995","unstructured":"Xiong Y, Schneider JB (1995) Transportation network design using a cumulative genetic algorithm and neural network. Transp Res Rec 1364:37\u201344","journal-title":"Transp Res Rec"}],"container-title":["Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-020-00549-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12351-020-00549-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-020-00549-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,4]],"date-time":"2021-09-04T01:09:56Z","timestamp":1630717796000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12351-020-00549-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,2,10]]},"references-count":37,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2021,9]]}},"alternative-id":["549"],"URL":"https:\/\/doi.org\/10.1007\/s12351-020-00549-7","relation":{},"ISSN":["1109-2858","1866-1505"],"issn-type":[{"value":"1109-2858","type":"print"},{"value":"1866-1505","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,2,10]]},"assertion":[{"value":"15 October 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 August 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 January 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 February 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}