{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T21:04:42Z","timestamp":1761599082248},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2008,9,13]],"date-time":"2008-09-13T00:00:00Z","timestamp":1221264000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2010,6]]},"DOI":"10.1007\/s10489-008-0145-8","type":"journal-article","created":{"date-parts":[[2008,9,12]],"date-time":"2008-09-12T18:41:19Z","timestamp":1221244879000},"page":"279-291","source":"Crossref","is-referenced-by-count":16,"title":["Search intensity versus search diversity: a false trade off?"],"prefix":"10.1007","volume":"32","author":[{"given":"Alexandre","family":"Linhares","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Horacio Hideki","family":"Yanasse","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,9,13]]},"reference":[{"key":"145_CR1","volume-title":"Simulated annealing: theory and applications","author":"PMJ Laarhoven van","year":"1988","unstructured":"van Laarhoven PMJ, Aarts EHL (1988) Simulated annealing: theory and applications. Kluwer Academic, Norwell"},{"key":"145_CR2","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1023\/A:1008339026836","volume":"11","author":"JCW Debuse","year":"1999","unstructured":"Debuse JCW, Rayward-Smith VJ (1999) Discretisation of continuous database features for a simulated annealing data mining algorithm. Appl Intell 11:285\u2013295","journal-title":"Appl Intell"},{"key":"145_CR3","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/BF00871936","volume":"3","author":"N Ansari","year":"1993","unstructured":"Ansari N, Sarasa R, Wang GS (1993) An efficient annealing algorithm for global optimization in Boltzmann machines. Appl Intell 3:177\u2013192","journal-title":"Appl Intell"},{"key":"145_CR4","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1023\/B:APIN.0000027769.48098.91","volume":"21","author":"BM Ombuki","year":"2004","unstructured":"Ombuki BM, Ventresca M (2004) Local search genetic algorithms for the job-shop scheduling problem. Appl Intell 21:99\u2013109","journal-title":"Appl Intell"},{"key":"145_CR5","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1023\/A:1020955300403","volume":"18","author":"S Ghosh","year":"2003","unstructured":"Ghosh S, Ghosh A, Pal SK (2003) Incorporating ancestors\u2019 influence in genetic algorithms. Appl Intell 18:7\u201325","journal-title":"Appl Intell"},{"key":"145_CR6","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1080\/00207720310001657054","volume":"35","author":"A Mendes","year":"2004","unstructured":"Mendes A, Linhares A (2004) A multiple population evolutionary approach to gate matrix layout. Int J Syst Sci 35:13\u201323","journal-title":"Int J Syst Sci"},{"key":"145_CR7","volume-title":"Handbook of applied optimization","author":"JE Beasley","year":"2000","unstructured":"Beasley JE (2000) Population heuristics. In: Pardalos PM, Resende MGC (eds) Handbook of applied optimization. Oxford University Press, London"},{"key":"145_CR8","first-page":"41","volume-title":"Genetic algorithms and their applications (ICGA\u201987)","author":"DE Goldberg","year":"1987","unstructured":"Goldberg DE, Richardon J (1987) Genetic algorithms with sharing for multimodal function optimization. In: Grefenstette JJ (ed) Genetic algorithms and their applications (ICGA\u201987). Lawrence Erlbaum Associates, Hillsdale, pp\u00a041\u201349"},{"key":"145_CR9","doi-asserted-by":"crossref","unstructured":"Ursem RK (2001) When sharing fails. In: Proc. of the third congress on evolutionary computation, pp\u00a0873\u2013879","DOI":"10.1109\/CEC.2001.934282"},{"key":"145_CR10","doi-asserted-by":"crossref","unstructured":"Ursem RK (2002) Diversity-guided evolutionary algorithms. In: Proc. of parallel problem solving from nature VII, pp 462\u2013471","DOI":"10.1007\/3-540-45712-7_45"},{"key":"145_CR11","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F Glover","year":"1989","unstructured":"Glover F (1989) Tabu search\u2014Part I. ORSA J Comput 1:190\u2013206","journal-title":"ORSA J Comput"},{"key":"145_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu search","author":"F Glover","year":"1997","unstructured":"Glover F, Laguna M (1997) Tabu search. Kluwer Academic, Dordrecht"},{"key":"145_CR13","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/BF00871895","volume":"3","author":"M Laguna","year":"1993","unstructured":"Laguna M, Barnes JW, Glover F (1993) Intelligent scheduling with tabu search\u2014an application to jobs with linear delay penalties and sequence-dependent setup costs and times. Appl Intell 3:159\u2013172","journal-title":"Appl Intell"},{"key":"145_CR14","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1111\/j.1540-5915.1977.tb01074.x","volume":"8","author":"F Glover","year":"1977","unstructured":"Glover F (1977) Heuristics for integer programming using surrogate constraints. Decis Sci 8:156\u2013166","journal-title":"Decis Sci"},{"key":"145_CR15","unstructured":"Cung V-D, Mautor T, Michelon P, Tavares A (1997) A scatter search based approach for the quadratic assignment problem. In: Proc of the IEEE international conference on evolutionary computation, pp\u00a0165\u2013170"},{"key":"145_CR16","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1142\/S012918319800011X","volume":"9","author":"A Linhares","year":"1988","unstructured":"Linhares A, Torre\u00e3o JRA (1988) Microcanonical optimization applied to the traveling salesman problem. Int J Mod Phys C 9:133\u2013146","journal-title":"Int J Mod Phys C"},{"key":"145_CR17","doi-asserted-by":"crossref","first-page":"1750","DOI":"10.1109\/43.811324","volume":"18","author":"A Linhares","year":"1999","unstructured":"Linhares A, Yanasse HH, Torre\u00e3o JRA (1999) Linear gate assignment: a fast statistical mechanics approach. IEEE Trans Comput-Aided Des Integr Circuits Syst 18:1750\u20131758","journal-title":"IEEE Trans Comput-Aided Des Integr Circuits Syst"},{"key":"145_CR18","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF01096763","volume":"6","author":"TA Feo","year":"1995","unstructured":"Feo TA, Resende MGC (1995) Greedy randomized adaptive search procedures. J Glob Optim 6:109\u2013133","journal-title":"J Glob Optim"},{"key":"145_CR19","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1023\/A:1009772208981","volume":"1","author":"MF Arg\u00fcello","year":"1997","unstructured":"Arg\u00fcello MF, Bard JF, Yu G (1997) A GRASP for aircraft routing in response to groundings and delays. J Combin Optim 1:211\u2013228","journal-title":"J Combin Optim"},{"key":"145_CR20","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1002\/(SICI)1097-0037(199705)29:3<173::AID-NET5>3.0.CO;2-E","volume":"29","author":"MGC Resende","year":"1997","unstructured":"Resende MGC, Ribeiro CC (1997) A GRASP for graph planarization. Networks 29:173\u2013189","journal-title":"Networks"},{"key":"145_CR21","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1057\/palgrave.jors.2600362","volume":"48","author":"PG Backhouse","year":"1997","unstructured":"Backhouse PG, Fotheringham AF, Allan G (1997) A comparison of a genetic algorithm with an experimental design technique in the optimization of a production process. J Oper Res Soc 48:247\u2013254","journal-title":"J Oper Res Soc"},{"key":"145_CR22","doi-asserted-by":"crossref","first-page":"550","DOI":"10.1057\/jors.1996.60","volume":"47","author":"K Dowsland","year":"1996","unstructured":"Dowsland K (1996) Genetic algorithms: a tool for OR? J Oper Res Soc 47:550\u2013561","journal-title":"J Oper Res Soc"},{"key":"145_CR23","doi-asserted-by":"crossref","first-page":"492","DOI":"10.1287\/mnsc.39.4.492","volume":"39","author":"M Laguna","year":"1993","unstructured":"Laguna M, Glover F (1993) Bandwidth packing: a tabu search approach. Manag Sci 39:492\u2013500","journal-title":"Manag Sci"},{"key":"145_CR24","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/BF02430370","volume":"1","author":"Y Rochat","year":"1995","unstructured":"Rochat Y, Taillard ED (1995) Probabilistic intensification and diversification in local search for vehicle routing. J Heuristics 1:147\u2013167","journal-title":"J Heuristics"},{"key":"145_CR25","unstructured":"Jain AS (1998) A multi-level hybrid framework for the deterministic job-shop scheduling problem, PhD thesis, University of Dundee, Dundee, Scotland, UK"},{"key":"145_CR26","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1287\/inte.20.4.74","volume":"20","author":"F Glover","year":"1990","unstructured":"Glover F (1990) Tabu search: a tutorial. INTERFACES 20:74\u201394","journal-title":"INTERFACES"},{"key":"145_CR27","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.1475-3995.1996.tb00032.x","volume":"3","author":"A Colorni","year":"1996","unstructured":"Colorni A, Dorigo M, Maffioli F, Manniezzo V, Righini G, Trubian M (1996) Heuristics from nature for hard combinatorial optimization problems. Int Trans Oper Res 3:1\u201321","journal-title":"Int Trans Oper Res"},{"key":"145_CR28","unstructured":"Christofides N (1994) The bionomic algorithm. In: Proc of the associazione Italiana di ricerca operativa conference, Savona, Italy"},{"key":"145_CR29","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1023\/A:1009665717611","volume":"4","author":"V Maniezzo","year":"1998","unstructured":"Maniezzo V, Mingozzi A, Baldacci R (1998) A bionomic approach to the capacitated p-median problem. J Heuristics 4:263\u2013280","journal-title":"J Heuristics"},{"key":"145_CR30","unstructured":"Jones T (1995) One operator, one landscape. Santa Fe Institute Technical Report 95-02-025. Santa Fe Institute, Santa Fe, NM 87501"},{"key":"145_CR31","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/0167-6377(94)90065-5","volume":"16","author":"KD Boese","year":"1994","unstructured":"Boese KD, Kahng AB, Muddu S (1994) A new adaptive multi-start technique for combinatorial global optimizations. Oper Res Lett 16:101\u2013113","journal-title":"Oper Res Lett"},{"key":"145_CR32","volume-title":"New ideas in optimization","author":"P Merz","year":"1999","unstructured":"Merz P, Freisleben B (1999) Fitness landscapes and memetic algorithm design. In: Corne D, Glover F, Dorigo M (eds) New ideas in optimization. McGraw-Hill, New York"},{"key":"145_CR33","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1023\/A:1018983524911","volume":"86","author":"CR Reeves","year":"1999","unstructured":"Reeves CR (1999) Landscapes, operators, and heuristic search. Ann Oper Res 86:473\u2013490","journal-title":"Ann Oper Res"},{"key":"145_CR34","first-page":"165","volume":"2","author":"A Mendes","year":"2002","unstructured":"Mendes A, Fran\u00e7a P, Moscato P (2002) Fitness landscapes for the total tardiness single machine scheduling problem. Neural Netw World 2:165\u2013180","journal-title":"Neural Netw World"},{"key":"145_CR35","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/0166-218X(93)E0115-F","volume":"58","author":"K-T Mak","year":"1995","unstructured":"Mak K-T, Morton AJ (1995) Distances between traveling salesman tours. Discrete Appl Math 58:281\u2013291","journal-title":"Discrete Appl Math"},{"key":"145_CR36","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1137\/S089548019731994X","volume":"12","author":"A Caprara","year":"1999","unstructured":"Caprara A (1999) Sorting permutations by reversals and Eulerian cycle decompositions. SIAM J Discrete Math 12:91\u2013110","journal-title":"SIAM J Discrete Math"},{"key":"145_CR37","first-page":"216","volume":"3","author":"A Linhares","year":"2004","unstructured":"Linhares A (2004) The structure of local search diversity. WSEAS Trans Math 3:216\u2013220","journal-title":"WSEAS Trans Math"},{"key":"145_CR38","unstructured":"Linhares A (2001) Industrial pattern-sequencing problems: some complexity results and new local search models. PhD thesis, National Institute of Space Research, S\u00e3o Jos\u00e9 dos Campos, Brazil"},{"key":"145_CR39","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0004-3702(97)00071-4","volume":"99","author":"M Jelasitya","year":"1998","unstructured":"Jelasitya M, Dombib J (1998) GAS, a concept on modeling species in genetic algorithms. Artif Intell 99:1\u201319","journal-title":"Artif Intell"},{"key":"145_CR40","doi-asserted-by":"crossref","first-page":"1189","DOI":"10.1080\/00207540310001622421","volume":"42","author":"A Linhares","year":"2004","unstructured":"Linhares A (2004) Minimization of open orders: a re-distribution coordination policy. Int J Prod Res 42:1189\u20131205","journal-title":"Int J Prod Res"},{"key":"145_CR41","volume-title":"The art of computer programming, vol. 3. Sorting and searching","author":"D Knuth","year":"1975","unstructured":"Knuth D (1975) The art of computer programming, vol. 3. Sorting and searching. Addison-Wesley, New York"},{"key":"145_CR42","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1016\/0097-3165(87)90022-7","volume":"45","author":"M Aigner","year":"1987","unstructured":"Aigner M, West DB (1987) Sorting by insertion of leading elements. J Combin Theory Ser A 45:306\u2013309","journal-title":"J Combin Theory Ser A"},{"key":"145_CR43","unstructured":"Chen S, Smith SF (1996) Commonality and genetic algorithms. The Robotics Institute CMU-RI-TR-96-27, Carnegie Mellon University"},{"key":"145_CR44","doi-asserted-by":"crossref","first-page":"1073","DOI":"10.1016\/0898-1221(89)90036-9","volume":"17","author":"M Orlowski","year":"1989","unstructured":"Orlowski M, Pachter M (1989) An algorithm for the determination of a longest increasing subsequence in a sequence. Comput Math Appl 17:1073\u20131075","journal-title":"Comput Math Appl"},{"key":"145_CR45","doi-asserted-by":"crossref","first-page":"1759","DOI":"10.1016\/S0305-0548(01)00054-5","volume":"29","author":"A Linhares","year":"2002","unstructured":"Linhares A, Yanasse HH (2002) Connections between cutting-pattern sequencing, VLSI desing, and flexible machines. Comput Oper Res 29:1759\u20131772","journal-title":"Comput Oper Res"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-008-0145-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10489-008-0145-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-008-0145-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T18:25:42Z","timestamp":1559154342000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10489-008-0145-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,9,13]]},"references-count":45,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2010,6]]}},"alternative-id":["145"],"URL":"https:\/\/doi.org\/10.1007\/s10489-008-0145-8","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,9,13]]}}}