{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:43:24Z","timestamp":1761597804524,"version":"3.37.3"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"18","license":[{"start":{"date-parts":[[2017,2,18]],"date-time":"2017-02-18T00:00:00Z","timestamp":1487376000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100005101","name":"Universidad Nacional de La Pampa","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100005101","id-type":"DOI","asserted-by":"publisher"}]},{"name":"ANPCYT","award":["PICTO 2011-0278"],"award-info":[{"award-number":["PICTO 2011-0278"]}]},{"name":"Spanish MINECO","award":["project TIN2014-57341-R"],"award-info":[{"award-number":["project TIN2014-57341-R"]}]},{"DOI":"10.13039\/100009473","name":"Universidad de M\u00e1laga","doi-asserted-by":"publisher","award":["project number 8.06\/5.47.4142"],"award-info":[{"award-number":["project number 8.06\/5.47.4142"]}],"id":[{"id":"10.13039\/100009473","id-type":"DOI","asserted-by":"publisher"}]},{"name":"VSB-Technical University of Ostrava"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2017,9]]},"DOI":"10.1007\/s00500-017-2515-9","type":"journal-article","created":{"date-parts":[[2017,2,17]],"date-time":"2017-02-17T20:41:47Z","timestamp":1487364107000},"page":"5193-5206","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["The Problem Aware Local Search algorithm: an efficient technique for permutation-based problems"],"prefix":"10.1007","volume":"21","author":[{"given":"Gabriela F.","family":"Minetti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gabriel","family":"Luque","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Enrique","family":"Alba","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,2,18]]},"reference":[{"key":"2515_CR1","doi-asserted-by":"publisher","unstructured":"Abdelkafi O, Idoumghar L, Lepagnot J (2015) Distributed multistart hybrid iterative tabu search. In: 2015 IEEE international conference on systems, man, and cybernetics, pp 1962\u20131967. doi:\n                        10.1109\/SMC.2015.342","DOI":"10.1109\/SMC.2015.342"},{"key":"2515_CR2","volume-title":"Cellular genetic algorithms. Operations research\/computer science interfaces","author":"E Alba","year":"2008","unstructured":"Alba E, Dorronsoro B (2008) Cellular genetic algorithms. Operations research\/computer science interfaces. Springer, Heidelberg"},{"key":"2515_CR3","doi-asserted-by":"crossref","unstructured":"Alba E, Luque G (2007) A new local search algorithm for the DNA fragment assembly problem. In: Evolutionary computation in combinatorial optimization, EvoCOP\u201907, Lecture notes in computer science, vol 4446. Springer, Valencia, pp 1\u201312","DOI":"10.1007\/978-3-540-71615-0_1"},{"issue":"11","key":"2515_CR4","doi-asserted-by":"crossref","first-page":"1069","DOI":"10.1057\/jors.1990.166","volume":"41","author":"JE Beasley","year":"1990","unstructured":"Beasley JE (1990) OR-library: distributing test problems by electronic mail. J Oper Res Soc 41(11):1069\u20131072","journal-title":"J Oper Res Soc"},{"issue":"1","key":"2515_CR5","doi-asserted-by":"publisher","first-page":"584","DOI":"10.1016\/j.eswa.2014.08.011","volume":"42","author":"U Benlic","year":"2015","unstructured":"Benlic U, Hao JK (2015) Memetic search for the quadratic assignment problem. Expert Syst Appl 42(1):584\u2013595. doi:\n                        10.1016\/j.eswa.2014.08.011","journal-title":"Expert Syst Appl"},{"key":"2515_CR6","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1023\/A:1018973327327","volume":"77","author":"RS Bhaba","year":"1998","unstructured":"Bhaba RS, Wilbert EW, Gary LH (1998) Locating sets of identical machines in a linear layout. Ann Oper Res 77:183\u2013207","journal-title":"Ann Oper Res"},{"issue":"3","key":"2515_CR7","doi-asserted-by":"crossref","first-page":"658","DOI":"10.1016\/j.ejor.2007.06.068","volume":"199","author":"V Boyer","year":"2009","unstructured":"Boyer V, Elkihel M, Baz DE (2009) Heuristics for the 0\u20131 multidimensional knapsack problem. Eur J Oper Res 199(3):658\u2013664","journal-title":"Eur J Oper Res"},{"issue":"4","key":"2515_CR8","doi-asserted-by":"crossref","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 Glob Optim 10(4):391\u2013403","journal-title":"J Glob Optim"},{"issue":"4","key":"2515_CR9","doi-asserted-by":"crossref","first-page":"698","DOI":"10.1016\/j.aml.2011.09.053","volume":"25","author":"F Chicano","year":"2012","unstructured":"Chicano F, Luque G, Alba E (2012) Autocorrelation measures for the quadratic assignment problem. Appl Math Lett 25(4):698\u2013705","journal-title":"Appl Math Lett"},{"key":"2515_CR10","doi-asserted-by":"publisher","unstructured":"Colombo G, Mumford C (2005) Comparing algorithms, representations and operators for the multi-objective knapsack problem. In: 2005. The 2005 IEEE congress on evolutionary computation, vol\u00a02, pp 1268\u20131275. doi:\n                        10.1109\/CEC.2005.1554836","DOI":"10.1109\/CEC.2005.1554836"},{"key":"2515_CR11","first-page":"454","volume":"28","author":"SP Coy","year":"1998","unstructured":"Coy SP, Golden BL, Runger GC, Wasil EA (1998) See the forest before the trees: fine-tuned learning and its application to the traveling salesman problem. IEEE Trans Syst Man Cybern Part A 28:454\u2013464","journal-title":"IEEE Trans Syst Man Cybern Part A"},{"key":"2515_CR12","first-page":"2651","volume":"2008","author":"B Dorronsoro","year":"2008","unstructured":"Dorronsoro B, Alba E, Luque G, Bouvry P (2008) A self-adaptive cellular memetic algorithm for the DNA fragment assembly problem. IEEE Congr Evol Comput 2008:2651\u20132658","journal-title":"IEEE Congr Evol Comput"},{"key":"2515_CR13","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/BF00202901","volume":"60","author":"DB Fogel","year":"1988","unstructured":"Fogel DB (1988) An evolutionary approach to the traveling salesman problem. Biol Cybern 60:139\u2013144","journal-title":"Biol Cybern"},{"key":"2515_CR14","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/BF00203032","volume":"63","author":"DB Fogel","year":"1990","unstructured":"Fogel DB, Atmar J (1990) Comparing genetic operators with Gaussian mutations in simulated evolutionary processes using linear systems. Biol Cybern 63:111\u2013114","journal-title":"Biol Cybern"},{"key":"2515_CR15","doi-asserted-by":"crossref","unstructured":"Fukunaga A, Tazoe S (2009) Combining multiple representations in a genetic algorithm for the multiple knapsack problem. In: 2009. CEC \u201909. IEEE congress on evolutionary computation, pp 2423\u20132430","DOI":"10.1109\/CEC.2009.4983244"},{"issue":"2","key":"2515_CR16","doi-asserted-by":"publisher","first-page":"648","DOI":"10.1007\/s11227-014-1315-6","volume":"71","author":"S Iturriaga","year":"2015","unstructured":"Iturriaga S, Nesmachnow S, Luna F, Alba E (2015) A parallel local search in CPU\/GPU for scheduling independent tasks on large heterogeneous computing systems. J Supercomput 71(2):648\u2013672. doi:\n                        10.1007\/s11227-014-1315-6","journal-title":"J Supercomput"},{"issue":"3","key":"2515_CR17","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1109\/TSMCA.2009.2014556","volume":"39","author":"T James","year":"2009","unstructured":"James T, Rego C, Glover F (2009) Multistart tabu search and diversification strategies for the quadratic assignment problem. Trans Syst Man Cybern Part A 39(3):579\u2013596. doi:\n                        10.1109\/TSMCA.2009.2014556","journal-title":"Trans Syst Man Cybern Part A"},{"issue":"1","key":"2515_CR18","doi-asserted-by":"crossref","first-page":"53","DOI":"10.2307\/1907742","volume":"25","author":"T Koopmans","year":"1957","unstructured":"Koopmans T, Beckmann M (1957) Assignment problems and the location of economic activities. Econometrica 25(1):53\u201376","journal-title":"Econometrica"},{"issue":"2","key":"2515_CR19","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1007\/BF02243544","volume":"27","author":"S Martello","year":"1981","unstructured":"Martello S, Toth P (1981) Heuristic algorithms for the multiple knapsack problem. Computing 27(2):93\u2013112","journal-title":"Computing"},{"key":"2515_CR20","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/S0305-0548(96)00047-0","volume":"24","author":"A Mason","year":"1998","unstructured":"Mason A, R\u00f6nnqvist M (1998) Solution methods for the balancing of jet turbines. Comput Oper Res 24:153\u2013167","journal-title":"Comput Oper Res"},{"key":"2515_CR21","doi-asserted-by":"crossref","unstructured":"Minetti G, Alba E (2010) Metaheuristic assemblers of DNA strands: noiseless and noisy cases. In: IEEE congress on evolutionary computation. IEEE, pp 1\u20138","DOI":"10.1109\/CEC.2010.5586524"},{"key":"2515_CR22","unstructured":"Minetti G, Leguizam\u00f3n G, Alba E (2012) SAX: a new and efficient assembler for solving DNA fragment assembly problem. In: JAIIO (ed) 13th Argentine symposium on artificial intelligence, ASAI 2012. SADIO, pp 177\u2013188"},{"key":"2515_CR23","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/j.ins.2014.02.020","volume":"277","author":"G Minetti","year":"2014","unstructured":"Minetti G, Leguizam\u00f3n G, Alba E (2014) An improved trajectory-based hybrid metaheuristic applied to the noisy DNA fragment assembly problem. Inf Sci 277:273\u2013283","journal-title":"Inf Sci"},{"key":"2515_CR24","doi-asserted-by":"publisher","unstructured":"Mumford C (2003) Comparing representations and recombination operators for the multi-objective 0\/1 knapsack problem. In: 2003. CEC \u201903. The 2003 congress on evolutionary computation, vol\u00a02, pp 854\u2013861. doi:\n                        10.1109\/CEC.2003.1299756","DOI":"10.1109\/CEC.2003.1299756"},{"issue":"1","key":"2515_CR25","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1007\/s10803-009-0816-2","volume":"40","author":"M Norris","year":"2010","unstructured":"Norris M, Lecavalier L (2010) Evaluating the use of exploratory factor analysis in developmental disability psychological research. J Autism Dev Disord 40(1):8\u201320. doi:\n                        10.1007\/s10803-009-0816-2","journal-title":"J Autism Dev Disord"},{"key":"2515_CR26","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/s10479-005-2455-0","volume":"138","author":"GG Polak","year":"2005","unstructured":"Polak GG (2005) On a special case of the quadratic assignment problem with an application to storage-and-retrieval devices. Ann Oper Res 138:223\u2013233","journal-title":"Ann Oper Res"},{"issue":"7","key":"2515_CR27","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1109\/MC.2002.1016901","volume":"35","author":"M Pop","year":"2002","unstructured":"Pop M, Salzberg S, Shumway M (2002) Genome sequence assembly: algorithms and issues. Computer 35(7):47\u201354","journal-title":"Computer"},{"issue":"2","key":"2515_CR28","doi-asserted-by":"crossref","first-page":"522","DOI":"10.1016\/S0377-2217(97)00288-9","volume":"106","author":"C Rego","year":"1998","unstructured":"Rego C (1998) Relaxed tours and path ejections for the traveling salesman problem. Eur J Oper Res 106(2):522\u2013538","journal-title":"Eur J Oper Res"},{"issue":"2","key":"2515_CR29","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1109\/TEVC.2004.840835","volume":"9","author":"Q Zhang","year":"2005","unstructured":"Zhang Q, Sun J, Tsang E (2005) An evolutionary algorithm with guided mutation for the maximum clique problem. IEEE Trans Evol Comput 9(2):192\u2013200","journal-title":"IEEE Trans Evol Comput"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-017-2515-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-017-2515-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-017-2515-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,9,7]],"date-time":"2017-09-07T10:11:22Z","timestamp":1504779082000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-017-2515-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,2,18]]},"references-count":29,"journal-issue":{"issue":"18","published-print":{"date-parts":[[2017,9]]}},"alternative-id":["2515"],"URL":"https:\/\/doi.org\/10.1007\/s00500-017-2515-9","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"type":"print","value":"1432-7643"},{"type":"electronic","value":"1433-7479"}],"subject":[],"published":{"date-parts":[[2017,2,18]]}}}