{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T15:16:12Z","timestamp":1775229372169,"version":"3.50.1"},"reference-count":151,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,10,16]],"date-time":"2015-10-16T00:00:00Z","timestamp":1444953600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2016,5]]},"DOI":"10.1007\/s10479-015-2034-y","type":"journal-article","created":{"date-parts":[[2015,10,16]],"date-time":"2015-10-16T09:01:14Z","timestamp":1444986074000},"page":"171-215","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":118,"title":["Combining metaheuristics with mathematical programming, constraint programming and machine learning"],"prefix":"10.1007","volume":"240","author":[{"given":"El-Ghazali","family":"Talbi","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,10,16]]},"reference":[{"key":"2034_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, pp. 668\u2013671, Perth, Australia.","DOI":"10.1109\/ICEC.1995.487464"},{"key":"2034_CR2","unstructured":"Abramson, D., Logothetis, P., Postula, A., & Randall, M. (1997). Application specific computers for combinatorial optimisation. InAustralien Computer Architecture Workshop, Sydney, Australia."},{"key":"2034_CR3","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1109\/2.144393","volume":"25","author":"DA Abramson","year":"1992","unstructured":"Abramson, D. A. (1992). A very high speed architecture to support simulated annealing. IEEE Computer, 25, 27\u201334.","journal-title":"IEEE Computer"},{"key":"2034_CR4","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1287\/opre.45.2.226","volume":"45","author":"CC Aggarwal","year":"1997","unstructured":"Aggarwal, C. C., Orlin, J. B., & Tai, R. P. (1997). An optimized crossover for the maximum independent set. Operations Research, 45, 226\u2013234.","journal-title":"Operations Research"},{"key":"2034_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, R. M., Binato, S., & Ramakrishna, R. S. (2003). Parallel GRASP with path relinking for job shop scheduling. Parallel Computing, 29, 393\u2013430.","journal-title":"Parallel Computing"},{"key":"2034_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 Journal on Computing, 3, 149\u2013156.","journal-title":"ORSA Journal on Computing"},{"key":"2034_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: Cambridge University Press."},{"issue":"2","key":"2034_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, J. M., Benavent, E., Corberan, A., & Naddef, D. (1998). Separating capacity constraints in the CVRP using tabu search. European Journal of Operational Research, 106(2), 546\u2013557.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"2034_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. Journal of Heuristics, 4(2), 107\u2013122.","journal-title":"Journal of Heuristics"},{"key":"2034_CR10","doi-asserted-by":"crossref","unstructured":"Barnhart, C., Johnson, E. L., Nemhauser, G. L., Savelsbergh, M. W. P., & Vance, P. H. (1998). Branch-and-price: Column generation for huge integer programs. Operations Research, 46(3), 316\u2013329.","DOI":"10.1287\/opre.46.3.316"},{"issue":"11","key":"2034_CR11","doi-asserted-by":"crossref","first-page":"1069","DOI":"10.1057\/jors.1990.166","volume":"41","author":"JE Beasley","year":"1990","unstructured":"Beasley, J. E. (1990). OR-Library: Distributing test problems by electronic mail. Journal of the Operational Research Society, 41(11), 1069\u20131072.","journal-title":"Journal of the Operational Research Society"},{"key":"2034_CR12","volume-title":"Sixth international conference on genetic algorithms","author":"T Belding","year":"1995","unstructured":"Belding, T. (1995). The distributed genetic algorithm revisted. In D. Eshelmann (Ed.), Sixth international conference on genetic algorithms. San Mateo, CA: Morgan Kaufmann."},{"key":"2034_CR13","first-page":"511","volume-title":"Second conference on artificial life","author":"RK Belew","year":"1991","unstructured":"Belew, R. K., McInerny, J., & Schraudolph, N. N. (1991). Evolving networks: Using genetic algorithms with connectionist learning. In C. G. Langton, C. Taylor, J. D. Doyne Farmer, & S. Rasmussen (Eds.), Second conference on artificial life (pp. 511\u2013548). USA: Addison-Wesley."},{"key":"2034_CR14","volume-title":"Dynamic programming","author":"R Bellman","year":"1957","unstructured":"Bellman, R. (1957). Dynamic programming. Princeton, NJ: Princeton University Press."},{"key":"2034_CR15","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1007\/BF01386316","volume":"4","author":"JF Benders","year":"1962","unstructured":"Benders, J. F. (1962). Partitioning procedures for solving mixed-variables programming problems. Numerische Mathematik, 4, 238\u2013252.","journal-title":"Numerische Mathematik"},{"key":"2034_CR16","volume-title":"Network optimization: Continuous and discrete models","author":"DP Bertsekas","year":"1998","unstructured":"Bertsekas, D. P. (1998). Network optimization: Continuous and discrete models. MA: Athena Scientific."},{"key":"2034_CR17","unstructured":"Boese, K. D. (1996). Models for iterative global optimization. Ph.D. thesis, University of California, Los Angeles."},{"issue":"2","key":"2034_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, K. D., Kahng, A. B., & Muddu, S. (1994). New adaptive multi-start techniques for combinatorial global optimizations. Operations Research Letters, 16(2), 101\u2013113.","journal-title":"Operations Research Letters"},{"key":"2034_CR19","first-page":"129","volume-title":"Parallel problem solving from nature, volume 496 of LNCS","author":"H Braun","year":"1990","unstructured":"Braun, H. (1990). On solving traveling salesman problems by genetic algorithms. In H.-P. Schwefel & R. Manner (Eds.), Parallel problem solving from nature, volume 496 of LNCS (pp. 129\u2013133). Dortmund: Springer."},{"key":"2034_CR20","unstructured":"Burke, E. K., Cowling, P. I., & Keuthen, R. (2001). Effective local and guided variable neighborhood search methods for the asymmetric traveling salesman problem. In EvoWorkshop (pp. 203\u2013312). LNCS 2037. Springer."},{"key":"2034_CR21","volume-title":"Handbook of metaheuristics, chapter hyper-heuristics: An emerging direction in modern search technology","author":"EK Burke","year":"2003","unstructured":"Burke, E. K., Kendall, G., Newall, J., Hart, E., Ross, P., & Schulemburg, S. (2003). Handbook of metaheuristics, chapter hyper-heuristics: An emerging direction in modern search technology. Dordrecht: Kluwer."},{"key":"2034_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":"2034_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. Journal of Heuristics, 5, 281\u2013303.","journal-title":"Journal of Heuristics"},{"key":"2034_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. Lecture Notes in Computer Science, 2175, 369\u2013390.","journal-title":"Lecture Notes in Computer Science"},{"key":"2034_CR25","unstructured":"Chabrier, A., Danna, E., & Le Pape, C. (2002). 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":"2034_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. European Journal of Operational Research, 161(3), 636\u2013654.","journal-title":"European Journal of Operational Research"},{"key":"2034_CR27","doi-asserted-by":"crossref","first-page":"428","DOI":"10.1007\/3-540-58484-6_286","volume-title":"Third conference on parallel problem solving from nature","author":"H Chen","year":"1994","unstructured":"Chen, H., & Flann, N. S. (1994). Parallel simulated annealing and genetic algorithms: A space of hybrid methods. In Y. Davidor, H.-P. Schwefel, & R. Manner (Eds.), Third conference on parallel problem solving from nature (pp. 428\u2013436). Jerusalem: Springer."},{"key":"2034_CR28","unstructured":"Chu, P. C. (1997). A genetic algorithm approach for combinatorial optimization problems. Ph.D. thesis, University of London, London, UK."},{"issue":"3","key":"2034_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. Mathematics of Operations Research, 4(3), 233\u2013235.","journal-title":"Mathematics of Operations Research"},{"key":"2034_CR30","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1142\/9789812812438_0003","volume-title":"Computation: The micro and the macro view","author":"SH Clearwater","year":"1992","unstructured":"Clearwater, S. H., Hogg, T., & Huberman, B. A. (1992). Cooperative problem solving. In B. A. Huberman (Ed.), Computation: The micro and the macro view (pp. 33\u201370). Singapore: World Scientific."},{"key":"2034_CR31","doi-asserted-by":"crossref","first-page":"1181","DOI":"10.1126\/science.254.5035.1181","volume":"254","author":"SH Clearwater","year":"1991","unstructured":"Clearwater, S. H., Huberman, B. A., & Hogg, T. (1991). Cooperative solution of constraint satisfaction problems. Science, 254, 1181\u20131183.","journal-title":"Science"},{"key":"2034_CR32","first-page":"148","volume-title":"Second international conference on genetic algorithms","author":"J Cohoon","year":"1987","unstructured":"Cohoon, J., Hedge, S., Martin, W., & Richards, D. (1987). Punctuated equilibria: A parallel genetic algorithm. In J. J. Grefenstette (Ed.), Second international conference on genetic algorithms (pp. 148\u2013154). Cambridge, MA: MIT."},{"key":"2034_CR33","first-page":"134","volume-title":"Parallel problem solving from nature, volume 496 of LNCS","author":"JP Cohoon","year":"1990","unstructured":"Cohoon, J. P., Martin, W. N., & Richards, D. S. (1990). Genetic algorithms and punctuated equilibria. In H.-P. Schwefel & R. Manner (Eds.), Parallel problem solving from nature, volume 496 of LNCS (pp. 134\u2013141). Dortmund: Springer."},{"key":"2034_CR34","first-page":"244","volume-title":"Fourth international conference on genetic algorithms","author":"JP Cohoon","year":"1991","unstructured":"Cohoon, J. P., Martin, W. N., & Richards, D. S. (1991). A multi-population genetic algorithm for solving the k-partition problem on hypercubes. In R. K. Belew & L. B. Booker (Eds.), Fourth international conference on genetic algorithms (pp. 244\u2013248). San Mateo, CA: Morgan Kaufmann."},{"issue":"3","key":"2034_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 Journal on Computing, 15(3), 233\u2013248.","journal-title":"INFORMS Journal on Computing"},{"key":"2034_CR36","unstructured":"Crainic, T. G., Nguyen, A. T., & Gendreau, M. (1997). Cooperative multi-thread parallel tabu search with evolutionary adaptive memory. In 2nd International conference on metaheuristics. Sophia Antipolis, France."},{"key":"2034_CR37","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/BF01719254","volume":"17","author":"TG Crainic","year":"1995","unstructured":"Crainic, T. G., Toulouse, M., & Gendreau, M. (1995). Synchronous tabu search parallelization strategies for multi-commodity location\u2013allocation with balancing requirements. OR Spektrum, 17, 113\u2013123.","journal-title":"OR Spektrum"},{"key":"2034_CR38","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1007\/0-306-48056-5_17","volume-title":"Handbook of metaheuristics","author":"TG Crainic","year":"2003","unstructured":"Crainic, T. G., & Toulouse, M. (2003). Parallel strategies for metaheuristics. In F. W. Glover & G. A. Kochenberger (Eds.), Handbook of metaheuristics (pp. 475\u2013513). New York: Springer."},{"key":"2034_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, April 1997."},{"key":"2034_CR40","unstructured":"Dalboni, F. L., Ochi, L. S., & Drummond, L. M. D. (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, Oct 2003."},{"key":"2034_CR41","unstructured":"Davis, L. (1985). Job-shop scheduling with genetic algorithms. In J. J. Grefenstette (Ed.), International conference on genetic algorithms and their applications (pp. 136\u2013140). Pittsburgh."},{"issue":"3","key":"2034_CR42","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":"2034_CR43","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":"2034_CR44","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":"2034_CR45","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1016\/S0377-2217(97)00281-6","volume":"106","author":"KA Dowsland","year":"1998","unstructured":"Dowsland, K. A. (1998). Nurse scheduling with tabu search and strategic oscillation. European Journal of Operational Research, 106, 393\u2013407.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"2034_CR46","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1016\/j.ejor.2004.04.030","volume":"168","author":"KA Dowsland","year":"2006","unstructured":"Dowsland, K. A., Herbert, E. A., & Kendall, G. (2006). Using tree search bounds to enhance a genetic algorithm approach to two rectangle packing problems. European Journal of Operational Research, 168(2), 390\u2013402.","journal-title":"European Journal of Operational Research"},{"key":"2034_CR47","doi-asserted-by":"crossref","first-page":"825","DOI":"10.1057\/palgrave.jors.2600970","volume":"51","author":"KA Dowsland","year":"2000","unstructured":"Dowsland, K. A., & Thomson, J. M. (2000). Solving a nurse scheduling problem with knapsacks, networks and tabu search. Journal of Operational Research Society, 51, 825\u2013833.","journal-title":"Journal of Operational Research Society"},{"key":"2034_CR48","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 (pp. 121\u2013136). Devon: Springer.","DOI":"10.1007\/978-1-4471-1589-2_10"},{"key":"2034_CR49","volume-title":"Blackboard systems","author":"RS Engelmore","year":"1988","unstructured":"Engelmore, R. S., & Morgan, A. (1988). Blackboard systems. Reading: Addison-Wesley."},{"key":"2034_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. Naval Research Logistics, 46, 463\u2013486.","journal-title":"Naval Research Logistics"},{"key":"2034_CR51","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF01096763","volume":"6","author":"TA Feo","year":"1995","unstructured":"Feo, T. A., & Resende, M. G. C. (1995). Greedy randomized adaptive search procedures. Journal of Global Optimization, 6, 109\u2013133.","journal-title":"Journal of Global Optimization"},{"key":"2034_CR52","doi-asserted-by":"crossref","first-page":"860","DOI":"10.1287\/opre.42.5.860","volume":"42","author":"TA Feo","year":"1994","unstructured":"Feo, T. A., Resende, M. G. C., & Smith, S. H. (1994). A greedy randomized adaptive search procedure for maximum independent set. Operations Research, 42, 860\u2013878.","journal-title":"Operations Research"},{"key":"2034_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, T. A., Venkatraman, K., & Bard, J. F. (1991). A GRASP for a difficult single machine scheduling problem. Computers and Operations Research, 18, 635\u2013643.","journal-title":"Computers and Operations Research"},{"key":"2034_CR54","unstructured":"Filho, G. R., & Lorena, L. A. N. (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":"2034_CR55","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/s10107-003-0395-5","volume":"98","author":"M Fischetti","year":"2003","unstructured":"Fischetti, M., & Lodi, A. (2003). Local branching. Mathematical Programming B, 98, 23\u201347.","journal-title":"Mathematical Programming B"},{"key":"2034_CR56","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1287\/inte.15.2.10","volume":"15","author":"ML Fisher","year":"1985","unstructured":"Fisher, M. L. (1985). An application oriented guide to lagrangian relaxation. Interfaces, 15, 399\u2013404.","journal-title":"Interfaces"},{"key":"2034_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, J. A. (1994). Genetic hybrids for the quadratic assignment problem. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 16, 173\u2013188.","journal-title":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science"},{"issue":"3","key":"2034_CR58","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1007\/BF02125407","volume":"63","author":"C Fleurent","year":"1996","unstructured":"Fleurent, C., & Ferland, J. A. (1996). Genetic and hybrid algorithms for graph coloring. Annals of Operations Research, 63(3), 437\u2013461.","journal-title":"Annals of Operations Research"},{"key":"2034_CR59","volume-title":"Handbook of metaheuristics, chapter Local search and constraint programming. International series in operations research and management science","author":"F Focacci","year":"2002","unstructured":"Focacci, F., Laburthe, F., & Lodi, A. (2002). Handbook of metaheuristics, chapter Local search and constraint programming. International series in operations research and management science. Norwell, MA: Kluwer."},{"key":"2034_CR60","volume-title":"Meta-heuristics\u2014advances and trends in local search paradigms for optimization, chapter Fitness landscape and performance of metaheuristics","author":"C Fonlupt","year":"1999","unstructured":"Fonlupt, C., Robillard, D., Preux, P., & Talbi, E.-G. (1999). Meta-heuristics\u2014advances and trends in local search paradigms for optimization, chapter Fitness landscape and performance of metaheuristics. Dordrecht: Kluwer."},{"key":"2034_CR61","doi-asserted-by":"crossref","first-page":"849","DOI":"10.1287\/opre.9.6.849","volume":"9","author":"PC Gilmore","year":"1961","unstructured":"Gilmore, P. C., & Gomory, R. E. (1961). A linear programming approach to the cutting stock problem. Operations Research, 9, 849\u2013859.","journal-title":"Operations Research"},{"key":"2034_CR62","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1613\/jair.1","volume":"1","author":"ML Ginsberg","year":"1993","unstructured":"Ginsberg, M. L. (1993). Dynamic backtracking. Journal of Artificial Intelligence Research, 1, 25\u201346.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"2034_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. Intelligent Engineering Systems Through Artificial Neural Networks, 1, 9\u201332.","journal-title":"Intelligent Engineering Systems Through Artificial Neural Networks"},{"key":"2034_CR64","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1090\/S0002-9904-1958-10224-4","volume":"64","author":"RE Gomory","year":"1958","unstructured":"Gomory, R. E. (1958). Outline of an algorithm for integer solutions to linear programs. Bulletin AMS, 64, 275\u2013278.","journal-title":"Bulletin AMS"},{"key":"2034_CR65","first-page":"42","volume-title":"Genetic algorithms and simulated annealing, research notes in artificial intelligence","author":"JJ Grefenstette","year":"1987","unstructured":"Grefenstette, J. J. (1987). Incorporating problem specific knowledge into genetic algorithms. In L. Davis (Ed.), Genetic algorithms and simulated annealing, research notes in artificial intelligence (pp. 42\u201360). San Mateo, CA: Morgan Kaufmann."},{"issue":"4","key":"2034_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, G. M. (1999). Exponential neighborhood local search for the traveling salesman problem. Computers and Operations Research, 26(4), 313\u2013320.","journal-title":"Computers and Operations Research"},{"key":"2034_CR67","doi-asserted-by":"crossref","unstructured":"Habet, D., Li, C. M., Devendeville, L., & Vasquez, M. (2002). A hybrid approach for SAT. In CP\u20192003 principles and practice of constraint programming, LNCS No. 2470 (pp. 172\u2013184). Ithaca: Springer.","DOI":"10.1007\/3-540-46135-3_12"},{"issue":"4","key":"2034_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. Journal of Heuristics, 7(4), 330\u2013350.","journal-title":"Journal of Heuristics"},{"key":"2034_CR69","unstructured":"Hart, W. E. (1994). Adaptive global optimization with local search. Ph.D. thesis, University of California, San Diego."},{"key":"2034_CR70","unstructured":"Harvey, W. D., & Ginsberg, M. L. (1997). Limited discrepancy search. In IJCAI internation joint conference on artificial intelligence (pp. 607\u2013613). Morgan Kaufmann."},{"key":"2034_CR71","doi-asserted-by":"crossref","first-page":"490","DOI":"10.1057\/palgrave.jors.2601525","volume":"54","author":"KS Hindi","year":"2003","unstructured":"Hindi, K. S., Fleszar, K., & Charalambous, C. (2003). An effective heuristic for the CLSP with setup times. Journal of the Operations Research Society, 54, 490\u2013498.","journal-title":"Journal of the Operations Research Society"},{"key":"2034_CR72","unstructured":"Hogg, T., & Williams, C. (1993). Solving the really hard problems with cooperative search. In 11th conference on artificial intelligemce AAAI\u201993 (pp. 231\u2013236). AAAI Press."},{"issue":"4","key":"2034_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. Journal of Heuristics, 6(4), 439\u2013455.","journal-title":"Journal of Heuristics"},{"key":"2034_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, B. A. (1990). The performance of cooperative processes. Physica D, 42, 38\u201347.","journal-title":"Physica D"},{"key":"2034_CR75","first-page":"80","volume-title":"Parallel problem solving from nature, volume 496 of LNCS","author":"P Husbands","year":"1990","unstructured":"Husbands, P., Mill, F., & Warrington, S. (1990). Genetic algorithms, production plan optimisation and scheduling. In H.-P. Schewefel & R. Manner (Eds.), Parallel problem solving from nature, volume 496 of LNCS (pp. 80\u201384). Dortmund: Springer."},{"key":"2034_CR76","unstructured":"Jahuira, C. A. R., & Cuadros-Vargas, E. (2003). Solving the TSP by mixing GAs with minimal spanning trees. In First international conference of the peruvian computer society (pp. 123\u2013132), Lima, Peru."},{"issue":"1","key":"2034_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 Computing, 9(1), 3\u201312.","journal-title":"Soft Computing"},{"key":"2034_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 (pp. 688\u2013699). Springer.","DOI":"10.1007\/978-3-540-24854-5_71"},{"key":"2034_CR79","unstructured":"Jog, P., Suh, J. Y., & 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 genetic algorithms, Morgan Kaufmann, USA."},{"issue":"3","key":"2034_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. European Journal of Operational Research, 199(3), 620\u2013629.","journal-title":"European Journal of Operational Research"},{"key":"2034_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), volume 4030 of LNCS (pp. 57\u201369), Gran Canaria, Spain."},{"key":"2034_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 series in discrete mathematics and theoretical computer science, 20, 111\u2013152.","journal-title":"DIMACS series in discrete mathematics and theoretical computer science"},{"key":"2034_CR83","doi-asserted-by":"crossref","unstructured":"Kamarainen, O., & Sakkout, H. E. (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":"2034_CR84","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1287\/moor.2.3.209","volume":"2","author":"RM Karp","year":"1977","unstructured":"Karp, R. M. (1977). Probabilistic analysis of partitioning algorithms for the traveling salesman problem in the plane. Mathematics of Operations Research, 2, 209\u2013224.","journal-title":"Mathematics of Operations Research"},{"key":"2034_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 (pp. 114\u2013119), Perth, Australia."},{"key":"2034_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 (pp. 887\u2013894). IEEE Press."},{"key":"2034_CR87","first-page":"113","volume-title":"EuroGP conference on genetic programming, LNCS vol. 3003","author":"K Kostikas","year":"2004","unstructured":"Kostikas, K., & Fragakis, C. (2004). Genetic programming applied to mixed integer programming. In M. Keijzer, et al. (Eds.), EuroGP conference on genetic programming, LNCS vol. 3003 (pp. 113\u2013124). Berlin: Springer."},{"key":"2034_CR88","unstructured":"Koza, J., & Andre, D. (1995). Parallel genetic programming on a network of transputers. Technical Report CS-TR-95-1542, Stanford University."},{"key":"2034_CR89","unstructured":"Krueger, M. (1993). M\u00e9thodes d\u2019analyse d\u2019algorithmes d\u2019optimisation stochastiques \u00e0 l\u2019aide d\u2019algorithmes g\u00e9n\u00e9tiques. Ph.D. thesis, Ecole Nationale Sup\u00e8rieure des T\u00e9l\u00e9communications, Paris, France."},{"key":"2034_CR90","doi-asserted-by":"crossref","unstructured":"Levine, D. (1994). A parallel genetic algorithm for the set partitioning problem. Ph.D. thesis, Argonne National Laboratory, Illinois Institute of Technology, Argonne, USA.","DOI":"10.2172\/10161119"},{"key":"2034_CR91","unstructured":"Lin, F. T., Kao, C. Y., & Hsu, C. C. (1991). Incorporating genetic algorithms into simulated annealing. In Proceedings of the Fourth International Symposium on AI (pp. 290\u2013297)."},{"key":"2034_CR92","doi-asserted-by":"crossref","unstructured":"Louis, S. J. (2003). Genetic learning from experiences. In Congress on Evolutionary Computations CEC\u20192003 (pp. 2118\u20132125). Australia.","DOI":"10.1109\/CEC.2003.1299934"},{"key":"2034_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, H. R. (1995). Job-shop scheduling: Computational study of local search and large-step optimization methods. European Journal of Operational Research, 83, 347\u2013367.","journal-title":"European Journal of Operational Research"},{"key":"2034_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, S. W., & Goldberg, D. E. (1995). Parallel recombinative simulated annealing: A genetic algorithm. Parallel Computing, 21, 1\u201328.","journal-title":"Parallel Computing"},{"issue":"4","key":"2034_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 Journal on Computing, 11(4), 358\u2013369.","journal-title":"INFORMS Journal on Computing"},{"key":"2034_CR96","unstructured":"Mariano, C. E., & 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. Belgium: Brussels."},{"key":"2034_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, O. C., Otto, S. W., & Felten, E. W. (1992). Large-step markov chains for the TSP: Incorporating local search heuristics. Operation Research Letters, 11, 219\u2013224.","journal-title":"Operation Research Letters"},{"key":"2034_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":"2034_CR99","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1023\/A:1007677805582","volume":"38","author":"RS Michalski","year":"2000","unstructured":"Michalski, R. S. (2000). Learnable evolution model: Evolutionary processes guided by machine learning. Machine Learning, 38(1), 9\u201340.","journal-title":"Machine Learning"},{"issue":"1","key":"2034_CR100","first-page":"13","volume":"7","author":"M Minsky","year":"1994","unstructured":"Minsky, M. (1994). Negative expertise. International Journal of Expert Systems, 7(1), 13\u201319.","journal-title":"International Journal of Expert Systems"},{"key":"2034_CR101","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1007\/BF02125405","volume":"63","author":"A Nagar","year":"1995","unstructured":"Nagar, A., Heragu, S. S., & Haddock, J. (1995). A metaheuristic algorithm for a bi-criteria scheduling problem. Annals of Operations Research, 63, 397\u2013414.","journal-title":"Annals of Operations Research"},{"key":"2034_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":"2034_CR103","volume-title":"Integer and combinatorial optimization","author":"G Nemhauser","year":"1999","unstructured":"Nemhauser, G., & Wolsey, L. (1999). Integer and combinatorial optimization. London: Wiley."},{"issue":"1","key":"2034_CR104","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1109\/72.265961","volume":"5","author":"V Nissen","year":"1994","unstructured":"Nissen, V. (1994). Solving the quadratic assignment problem with clues from nature. IEEE Transactions on Neural Networks, 5(1), 66\u201372.","journal-title":"IEEE Transactions on Neural Networks"},{"key":"2034_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. Journal of Heuristics, 3, 271\u2013286.","journal-title":"Journal of Heuristics"},{"key":"2034_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. European Journal of Operational Research, 164, 12\u201323.","journal-title":"European Journal of Operational Research"},{"key":"2034_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 (pp. 573\u2013578). Perth, Australia.","DOI":"10.1109\/ICEC.1995.487447"},{"key":"2034_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. Journal of Heuristics, 5, 159\u2013180.","journal-title":"Journal of Heuristics"},{"key":"2034_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. Journal of Heuristics, 5, 255\u2013279.","journal-title":"Journal of Heuristics"},{"key":"2034_CR110","unstructured":"Potts, C. N., & Velde, S. L. (1995). Dynasearch- iterative local improvement by dynamic programming. Technical Report TR, University of Twente, Netherlands."},{"key":"2034_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. Annals of Operations Research, 115, 51\u201372.","journal-title":"Annals of Operations Research"},{"key":"2034_CR112","doi-asserted-by":"crossref","unstructured":"Puchinger, J., & Raidl, G. R. (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 (pp. 41\u201353). Berlin: Springer.","DOI":"10.1007\/11499305_5"},{"key":"2034_CR113","unstructured":"Ramsey, C. L., & Grefenstette, J. J. (1993). Case-based initialization of genetic algorithms. In Fifth international conference on genetic algorithms (pp. 84\u201391)."},{"key":"2034_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":"2034_CR115","doi-asserted-by":"crossref","first-page":"753","DOI":"10.1080\/01969720500306147","volume":"36","author":"RG Reynolds","year":"2005","unstructured":"Reynolds, R. G., Michalewicz, Z., & Peng, B. (2005). Cultural algorithms: Computational modeling of how cultures learn to solve problems\u2014an engineering example. Cybernetics and Systems, 36(8), 753\u2013771.","journal-title":"Cybernetics and Systems"},{"issue":"1","key":"2034_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. Journal of Mathematical Modelling and Algorithms, 5(1), 23\u201341.","journal-title":"Journal of Mathematical Modelling and Algorithms"},{"issue":"1","key":"2034_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, K. E., & ReVelle, C. S. (1997). Heuristic concentration: Two stage solution construction. European Journal of Operational Research, 97(1), 75\u201386.","journal-title":"European Journal of Operational Research"},{"key":"2034_CR118","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1038\/323533a0","volume":"323","author":"DE Rumelhart","year":"1986","unstructured":"Rumelhart, D. E., Hinton, G. E., & Williams, R. J. (1986). Learning representations by backpropagating errors. Nature, 323, 533\u2013536.","journal-title":"Nature"},{"key":"2034_CR119","unstructured":"Salami, M., & Cain, G. (1996). Genetic algorithm processor on reprogrammable architectures. In Fifth annual conference on evolutionary programming EP\u201996. San Diego, CA: MIT Press."},{"key":"2034_CR120","unstructured":"Sebag, M., Schoenauer, M., & Ravise, C. (1997). Toward civilized evolution: Developing inhibitions. In T. B\u00e4ck (Eds.), Seventh international conference on genetic algorithms (pp. 291\u2013298)."},{"key":"2034_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 (pp. 879\u2013888). Springer.","DOI":"10.1007\/3-540-45356-3_86"},{"key":"2034_CR122","unstructured":"Sellmann, M., & Ans\u00f3tegui, C. (2006). Disco\u2014novo\u2014gogo: 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":"2034_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 Transaction on Computer-Aided Design, 9(5), 500\u2013511.","journal-title":"IEEE Transaction on Computer-Aided Design"},{"key":"2034_CR124","doi-asserted-by":"crossref","unstructured":"Shaw, P. (1998). Using constraint programming and local search methods to solve vehicle routing problems. In M. Maher & J.-F. Puget (Eds.), CP\u201998 principle and practice of constraint programming, LNCS no. 1520 (pp. 417\u2013431).","DOI":"10.1007\/3-540-49481-2_30"},{"key":"2034_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, volume 2 (pp. 1384\u20131391). Piscataway, NJ: IEEE Press.","DOI":"10.1109\/CEC.1999.782644"},{"key":"2034_CR126","unstructured":"Stutzle, T., & Hoos, H. H. (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 (pp. 191\u2013193). Sophia Antipolis, France. INRIA."},{"key":"2034_CR127","unstructured":"Suh, J. Y., & Van Gucht, D. (1987). Incorporating heuristic information into genetic search. In 2rd international conference genetic algorithms (pp. 100\u2013107). USA: Lawrence Erlbaum Associates."},{"key":"2034_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":"2034_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. Journal of Heuristics, 9(1), 51\u201374.","journal-title":"Journal of Heuristics"},{"key":"2034_CR130","volume-title":"Essays and surveys in metaheuristics, chapter POPMUSIC: Partial optimization metaheuristic under special intensification conditions","author":"E Taillard","year":"2002","unstructured":"Taillard, E., & Voss, S. (2002). Essays and surveys in metaheuristics, chapter POPMUSIC: Partial optimization metaheuristic under special intensification conditions. Dordrecht: Kluwer."},{"key":"2034_CR131","unstructured":"Taillard, E. D., & Gambardella, L. (1997). Adaptive memories for the quadratic assignment problem. Technical Report 87-97, IDSIA, Lugano, Switzerland."},{"issue":"1","key":"2034_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, E. D., Gambardella, L. M., Gendreau, M., & Potvin, J.-Y. (2001). Adaptive memory programming: A unified view of metaheuristics. European Journal of Operational Research, 135(1), 1\u201316.","journal-title":"European Journal of Operational Research"},{"key":"2034_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. Journal of Heuristics, 8, 541\u2013564.","journal-title":"Journal of Heuristics"},{"issue":"2","key":"2034_CR134","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/s10288-013-0242-3","volume":"11","author":"E-G Talbi","year":"2013","unstructured":"Talbi, E.-G. (2013). Combining metaheuristics with mathematical programming, constraint programming and machine learning. 4OR, 11(2), 101\u2013150.","journal-title":"4OR"},{"key":"2034_CR135","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. New York: Wiley."},{"issue":"2","key":"2034_CR136","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. Journal of Mathematical Modelling and Algorithms (JMMA), 5(2), 5\u201322.","journal-title":"Journal of Mathematical Modelling and Algorithms (JMMA)"},{"key":"2034_CR137","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":"2034_CR138","unstructured":"Talbi, E. G., Muntean, T., & Samarandache, I. (1994). Hybridation des algorithmes g\u00e9n\u00e9tiques avec la recherche tabou. In Evolution Artificielle EA94. Toulouse, France."},{"issue":"4","key":"2034_CR139","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1023\/A:1009669824615","volume":"4","author":"S Talukdar","year":"1998","unstructured":"Talukdar, S., Baerentzen, L., Gove, A., & De Souza, P. (1998). Asynchronous teams: Cooperation schemes for autonomous agents. Journal of Heuristics, 4(4), 295\u2013321.","journal-title":"Journal of Heuristics"},{"key":"2034_CR140","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. Transactions of the Society of Instrument and Control Engineers, 130, 329\u2013336.","journal-title":"Transactions of the Society of Instrument and Control Engineers"},{"key":"2034_CR141","unstructured":"Tanese, R. (1987). Parallel genetic algorithms for a hypercube. In Proceedings of the second international conference on genetic algorithms (pp. 177\u2013183). Cambridge, MA: MIT."},{"issue":"4","key":"2034_CR142","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":"2034_CR143","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 I. H. Osman & J. P. Kelly (Eds.), Meta-heuristics: Theory and applications (pp. 501\u2013522). Dordrecht: Kluwer."},{"issue":"2","key":"2034_CR144","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. Evolutionary Computation, 6(2), 161\u2013184.","journal-title":"Evolutionary Computation"},{"key":"2034_CR145","first-page":"109","volume-title":"Parallel problem solving from nature, volume 496 of LNCS","author":"NLJ Ulder","year":"1990","unstructured":"Ulder, N. L. J., Aarts, E. H. L., Bandelt, H.-J., Van Laarhoven, P. J. M., & Pesch, E. (1990). Genetic local search algorithms for the traveling salesman problem. In H.-P. Schewefel & R. Manner (Eds.), Parallel problem solving from nature, volume 496 of LNCS (pp. 109\u2013116). Dortmund: Springer."},{"key":"2034_CR146","unstructured":"Vasquez, M., & Hao, J.-K. (2001). A hybrid approach for the 0-1 multidimensional knapsack problem. In Proceedings of the international joint conference on artificial intelligence IJCAI (pp. 328\u2013333)."},{"issue":"1","key":"2034_CR147","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/BF02430365","volume":"1","author":"MGA Verhoeven","year":"1995","unstructured":"Verhoeven, M. G. A., & Aarts, E. H. L. (1995). Parallel local search. Journal of Heuristics, 1(1), 43\u201365.","journal-title":"Journal of Heuristics"},{"key":"2034_CR148","first-page":"373","volume-title":"Parallel problem solving from nature, volume 496 of LNCS","author":"H-M Voigt","year":"1990","unstructured":"Voigt, H.-M., Born, J., & Santibanez-Koref, I. (1990). Modelling and simulation of distributed evolutionary search processes for function optimization. In H.-P. Schwefel & R. Manner (Eds.), Parallel problem solving from nature, volume 496 of LNCS (pp. 373\u2013380). Dortmund: Springer."},{"key":"2034_CR149","volume-title":"Network optimization problems, chapter Tabu search: Applications and prospects","author":"S Voss","year":"1993","unstructured":"Voss, S. (1993). Network optimization problems, chapter Tabu search: Applications and prospects. Singapore: World Scientific."},{"key":"2034_CR150","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 (pp. 50\u201355). Perth, Australia."},{"key":"2034_CR151","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":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-015-2034-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-015-2034-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-015-2034-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,31]],"date-time":"2019-08-31T16:40:04Z","timestamp":1567269604000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-015-2034-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,10,16]]},"references-count":151,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,5]]}},"alternative-id":["2034"],"URL":"https:\/\/doi.org\/10.1007\/s10479-015-2034-y","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,10,16]]}}}