{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,17]],"date-time":"2024-07-17T11:10:21Z","timestamp":1721214621815},"reference-count":150,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2013,7,1]],"date-time":"2013-07-01T00:00:00Z","timestamp":1372636800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["4OR-Q J Oper Res"],"published-print":{"date-parts":[[2013,7]]},"DOI":"10.1007\/s10288-013-0242-3","type":"journal-article","created":{"date-parts":[[2013,7,16]],"date-time":"2013-07-16T10:19:23Z","timestamp":1373969963000},"page":"101-150","source":"Crossref","is-referenced-by-count":15,"title":["Combining metaheuristics with mathematical programming, constraint programming and machine learning"],"prefix":"10.1007","volume":"11","author":[{"given":"El-Ghazali","family":"Talbi","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,7,17]]},"reference":[{"key":"242_CR1","doi-asserted-by":"crossref","unstructured":"Abbattista F, Abbattista N, Caponetti L (1995) An evolutionary and cooperative agent model for optimization. In: IEEE international conference on evolutionary computation ICEC\u201995, Perth, Australia, pp 668\u2013671","DOI":"10.1109\/ICEC.1995.487464"},{"key":"242_CR2","unstructured":"Abramson D, Logothetis P, Postula A, Randall M (1997) Application specific computers for combinatorial optimisation. In: Australien computer architecture workshop, Sydney, Australia"},{"key":"242_CR3","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1109\/2.144393","volume":"25","author":"DA Abramson","year":"1992","unstructured":"Abramson DA (1992) A very high speed architecture to support simulated annealing. IEEE Comput 25:27\u201334","journal-title":"IEEE Comput"},{"key":"242_CR4","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1287\/opre.45.2.226","volume":"45","author":"CC Aggarwal","year":"1997","unstructured":"Aggarwal CC, Orlin JB, Tai RP (1997) An optimized crossover for the maximum independent set. Oper Res 45:226\u2013234","journal-title":"Oper Res"},{"key":"242_CR5","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1016\/S0167-8191(03)00014-0","volume":"29","author":"RM Aiex","year":"2003","unstructured":"Aiex RM, Binato S, Ramakrishna RS (2003) Parallel GRASP with path relinking for job shop scheduling. Parallel Comput 29:393\u2013430","journal-title":"Parallel Comput"},{"key":"242_CR6","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1287\/ijoc.3.2.149","volume":"3","author":"D Applegate","year":"1991","unstructured":"Applegate D, Cook W (1991) A computational study of the job-shop scheduling problem. ORSA J Comput 3:149\u2013156","journal-title":"ORSA J Comput"},{"key":"242_CR7","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511615320","volume-title":"Principles of constraint programming","author":"K Apt","year":"2003","unstructured":"Apt K (2003) Principles of constraint programming. Cambridge University Press, Cambridge"},{"issue":"2","key":"242_CR8","doi-asserted-by":"crossref","first-page":"546","DOI":"10.1016\/S0377-2217(97)00290-7","volume":"106","author":"P Augerat","year":"1998","unstructured":"Augerat P, Belenguer JM, Benavent E, Corberan A, Naddef D (1998) Separating capacity constraints in the CVRP using tabu search. Eur J Oper Res 106(2):546\u2013557","journal-title":"Eur J Oper Res"},{"issue":"2","key":"242_CR9","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1023\/A:1009646528813","volume":"4","author":"E Balas","year":"1998","unstructured":"Balas E, Niehaus W (1998) Optimized crossover-based genetic algorithms for the maximum cardinality and maximum weight clique problems. J Heuristics 4(2):107\u2013122","journal-title":"J Heuristics"},{"key":"242_CR10","doi-asserted-by":"crossref","unstructured":"Barnhart C, Johnson EL, Nemhauser GL, Savelsbergh MWP, Vance PH (1998) Branch-and-price: column generation for huge integer programs. Oper Res 46:316\u2013329","DOI":"10.1287\/opre.46.3.316"},{"issue":"11","key":"242_CR11","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"},{"key":"242_CR12","unstructured":"Belding T (1995) The distributed genetic algorithm revisted. In: Eshelmann D (ed) Sixth international conference on genetic algorithms. Morgan Kaufmann, San Mateo, CA"},{"key":"242_CR13","unstructured":"Belew RK, McInerny J, Schraudolph NN (1991) Evolving networks: using genetic algorithms with connectionist learning. In: Langton CG, Taylor C, Doyne Farmer JD, Rasmussen S (eds) Second confernce on artificial life. Addison-Wesley, USA, pp 511\u2013548"},{"key":"242_CR14","volume-title":"Dynamic programming","author":"R Bellman","year":"1957","unstructured":"Bellman R (1957) Dynamic programming. Princeton University Press, Princeton, NJ"},{"key":"242_CR15","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1007\/BF01386316","volume":"4","author":"JF Benders","year":"1962","unstructured":"Benders JF (1962) Partitioning procedures for solving mixed-variables programming problems. Numer Math 4:238\u2013252","journal-title":"Numer Math"},{"key":"242_CR16","volume-title":"Network optimization: continuous and discrete models","author":"DP Bertsekas","year":"1998","unstructured":"Bertsekas DP (1998) Network optimization: continuous and discrete models. Athena Scientific, Belmont, MA"},{"key":"242_CR17","unstructured":"Boese KD (1996) Models for iterative global optimization. PhD thesis, University of California, Los Angeles"},{"issue":"2","key":"242_CR18","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) New adaptive multi-start techniques for combinatorial global optimizations. Oper Res Lett 16(2):101\u2013113","journal-title":"Oper Res Lett"},{"key":"242_CR19","unstructured":"Braun H (1990) On solving traveling salesman problems by genetic algorithms. In: Schwefel H-P, Manner R (eds) Parallel problem solving from nature, vol 496 of LNCS. Springer, Dortmund, pp 129\u2013133"},{"key":"242_CR20","unstructured":"Burke EK, Cowling PI, Keuthen R (2001) Effective local and guided variable neighborhood search methods for the asymmetric traveling salesman problem. In: EvoWorkshop. LNCS 2037, Springer, Berlin, pp 203\u2013312"},{"key":"242_CR21","unstructured":"Burke EK, Kendall G, Newall J, Hart E, Ross P, Schulemburg S (2003) Hyper-heuristics: an emerging direction in modern search technology. In: Glover F, Kochenberger G (eds) Handbook of metaheuristics. Kluwer Academic Publishers, Dordrecht"},{"key":"242_CR22","unstructured":"Caseau Y, Laburthe F (1995) Disjunctive scheduling with task intervals. Technical report LIENS-95-25, Ecole Normale Sup\u00e9rieure de Paris, France"},{"key":"242_CR23","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1023\/A:1009661600931","volume":"5","author":"Y Caseau","year":"1999","unstructured":"Caseau Y, Laburthe F (1999) Heuristics for large constrained routing problems. J Heuristics 5:281\u2013303","journal-title":"J Heuristics"},{"key":"242_CR24","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1007\/3-540-45411-X_39","volume":"2175","author":"A Cesta","year":"2001","unstructured":"Cesta A, Cortellessa G, Oddi A, Policella N, Susi A (2001) A constraint-based architecture for flexible support to activity scheduling. Lect Notes Comput Sci 2175:369\u2013390","journal-title":"Lect Notes Comput Sci"},{"key":"242_CR25","unstructured":"Chabrier A, Danna E, Le C (2002) Pape. Coop\u00e9ration entre g\u00e9n\u00e9ration de colonnes sans cycle et recherche locale appliqu\u00e9e au routage de v\u00e9hicules. In: Huiti\u00e8mes Journ\u00e9es Nationales sur la r\u00e9solution de Probl\u00e8mes NP-Complets JNPC\u20192002, Nice, France"},{"issue":"3","key":"242_CR26","doi-asserted-by":"crossref","first-page":"636","DOI":"10.1016\/j.ejor.2003.08.053","volume":"161","author":"R Chelouah","year":"2004","unstructured":"Chelouah R, Siarry P (2004) A hybrid method combining continuous tabu search and Nelder\u2013Mead simplex algorithms for the global optimization of multiminima functions. Eur J Oper Res 161(3):636\u2013654","journal-title":"Eur J Oper Res"},{"key":"242_CR27","doi-asserted-by":"crossref","unstructured":"Chen H, Flann NS (1994) Parallel simulated annealing and genetic algorithms: a space of hybrid methods. In: Davidor Y, Schwefel H-P, Manner R (eds) Third conference, on parallel problem solving from nature. Springer, Jerusalem, pp 428\u2013436","DOI":"10.1007\/3-540-58484-6_286"},{"key":"242_CR28","unstructured":"Chu PC (1997) A genetic algorithm approach for combinatorial optimization problems. PhD thesis, University of London, London, UK"},{"issue":"3","key":"242_CR29","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1287\/moor.4.3.233","volume":"4","author":"V Chvatal","year":"1979","unstructured":"Chvatal V (1979) A greedy heuristic for the set covering problem. Math Oper Res 4(3):233\u2013235","journal-title":"Math Oper Res"},{"key":"242_CR30","doi-asserted-by":"crossref","unstructured":"Clearwater SH, Hogg T, Huberman BA (1992) Cooperative problem solving. In: Huberman BA (ed) Computation: the micro and the macro view. World Scientific, Singapore, pp 33\u201370","DOI":"10.1142\/9789812812438_0003"},{"key":"242_CR31","doi-asserted-by":"crossref","first-page":"1181","DOI":"10.1126\/science.254.5035.1181","volume":"254","author":"Clearwater SH, Huberman BA, Hogg T","year":"1991","unstructured":"Clearwater SH, Huberman BA, Hogg T (1991) Cooperative solution of constraint satisfaction problems. Science 254:1181\u20131183","journal-title":"Science"},{"key":"242_CR32","unstructured":"Cohoon J, Hedge S, Martin W, Richards D (1987) Punctuated equilibria: a parallel genetic algorithm. In: Grefenstette JJ (ed) Second international conference on genetic algorithms. MIT, Cambridge, MA, pp 148\u2013154"},{"key":"242_CR33","doi-asserted-by":"crossref","unstructured":"Cohoon JP, Martin WN, Richards DS (1990) Genetic algorithms and punctuated equilibria. In: Schwefel H-P, Manner R (eds) Parallel problem solving from nature, vol 496. Springer, Dortmund, pp 134\u2013141","DOI":"10.1007\/BFb0029744"},{"key":"242_CR34","unstructured":"Cohoon JP, Martin WN, Richards DS (1991) A multi-population genetic algorithm for solving the k-partition problem on hypercubes. In: Belew RK, Booker LB (eds) Fourth international conference on genetic algorithms. Morgan Kaufmann, San Mateo, CA, pp 244\u2013248"},{"issue":"3","key":"242_CR35","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1287\/ijoc.15.3.233.16078","volume":"15","author":"W Cook","year":"2003","unstructured":"Cook W, Seymour P (2003) Tour merging via branch-decomposition. INFORMS J Comput 15(3):233\u2013248","journal-title":"INFORMS J Comput"},{"key":"242_CR36","unstructured":"Crainic TG, Nguyen AT, Gendreau M (1997) Cooperative multi-thread parallel tabu search with evolutionary adaptive memory. In: 2nd international conference on metaheuristics, Sophia Antipolis, France"},{"key":"242_CR37","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/BF01719254","volume":"17","author":"TG Crainic","year":"1995","unstructured":"Crainic TG, Toulouse M, Gendreau M (1995) Synchronous tabu search parallelization strategies for multi-commodity location-allocation with balancing requirements. OR Spektrum 17:113\u2013123","journal-title":"OR Spektrum"},{"key":"242_CR38","unstructured":"Crainic TG, Toulouse M (2003) Parallel strategies for metaheuristics. In: Glover FW, Kochenberger GA (eds) Handbook of metaheuristics. Springer, Berlin, pp 475\u2013513"},{"key":"242_CR39","unstructured":"Cung V-D, Mautor T, Michelon P, Tavares A (1997) A scatter search based approach for the quadratic assignment problem. In: IEEE international conference on evolutionary computation ICEC\u201997. Indianapolis, USA"},{"key":"242_CR40","unstructured":"Dalboni FL, Ochi LS, Drummond LMD (2003) On improving evolutionary algorithms by using data mining for the oil collector vehicle routing problem. In: International network optimization conference INOC\u20192003, Paris, France"},{"key":"242_CR41","unstructured":"Davis L (1985) Job-shop scheduling with genetic algorithms. In: Grefenstette JJ (ed) International conference on genetic algorithms and their applications, Pittsburgh, pp 136\u2013140"},{"key":"242_CR42","doi-asserted-by":"crossref","unstructured":"Dimitrescu I, Stutzle T (2003) Combinations of local search and exact algorithms. In: Evo workshops, pp 211\u2013223","DOI":"10.1007\/3-540-36605-9_20"},{"key":"242_CR43","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1016\/S0377-2217(97)00281-6","volume":"106","author":"KA Dowsland","year":"1998","unstructured":"Dowsland KA (1998) Nurse scheduling with tabu search and strategic oscillation. Eur J Oper Res 106:393\u2013407","journal-title":"Eur J Oper Res"},{"issue":"2","key":"242_CR44","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1016\/j.ejor.2004.04.030","volume":"168","author":"KA Dowsland","year":"2006","unstructured":"Dowsland KA, Herbert EA, Kendall G (2006) Using tree search bounds to enhance a genetic algorithm approach to two rectangle packing problems. Eur J Oper Res 168(2):390\u2013402","journal-title":"Eur J Oper Res"},{"key":"242_CR45","doi-asserted-by":"crossref","first-page":"825","DOI":"10.1057\/palgrave.jors.2600970","volume":"51","author":"KA Dowsland","year":"2000","unstructured":"Dowsland KA, Thomson JM (2000) Solving a nurse scheduling problem with knapsacks, networks and tabu search. J Oper Res Soc 51:825\u2013833","journal-title":"J Oper Res Soc"},{"key":"242_CR46","doi-asserted-by":"crossref","unstructured":"Eby D, Averill R, Punch W, Goodman E (1998) Evaluation of injection island model GA performance on flywheel design optimization. In: International conference on adaptive computing in design and manufacturing. Springer, Devon, pp 121\u2013136","DOI":"10.1007\/978-1-4471-1589-2_10"},{"key":"242_CR47","volume-title":"Blackboard systems","author":"RS Engelmore","year":"1988","unstructured":"Engelmore RS, Morgan A (1988) Blackboard systems. Addison-Wesley, Reading, MA"},{"issue":"3","key":"242_CR48","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1007\/BF02684444","volume":"59","author":"I Falco De","year":"1997","unstructured":"De Falco I, Del Balio R, Tarantino E (1997) An analysis of parallel heuristics for task allocation in multicomputers. Computing 59(3):259\u2013275","journal-title":"Computing"},{"key":"242_CR49","doi-asserted-by":"crossref","unstructured":"De Falco I, Del Balio R, Tarantino E, Vaccaro R (1994) Improving search by incorporating evolution principles in parallel tabu search. In: IEEE conference on evolutionary computation, pp 823\u2013828","DOI":"10.1109\/ICEC.1994.349949"},{"key":"242_CR50","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1002\/(SICI)1520-6750(199908)46:5<463::AID-NAV2>3.0.CO;2-S","volume":"46","author":"A Federgruen","year":"1999","unstructured":"Federgruen A, Tzur M (1999) Time-partitioning heuristics: application to one warehouse, multi-item, multi-retailer lot-sizing problems. Nav Res Logist 46:463\u2013486","journal-title":"Nav Res Logist"},{"key":"242_CR51","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":"242_CR52","doi-asserted-by":"crossref","first-page":"860","DOI":"10.1287\/opre.42.5.860","volume":"42","author":"TA Feo","year":"1994","unstructured":"Feo TA, Resende MGC, Smith SH (1994) A greedy randomized adaptive search procedure for maximum independent set. Oper Res 42:860\u2013878","journal-title":"Oper Res"},{"key":"242_CR53","doi-asserted-by":"crossref","first-page":"635","DOI":"10.1016\/0305-0548(91)90001-8","volume":"18","author":"TA Feo","year":"1991","unstructured":"Feo TA, Venkatraman K, Bard JF (1991) A GRASP for a difficult single machine scheduling problem. Comput Oper Res 18:635\u2013643","journal-title":"Comput Oper Res"},{"key":"242_CR54","unstructured":"Filho, GR, Lorena LAN (2000) Constructive genetic algorithm and column generation: an application to graph coloring. In: APORS\u20192000 conference of the Association of the Asian-Pacific Operations Research Societies within IFORS"},{"key":"242_CR55","doi-asserted-by":"crossref","unstructured":"Fischetti M, Lodi A (2003) Local branching. Math Program 98(1\u20133):23\u201347","DOI":"10.1007\/s10107-003-0395-5"},{"key":"242_CR56","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1287\/inte.15.2.10","volume":"15","author":"ML Fisher","year":"1985","unstructured":"Fisher ML (1985) An application oriented guide to lagrangian relaxation. Interfaces 15:399\u2013404","journal-title":"Interfaces"},{"key":"242_CR57","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1090\/dimacs\/016\/08","volume":"16","author":"C Fleurent","year":"1994","unstructured":"Fleurent C, Ferland JA (1994) Genetic hybrids for the quadratic assignment problem. DIMACS Ser Discret Math Theor Comput Sci 16:173\u2013188","journal-title":"DIMACS Ser Discret Math Theor Comput Sci"},{"issue":"3","key":"242_CR58","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1007\/BF02125407","volume":"63","author":"C Fleurent","year":"1996","unstructured":"Fleurent C, Ferland JA (1996) Genetic and hybrid algorithms for graph coloring. Ann Oper Res 63(3):437\u2013461","journal-title":"Ann Oper Res"},{"key":"242_CR59","unstructured":"Focacci F, Laburthe F, Lodi A (2002) Local search and constraint programming. International Series in Operations Research and Management Science. In: Ribeiro CC, Hansen P (eds) Handbook of metaheuristics. Kluwer Academic Publishers, Norwell, MA"},{"key":"242_CR60","doi-asserted-by":"crossref","unstructured":"Fonlupt C, Robillard D, Preux P, Talbi E-G (1999) Fitness landscape and performance of metaheuristics. In: Meta-heuristics\u2014advances and trends in local search paradigms for optimization. Kluwer Academic Press, Dordrecht, pp 255\u2013266","DOI":"10.1007\/978-1-4615-5775-3_18"},{"key":"242_CR61","doi-asserted-by":"crossref","first-page":"849","DOI":"10.1287\/opre.9.6.849","volume":"9","author":"PC Gilmore","year":"1961","unstructured":"Gilmore PC, Gomory RE (1961) A linear programming approach to the cutting stock problem. Oper Res 9:849\u2013859","journal-title":"Oper Res"},{"key":"242_CR62","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1613\/jair.1","volume":"1","author":"ML Ginsberg","year":"1993","unstructured":"Ginsberg ML (1993) Dynamic backtracking. J Artif Intell Res 1:25\u201346","journal-title":"J Artif Intell Res"},{"key":"242_CR63","first-page":"9","volume":"1","author":"B Golden","year":"1998","unstructured":"Golden B, Pepper J, Vossen T (1998) Using genetic algorithms for setting parameter values in heuristic search. Intell Eng Syst Through Artif Neural Netw 1:9\u201332","journal-title":"Intell Eng Syst Through Artif Neural Netw"},{"key":"242_CR64","doi-asserted-by":"crossref","unstructured":"Gomory RE (1958) Outline of an algorithm for integer solutions to linear programs. Bull AMS 64: 275\u2013278","DOI":"10.1090\/S0002-9904-1958-10224-4"},{"key":"242_CR65","first-page":"42","volume-title":"Genetic algorithms and simulated annealing, Research Notes in Artificial Intelligence","author":"JJ Grefenstette","year":"1987","unstructured":"Grefenstette JJ (1987) Incorporating problem specific knowledge into genetic algorithms. In: Davis L (ed) Genetic algorithms and simulated annealing, Research Notes in Artificial Intelligence. Morgan Kaufmann, San Mateo, CA, pp 42\u201360"},{"issue":"4","key":"242_CR66","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1016\/S0305-0548(98)00064-1","volume":"26","author":"GM Gutin","year":"1999","unstructured":"Gutin GM (1999) Exponential neighborhood local search for the traveling salesman problem. Comput Oper Res 26(4):313\u2013320","journal-title":"Comput Oper Res"},{"key":"242_CR67","doi-asserted-by":"crossref","unstructured":"Habet D, Li CM, Devendeville L, Vasquez M (2002) A hybrid approach for SAT. In: CP\u20192003 principles and practice of constraint programming. LNCS No. 2470, Springer, Ithaca, USA, pp 172\u2013184","DOI":"10.1007\/3-540-46135-3_12"},{"issue":"4","key":"242_CR68","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1023\/A:1011336210885","volume":"7","author":"P Hansen","year":"2001","unstructured":"Hansen P, Mladenovic M, Perez-Britos D (2001) Variable neighborhood decomposition search. J Heuristics 7(4):330\u2013350","journal-title":"J Heuristics"},{"key":"242_CR69","unstructured":"Hart WE (1994) Adaptive global optimization with local search. PhD thesis, University of California, San Diego"},{"key":"242_CR70","unstructured":"Harvey WD, Ginsberg ML (1997) Limited discrepancy search. In: IJCAI international joint conference on artificial intelligence. Morgan Kaufmann, Burlington, MA, pp 607\u2013613"},{"key":"242_CR71","doi-asserted-by":"crossref","first-page":"490","DOI":"10.1057\/palgrave.jors.2601525","volume":"54","author":"KS Hindi","year":"2003","unstructured":"Hindi KS, Fleszar K, Charalambous C (2003) An effective heuristic for the CLSP with setup times. J Oper Res Soc 54:490\u2013498","journal-title":"J Oper Res Soc"},{"key":"242_CR72","unstructured":"Hogg T, Williams C (1993) Solving the really hard problems with cooperative search. In: 11th conference on artificial intelligemce AAAI\u201993. AAAI Press, Menlo Park, CA, pp 231\u2013236"},{"issue":"4","key":"242_CR73","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1023\/A:1009642825198","volume":"6","author":"T-P Hong","year":"2000","unstructured":"Hong T-P, Wang H-S, Chen W-C (2000) Simultaneous applying multiple mutation operators in genetic algorithm. J Heuristics 6(4):439\u2013455","journal-title":"J Heuristics"},{"key":"242_CR74","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1016\/0167-2789(90)90065-W","volume":"42","author":"BA Huberman","year":"1990","unstructured":"Huberman BA (1990) The performance of cooperative processes. Physica D 42:38\u201347","journal-title":"Physica D"},{"key":"242_CR75","unstructured":"Husbands P, Mill F, Warrington S (1990) Genetic algorithms, production plan optimisation and scheduling. In: Schewefel H-P, Manner R (eds) Parallel problem solving from nature, vol 496 of LNCS. Springer, Dortmund, pp 80\u201384"},{"key":"242_CR76","unstructured":"Jahuira CAR, Cuadros-Vargas E (2003) Solving the TSP by mixing GAs with minimal spanning trees. In: First international conference of the Peruvian Computer Society, Lima, Peru, pp 123\u2013132"},{"issue":"1","key":"242_CR77","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s00500-003-0328-5","volume":"9","author":"Y Jin","year":"2005","unstructured":"Jin Y (2005) A comprehensive survey of fitness approximation in evolutionary computation. Soft Comput 9(1):3\u201312","journal-title":"Soft Comput"},{"key":"242_CR78","doi-asserted-by":"crossref","unstructured":"Jin Y, Sendhoff B (2004) Reducing fitness evaluations using clustering techniques and neural network ensembles. In: Genetic and evolutionary computation GECCO\u20192004, LNCS No. 3102. Springer, Berlin, pp 688\u2013699","DOI":"10.1007\/978-3-540-24854-5_71"},{"key":"242_CR79","unstructured":"Jog P, Suh JY, Van Gucht D (1989) The effects of population size, heuristic crossover and local improvement on a genetic algorithm for the traveling salesman problem. In: 3rd international conference on genetic algorithms. Morgan Kaufmann, Burlington, MA"},{"issue":"3","key":"242_CR80","doi-asserted-by":"crossref","first-page":"620","DOI":"10.1016\/j.ejor.2007.07.035","volume":"199","author":"L Jourdan","year":"2009","unstructured":"Jourdan L, Basseur M, Talbi E-G (2009) Hybridizing exact methods and metaheuristics: a taxonomy. Eur J Oper Res 199(3):620\u2013629","journal-title":"Eur J Oper Res"},{"key":"242_CR81","unstructured":"Jourdan L, Dhaenens C, Talbi E-G (2006) Using data mining techniques to help metaheuristics: a short survey. In: Hybrid metaheuristics (HM\u20192006), vol 4030 of LNCS, Gran Canaria, Spain, pp 57\u201369"},{"key":"242_CR82","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1090\/dimacs\/020\/02","volume":"20","author":"M Juenger","year":"1995","unstructured":"Juenger M, Reinelt G, Thienel S (1995) Practical problem solving with cutting plane algorithms in combinatorial optimization. DIMACS Ser Discret Math Theor Comput Sci 20:111\u2013152","journal-title":"DIMACS Ser Discret Math Theor Comput Sci"},{"key":"242_CR83","doi-asserted-by":"crossref","unstructured":"Kamarainen O, Sakkout HE (2002) Local probing applied to scheduling. In: CP\u20192002 international conference on principles and practice of constraint programming, pp 155\u2013171","DOI":"10.1007\/3-540-46135-3_11"},{"key":"242_CR84","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1287\/moor.2.3.209","volume":"2","author":"RM Karp","year":"1977","unstructured":"Karp RM (1977) Probabilistic analysis of partitioning algorithms for the traveling salesman problem in the plane. Math Oper Res 2:209\u2013224","journal-title":"Math Oper Res"},{"key":"242_CR85","unstructured":"Kim H, Hayashi Y, Nara K (1995) The performance of hybridized algorithm of genetic algorithm simulated annealing and tabu search for thermal unit maintenance scheduling. In: 2nd IEEE conference on evolutionary computation ICEC\u201995, Perth, Australia, pp 114\u2013119"},{"key":"242_CR86","unstructured":"Kim H-S, Cho S-B (2001) An efficient genetic algorithm with less fitness evaluation by clustering. In: Congress on evolutionary computation CEC\u201901. IEEE Press, New York, pp 887\u2013894"},{"key":"242_CR87","doi-asserted-by":"crossref","unstructured":"Kostikas K, Fragakis C (2004) Genetic programming applied to mixed integer programming. In: Keijzer M et al. (eds) EuroGP conference on genetic programming. LNCS vol 3003, Springer, Berlin, pp 113\u2013124","DOI":"10.1007\/978-3-540-24650-3_11"},{"key":"242_CR88","unstructured":"Koza J, Andre D (1995) Parallel genetic programming on a network of transputers. Technical report CS-TR-95-1542, Stanford University"},{"key":"242_CR89","unstructured":"Krueger M (1993) M\u00e9thodes d\u2019analyse d\u2019algorithmes d\u2019optimisation stochastiques \u00e0 l\u2019aide d\u2019algorithmes g\u00e9n\u00e9tiques. PhD thesis, Ecole Nationale Sup\u00e8rieure des T\u00e9l\u00e9communications, Paris, France"},{"key":"242_CR90","doi-asserted-by":"crossref","unstructured":"Levine D (1994) A parallel genetic algorithm for the set partitioning problem. PhD thesis, Argonne National Laboratory, Illinois Institute of Technology, Argonne, USA","DOI":"10.2172\/10161119"},{"key":"242_CR91","unstructured":"Lin FT, Kao CY, Hsu CC (1991) Incorporating genetic algorithms into simulated annealing. In: Proceedings of the fourth international symposium on AI, pp 290\u2013297"},{"key":"242_CR92","doi-asserted-by":"crossref","unstructured":"Louis SJ (2003) Genetic learning from experiences. In: Congress on evolutionary computations CEC\u20192003, Australia, pp 2118\u20132125","DOI":"10.1109\/CEC.2003.1299934"},{"key":"242_CR93","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1016\/0377-2217(95)00012-F","volume":"83","author":"HR Lourenco","year":"1995","unstructured":"Lourenco HR (1995) Job-shop scheduling: computational study of local search and large-step optimization methods. Eur J Oper Res 83:347\u2013367","journal-title":"Eur J Oper Res"},{"key":"242_CR94","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0167-8191(94)00071-H","volume":"21","author":"SW Mahfoud","year":"1995","unstructured":"Mahfoud SW, Goldberg DE (1995) Parallel recombinative simulated annealing: a genetic algorithm. Parallel Comput 21:1\u201328","journal-title":"Parallel Comput"},{"issue":"4","key":"242_CR95","doi-asserted-by":"crossref","first-page":"358","DOI":"10.1287\/ijoc.11.4.358","volume":"11","author":"V Maniezzo","year":"1999","unstructured":"Maniezzo V (1999) Exact and approximate nondeterministic tree-search procedures for the quadratic assignment problem. INFORMS J Comput 11(4):358\u2013369","journal-title":"INFORMS J Comput"},{"key":"242_CR96","unstructured":"Mariano CE, Morales E (1998) A multiple objective ant-q algorithm for the design of water distribution irrigation networks. In: First international workshop on ant colony optimization ANTS\u201998, Brussels, Belgium"},{"key":"242_CR97","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/0167-6377(92)90028-2","volume":"11","author":"OC Martin","year":"1992","unstructured":"Martin OC, Otto SW, Felten EW (1992) Large-step markov chains for the TSP: incorporating local search heuristics. Oper Res Lett 11:219\u2013224","journal-title":"Oper Res Lett"},{"key":"242_CR98","unstructured":"Mautor T, Michelon P (1997) Mimausa: a new hybrid method combining exact solution and local search. In: Second international conference on metaheuristics, Sophia-Antipolis, France"},{"issue":"1","key":"242_CR99","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1023\/A:1007677805582","volume":"38","author":"RS Michalski","year":"2000","unstructured":"Michalski RS (2000) Learnable evolution model: evolutionary processes guided by machine learning. Mach Learn 38(1):9\u201340","journal-title":"Mach Learn"},{"issue":"1","key":"242_CR100","first-page":"13","volume":"7","author":"M Minsky","year":"1994","unstructured":"Minsky M (1994) Negative expertise. Int J Expert Syst 7(1):13\u201319","journal-title":"Int J Expert Syst"},{"key":"242_CR101","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1007\/BF02125405","volume":"63","author":"A Nagar","year":"1995","unstructured":"Nagar A, Heragu SS, Haddock J (1995) A metaheuristic algorithm for a bi-criteria scheduling problem. Ann Oper Res 63:397\u2013414","journal-title":"Ann Oper Res"},{"key":"242_CR102","unstructured":"Narayek A, Smith S, Ohler C (2003) Integrating local search advice into a refinment search solver (or not). In: CP\u201903 Workshop on cooperative constraint problem solvers, pp 29\u201343"},{"key":"242_CR103","volume-title":"Integer and combinatorial optimization","author":"G Nemhauser","year":"1999","unstructured":"Nemhauser G, Wolsey L (1999) Integer and combinatorial optimization. Wiley, New York"},{"key":"242_CR104","doi-asserted-by":"crossref","unstructured":"Nissen V (Jan 1994) Solving the quadratic assignment problem with clues from nature. IEEE Trans Neural Netw 5(1):66\u201372","DOI":"10.1109\/72.265961"},{"key":"242_CR105","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1023\/A:1009687210594","volume":"3","author":"W Nuijten","year":"1998","unstructured":"Nuijten W, Le Pape C (1998) Constraint based job scheduling with ILOG scheduler. J Heuristics 3:271\u2013286","journal-title":"J Heuristics"},{"key":"242_CR106","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1016\/j.ejor.2002.12.002","volume":"164","author":"V Nwana","year":"2005","unstructured":"Nwana V, Darby-Dowman K, Mitra G (2005) A cooperative parallel heuristic for mixed zero-one linear programming. Eur J Oper Res 164:12\u201323","journal-title":"Eur J Oper Res"},{"key":"242_CR107","doi-asserted-by":"crossref","unstructured":"O\u2019Reilly U-M, Oppacher F (1995) Hybridized crossover-based techniques for program discovery. In: IEEE international conference on evolutionary computation ICEC\u201995, Perth, Australia, pp 573\u2013578","DOI":"10.1109\/ICEC.1995.487447"},{"key":"242_CR108","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1023\/A:1009629727566","volume":"5","author":"R Patterson","year":"1999","unstructured":"Patterson R, Rolland E, Pirkul H (1999) A memory adaptive reasoning technique for solving the capacitated minimum spanning tree problem. J Heuristics 5:159\u2013180","journal-title":"J Heuristics"},{"key":"242_CR109","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1023\/A:1009694016861","volume":"5","author":"G Pesant","year":"1999","unstructured":"Pesant G, Gendreau M (1999) A view of local search in constraint programming. J Heuristics 5:255\u2013279","journal-title":"J Heuristics"},{"key":"242_CR110","unstructured":"Potts CN, Velde SL (1995) Dynasearch\u2014iterative local improvement by dynamic programming. Technical Report TR, University of Twente, Netherlands"},{"key":"242_CR111","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1023\/A:1021140902684","volume":"115","author":"S Prestwich","year":"2002","unstructured":"Prestwich S (2002) Combining the scalability of local search with the pruning techniques of systematic search. Ann Oper Res 115:51\u201372","journal-title":"Ann Oper Res"},{"key":"242_CR112","doi-asserted-by":"crossref","unstructured":"Puchinger J. Raidl GR (2005) Combining metaheuristics and exact algorithms in combinatorial optimization: a survey and classification. In: Artificial intelligence and knowledge engineering applications: a bioinspired approach. LNCS vol 3562, Springer, Berlin, pp 41\u201353","DOI":"10.1007\/11499305_5"},{"key":"242_CR113","unstructured":"Ramsey CL, Grefenstette JJ (1993) Case-based initialization of genetic algorithms. In: Fifth international conference on genetic algorithms, pp 84\u201391"},{"key":"242_CR114","unstructured":"Rasheed K, Vattam S, Ni X (2002) Comparison of methods for developing dynamic reduced models for design optimization. In: CEC\u20192002 congress on evolutionary computation, pp 390\u2013395"},{"issue":"8","key":"242_CR115","doi-asserted-by":"crossref","first-page":"753","DOI":"10.1080\/01969720500306147","volume":"36","author":"RG Reynolds","year":"2005","unstructured":"Reynolds RG, Michalewicz Z, Peng B (2005) Cultural algorithms: computational modeling of how cultures learn to solve problems\u2014an engineering example. Cybern Syst 36(8):753\u2013771","journal-title":"Cybern Syst"},{"issue":"1","key":"242_CR116","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/s10852-005-9030-1","volume":"5","author":"M Ribeiro","year":"2006","unstructured":"Ribeiro M, Plastino A, Martins S (2006) Hybridization of GRASP metaheuristic with data mining techniques. J Math Modell Algorithms 5(1):23\u201341","journal-title":"J Math Modell Algorithms"},{"issue":"1","key":"242_CR117","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/S0377-2217(96)00100-2","volume":"97","author":"KE Rosing","year":"1997","unstructured":"Rosing KE, ReVelle CS (1997) Heuristic concentration: two stage solution construction. Eur J Oper Res 97(1):75\u201386","journal-title":"Eur J Oper Res"},{"key":"242_CR118","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1038\/323533a0","volume":"323","author":"DE Rumelhart","year":"1986","unstructured":"Rumelhart DE, Hinton GE, Williams RJ (1986) Learning representations by backpropagating errors. Nature 323:533\u2013536","journal-title":"Nature"},{"key":"242_CR119","unstructured":"Salami M, Cain G (1996) Genetic algorithm processor on reprogrammable architectures. In: Fifth annual conference on evolutionary programming EP\u201996. MIT Press, San Diego, CA"},{"key":"242_CR120","unstructured":"Sebag M, Schoenauer M, Ravise C (1997) Toward civilized evolution: developing inhibitions. In: B\u00e4ck T (eds) Seventh international conference on genetic algorithms, pp 291\u2013298"},{"key":"242_CR121","doi-asserted-by":"crossref","unstructured":"Sefraoui M, Periaux J (2000) A hierarchical genetic algorithm using multiple models for optimization. In: Parallel problem solving from nature PPSN\u20192000, LNCS No.1917. Springer, Berlin, pp 879\u2013888","DOI":"10.1007\/3-540-45356-3_86"},{"key":"242_CR122","unstructured":"Sellmann M, Ans\u00f3tegui C (2006) Disco-novo-gogo: integrating local search and complete search with restarts. In: The twenty-first national conference on artificial intelligence and the eighteenth innovative applications of artificial intelligence conference, Boston, USA"},{"issue":"5","key":"242_CR123","doi-asserted-by":"crossref","first-page":"500","DOI":"10.1109\/43.55180","volume":"9","author":"K Shahookar","year":"1990","unstructured":"Shahookar K, Mazumder P (1990) A genetic approach to standard cell placement using meta-genetic parameter optimization. IEEE Trans Comput Aided Design 9(5):500\u2013511","journal-title":"IEEE Trans Comput Aided Design"},{"key":"242_CR124","doi-asserted-by":"crossref","unstructured":"Shaw P (1998) Using constraint programming and local search methods to solve vehicle routing problems. In: Maher M, Puget J-F (eds) CP\u201998 principle and practice of constraint programming, LNCS No. 1520, pp 417\u2013431","DOI":"10.1007\/3-540-49481-2_30"},{"key":"242_CR125","doi-asserted-by":"crossref","unstructured":"Sprave J (1999) A unified model of non-panmictic population structures in evolutionary algorithms. In: Proceedings of the 1999 congress on evolutionary computation, vol 2. IEEE Press, Piscataway, NJ, pp 1384\u20131391","DOI":"10.1109\/CEC.1999.782644"},{"key":"242_CR126","unstructured":"Stutzle T, Hoos HH (1997) The MAX-MIN ant system and local search for combinatorial optimization problems: towards adaptive tools for global optimization. In: 2nd international conference on metaheuristics. INRIA, Sophia Antipolis, France, pp 191\u2013193"},{"key":"242_CR127","unstructured":"Suh JY, Van Gucht D (1987) Incorporating heuristic information into genetic search. In: 2nd international conference on genetic algorithms. Lawrence Erlbaum Associates, USA, pp 100\u2013107"},{"key":"242_CR128","doi-asserted-by":"crossref","first-page":"661","DOI":"10.1002\/net.3230230804","volume":"23","author":"E Taillard","year":"1993","unstructured":"Taillard E (1993) Parallel iterative search methods for vehicle routing problem. Networks 23:661\u2013673","journal-title":"Networks"},{"issue":"1","key":"242_CR129","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1023\/A:1021841728075","volume":"9","author":"E Taillard","year":"2003","unstructured":"Taillard E (2003) Heuristic methods for large centroid clustering problems. J Heuristics 9(1):51\u201374","journal-title":"J Heuristics"},{"key":"242_CR130","doi-asserted-by":"crossref","unstructured":"Taillard E, Voss S (2002) POPMUSIC: partial optimization metaheuristic under special intensification conditions. In: Essays and surveys in metaheuristics. Kluwer Academic Publishers, Dordrecht, pp 613\u2013629","DOI":"10.1007\/978-1-4615-1507-4_27"},{"key":"242_CR131","unstructured":"Taillard ED, Gambardella L (1997) Adaptive memories for the quadratic assignment problem. Technical Report 87\u201397, IDSIA, Lugano, Switzerland"},{"issue":"1","key":"242_CR132","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0377-2217(00)00268-X","volume":"135","author":"ED Taillard","year":"2001","unstructured":"Taillard ED, Gambardella LM, Gendreau M, Potvin J-Y (2001) Adaptive memory programming: a unified view of metaheuristics. Eur J Oper Res 135(1):1\u201316","journal-title":"Eur J Oper Res"},{"key":"242_CR133","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1023\/A:1016540724870","volume":"8","author":"E-G Talbi","year":"2002","unstructured":"Talbi E-G (2002) A taxonomy of hybrid metaheuristics. J Heuristics 8:541\u2013564","journal-title":"J Heuristics"},{"key":"242_CR134","doi-asserted-by":"crossref","DOI":"10.1002\/9780470496916","volume-title":"Metaheuristics: from design to implementation","author":"E-G Talbi","year":"2009","unstructured":"Talbi E-G (2009) Metaheuristics: from design to implementation. Wiley, New York"},{"issue":"2","key":"242_CR135","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/s10852-005-9029-7","volume":"5","author":"E-G Talbi","year":"2006","unstructured":"Talbi E-G, Bachelet V (2006) COSEARCH: a parallel cooperative metaheuristic. J Math Modell Algorithms 5(2):5\u201322","journal-title":"J Math Modell Algorithms"},{"key":"242_CR136","unstructured":"Talbi E-G, Fonlupt C, Preux P, Robillard D (1998) Paysages de probl\u00e8mes d\u2019optimisation et performances des m\u00e9ta-heuristiques. In: Premier Congr\u00e9s de la Soci\u00e9t\u00e9 Francaise de Recherche Op\u00e9rationnelle et Aide \u00e0 la D\u00e9cision ROAD, Paris, France"},{"key":"242_CR137","unstructured":"Talbi EG, Muntean T, Samarandache I (1994) Hybridation des algorithmes g\u00e9n\u00e9tiques avec la recherche tabou. In: Evolution Artificielle EA94, Toulouse, France"},{"issue":"4","key":"242_CR138","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1023\/A:1009669824615","volume":"4","author":"S Talukdar","year":"1998","unstructured":"Talukdar S, Baerentzen L, De Gove A, Souza P (1998) Asynchronous teams: cooperation schemes for autonomous agents. J Heuristics 4(4):295\u2013321","journal-title":"J Heuristics"},{"key":"242_CR139","doi-asserted-by":"crossref","first-page":"329","DOI":"10.9746\/sicetr1965.30.329","volume":"130","author":"H Tamura","year":"1994","unstructured":"Tamura H, Hirahara A, Hatono I, Umano M (1994) An approximate solution method for combinatorial optimization\u2014hybrid approach of genetic algorithm and lagrangean relaxation method. Trans Soc Instrum Control Eng 130:329\u2013336","journal-title":"Trans Soc Instrum Control Eng"},{"key":"242_CR140","unstructured":"Tanese R (1987) Parallel genetic algorithms for a hypercube. In: Proceedings of the second international conference on genetic algorithms. MIT, Cambridge, MA, pp 177\u2013183"},{"issue":"4","key":"242_CR141","first-page":"226","volume":"32","author":"J Thiel","year":"1994","unstructured":"Thiel J, Voss S (1994) Some experiences on solving multiconstraint zero-one knapsack problems with genetic algorithms. INFOR 32(4):226\u2013242","journal-title":"INFOR"},{"key":"242_CR142","first-page":"501","volume-title":"Meta-heuristics: theory and applications","author":"M Toulouse","year":"1996","unstructured":"Toulouse M, Crainic T, Gendreau M (1996) Communication issues in designing cooperative multi-thread parallel searches. In: Osman IH, Kelly JP (eds) Meta-heuristics: theory and applications. Kluwer Academic Publishers, Dordrecht, pp 501\u2013522"},{"issue":"2","key":"242_CR143","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1162\/evco.1998.6.2.161","volume":"6","author":"A Tuson","year":"1998","unstructured":"Tuson A, Ross P (1998) Adapting operator settings in genetic algorithms. Evol Comput 6(2):161\u2013184","journal-title":"Evol Comput"},{"key":"242_CR144","unstructured":"Ulder NLJ, Aarts EHL, Bandelt H-J, Van Laarhoven PJM, Pesch E (1990) Genetic local search algorithms for the traveling salesman problem. In: Schewefel H-P, Manner R (eds) Parallel problem solving from nature, vol 496 of LNCS. Springer-Verlag, Dortmund, pp 109\u2013116"},{"key":"242_CR145","unstructured":"Vasquez M, Hao J-K (2001) A hybrid approach for the 0\u20131 multidimensional knapsack problem. In: Proceedings of the international joint conference on artificial intelligence IJCAI, pp 328\u2013333"},{"issue":"1","key":"242_CR146","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/BF02430365","volume":"1","author":"MGA Verhoeven","year":"1995","unstructured":"Verhoeven MGA, Aarts EHL (1995) Parallel local search. J Heuristics 1(1):43\u201365","journal-title":"J Heuristics"},{"key":"242_CR147","unstructured":"Voigt H-M, Born J, Santibanez-Koref I (1990) Modelling and simulation of distributed evolutionary search processes for function optimization. In: Schwefel H-P, Manner R (eds) Parallel problem solving from nature, vol 496 of LNCS. Springer, Dortmund, pp 373\u2013380"},{"key":"242_CR148","unstructured":"Voss S (1993) Tabu search: applications and prospects. In: Du DZ, Pardalos PM (eds) Network optimization problems. World Scientific, USA, pp 333\u2013353"},{"key":"242_CR149","unstructured":"Wang L-H, Kao C-Y, Ouh-young M, Chen W-C (1995) Molecular binding: a case study of the population-based annealing genetic algorithms. In: IEEE international conference on evolutionary computation ICEC\u201995, Perth, Australia, pp 50\u201355"},{"key":"242_CR150","doi-asserted-by":"crossref","unstructured":"Yagiura M, Ibaraki T (1996) Metaheuristics as robust and simple optimization tools. In: IEEE international conference on evolutionary computation, ICEC\u201996, pp 541\u2013546","DOI":"10.1109\/ICEC.1996.542657"}],"container-title":["4OR"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-013-0242-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10288-013-0242-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-013-0242-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,1]],"date-time":"2022-03-01T05:21:27Z","timestamp":1646112087000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10288-013-0242-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,7]]},"references-count":150,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,7]]}},"alternative-id":["242"],"URL":"https:\/\/doi.org\/10.1007\/s10288-013-0242-3","relation":{},"ISSN":["1619-4500","1614-2411"],"issn-type":[{"value":"1619-4500","type":"print"},{"value":"1614-2411","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,7]]}}}