{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T16:45:11Z","timestamp":1771001111841,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":44,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540263197","type":"print"},{"value":"9783540316732","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11499305_5","type":"book-chapter","created":{"date-parts":[[2010,4,9]],"date-time":"2010-04-09T05:39:11Z","timestamp":1270791551000},"page":"41-53","source":"Crossref","is-referenced-by-count":153,"title":["Combining Metaheuristics and Exact Algorithms in Combinatorial Optimization: A Survey and Classification"],"prefix":"10.1007","author":[{"given":"Jakob","family":"Puchinger","sequence":"first","affiliation":[]},{"given":"G\u00fcnther R.","family":"Raidl","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1-3","key":"5_CR1","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/S0166-218X(01)00338-9","volume":"123","author":"R.K. Ahuja","year":"2002","unstructured":"Ahuja, R.K., Ergun, \u00d6., Orlin, J.B., Punnen, A.P.: A survey of very large-scale neighborhood search techniques. Discrete Applied Mathematics\u00a0123(1-3), 75\u2013102 (2002)","journal-title":"Discrete Applied Mathematics"},{"key":"5_CR2","first-page":"645","volume":"ICM III","author":"D. Applegate","year":"1998","unstructured":"Applegate, D., Bixby, R., Chv\u00e1tal, V., Cook, W.: On the solution of the traveling salesman problem. Documenta Mathematica\u00a0Extra Volume ICM III, 645\u2013656 (1998)","journal-title":"Documenta Mathematica"},{"key":"5_CR3","doi-asserted-by":"publisher","DOI":"10.1887\/0750308958","volume-title":"Handbook of Evolutionary Computation","author":"T. B\u00e4ck","year":"1997","unstructured":"B\u00e4ck, T., Fogel, D.B., Michalewicz, Z.: Handbook of Evolutionary Computation. Oxford University Press, New York (1997)"},{"key":"5_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/3-540-45365-2_21","volume-title":"Applications of Evolutionary Computing","author":"E.K. Burke","year":"2001","unstructured":"Burke, E.K., Cowling, P.I., Keuthen, R.: Effective local and guided variable neighborhood search methods for the asymmetric travelling salesman problem. In: Boers, E., et al. (eds.) EvoIASP 2001, EvoWorkshops 2001, EvoFlight 2001, EvoSTIM 2001, EvoCOP 2001, and EvoLearn 2001. LNCS, vol.\u00a02037, pp. 203\u2013212. Springer, Heidelberg (2001)"},{"key":"5_CR5","unstructured":"Chen, S., Talukdar, S., Sadeh, N.: Job-shop-scheduling by a team of asynchronous agents. In: IJCAI 1993 Workshop on Knowledge-Based Production, Scheduling and Control, Chambery, France (1993)"},{"key":"5_CR6","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1023\/A:1009642405419","volume":"4","author":"P.C. Chu","year":"1998","unstructured":"Chu, P.C., Beasley, J.E.: A genetic algorithm for the multidimensional knapsack problem. Journal of Heuristics\u00a04, 63\u201386 (1998)","journal-title":"Journal of Heuristics"},{"key":"5_CR7","series-title":"Lecture Notes in Computer Science","volume-title":"Principles and Practice of Constraint Programming - CP97","author":"D. Clements","year":"1997","unstructured":"Clements, D., Crawford, J., Joslin, D., Nemhauser, G., Puttlitz, M., Savelsbergh, M.: Heuristic optimization: A hybrid AI\/OR approach (In conjunction with the Third International Conference on Principles and Practice of Constraint Programming (CP97)). In: Smolka, G. (ed.) CP 1997. LNCS, vol.\u00a01330, Springer, Heidelberg (1997)"},{"key":"5_CR8","unstructured":"Congram, R.K.: Polynomially Searchable Exponential Neighbourhoods for Sequencing Problems in Combinatorial Optimisation. PhD thesis, University of Southampton, Faculty of Mathematical Studies, UK (2000)"},{"key":"5_CR9","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1023\/A:1021934325079","volume":"18","author":"C. Cotta","year":"2003","unstructured":"Cotta, C., Troya, J.M.: Embedding branch and bound within evolutionary algorithms. Applied Intelligence\u00a018, 137\u2013153 (2003)","journal-title":"Applied Intelligence"},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"Danna, E., Rothberg, E., Le Pape, C.: Exploring relaxation induced neighbourhoods to improve MIP solutions. Technical report, ILOG (2003)","DOI":"10.1007\/s10107-004-0518-7"},{"key":"5_CR11","volume-title":"Linear Programming and Extensions","author":"G.B. Dantzig","year":"1963","unstructured":"Dantzig, G.B.: Linear Programming and Extensions. Princeton University Press, Princeton (1963)"},{"key":"5_CR12","volume-title":"Proceedings of the 1999 Congress on Evolutionary Computation (CEC)","author":"J. Denzinger","year":"1999","unstructured":"Denzinger, J., Offermann, T.: On cooperation between evolutionary algorithms and other search paradigms. In: Proceedings of the 1999 Congress on Evolutionary Computation (CEC), IEEE Press, Los Alamitos (1999)"},{"key":"5_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/3-540-36605-9_20","volume-title":"Applications of Evolutionary Computing","author":"I. Dumitrescu","year":"2003","unstructured":"Dumitrescu, I., Stuetzle, T.: Combinations of local search and exact algorithms. In: Raidl, G.R., Cagnoni, S., Cardalda, J.J.R., Corne, D.W., Gottlieb, J., Guillot, A., Hart, E., Johnson, C.G., Marchiori, E., Meyer, J.-A., Middendorf, M. (eds.) EvoIASP 2003, EvoWorkshops 2003, EvoSTIM 2003, EvoROB\/EvoRobot 2003, EvoCOP 2003, EvoBIO 2003, and EvoMUSART 2003. LNCS, vol.\u00a02611, pp. 211\u2013223. Springer, Heidelberg (2003)"},{"key":"5_CR14","unstructured":"Filho, G.R., Lorena, L.A.N.: Constructive genetic algorithm and column generation: an application to graph coloring. In: Proceedings of APORS 2000 - The Fifth Conference of the Association of Asian-Pacific Operations Research Societies within IFORS (2000)"},{"key":"5_CR15","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s10107-003-0395-5","volume":"98","author":"M. Fischetti","year":"2003","unstructured":"Fischetti, M., Lodi, A.: Local Branching. Mathematical Programming Series B\u00a098, 23\u201347 (2003)","journal-title":"Mathematical Programming Series B"},{"key":"5_CR16","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1023\/A:1011921025322","volume":"7","author":"A.P. French","year":"2001","unstructured":"French, A.P., Robinson, A.C., Wilson, J.M.: Using a hybrid genetic-algorithm\/branch and bound approach to solve feasibility and optimization integer programming problems. Journal of Heuristics\u00a07, 551\u2013564 (2001)","journal-title":"Journal of Heuristics"},{"key":"5_CR17","series-title":"International Series in Operations Research & Management Science","doi-asserted-by":"crossref","DOI":"10.1007\/b101874","volume-title":"Handbook of Metaheuristics","author":"F. Glover","year":"2003","unstructured":"Glover, F., Kochenberger, G.: Handbook of Metaheuristics. International Series in Operations Research & Management Science, vol.\u00a057. Kluwer Academic Publishers, Dordrecht (2003)"},{"key":"5_CR18","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu Search","author":"F. Glover","year":"1997","unstructured":"Glover, F., Laguna, M.: Tabu Search. Kluwer Academic Publishers, Dordrecht (1997)"},{"issue":"3","key":"5_CR19","first-page":"653","volume":"39","author":"F. Glover","year":"2000","unstructured":"Glover, F., Laguna, M., Mart\u00ed, R.: Fundamentals of scatter search and path relinking. Control and Cybernetics\u00a039(3), 653\u2013684 (2000)","journal-title":"Control and Cybernetics"},{"key":"5_CR20","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1007\/978-1-4615-5775-3_30","volume-title":"Meta-heuristics: advances and trends in local search paradigms for optimization","author":"P. Hansen","year":"1999","unstructured":"Hansen, P., Mladenovi\u0107, N.: An introduction to variable neighborhood search. In: Vo\u00df, S., Martello, S., Osman, I., Roucairol, C. (eds.) Meta-heuristics: advances and trends in local search paradigms for optimization, pp. 433\u2013438. Kluwer Academic Publishers, Dordrecht (1999)"},{"key":"5_CR21","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S. Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gellat, C., Vecchi, M.: Optimization by simulated annealing. Science\u00a0220, 671\u2013680 (1983)","journal-title":"Science"},{"key":"5_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1304","DOI":"10.1007\/978-3-540-24854-5_125","volume-title":"GECCO 2004","author":"G. Klau","year":"2004","unstructured":"Klau, G., Ljubi\u0107, I., Moser, A., Mutzel, P., Neuner, P., Pferschy, U., Raidl, G., Weiskircher, R.: Combining a memetic algorithm with integer programming to solve the prize-collecting Steiner tree problem. In: Deb, K., et al. (eds.) GECCO 2004. LNCS, vol.\u00a03102, pp. 1304\u20131315. Springer, Heidelberg (2004)"},{"key":"5_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/978-3-540-24650-3_11","volume-title":"Genetic Programming","author":"K. Kostikas","year":"2004","unstructured":"Kostikas, K., Fragakis, C.: Genetic programming applied to mixed integer programming. In: Keijzer, M., O\u2019Reilly, U.-M., Lucas, S., Costa, E., Soule, T. (eds.) EuroGP 2004. LNCS, vol.\u00a03003, pp. 113\u2013124. Springer, Heidelberg (2004)"},{"key":"5_CR24","volume-title":"Estimation of Distribution Algorithms. A New Tool for Evolutionary Computation","author":"P. Larra\u00f1aga","year":"2001","unstructured":"Larra\u00f1aga, P., Lozano, J.A.: Estimation of Distribution Algorithms. A New Tool for Evolutionary Computation. Kluwer Academic Publishers, Dordrecht (2001)"},{"issue":"1","key":"5_CR25","first-page":"27","volume":"16","author":"A.Z.-Z. Lin","year":"2004","unstructured":"Lin, A.Z.-Z., Bean, J., White, I.C.C.: A hybrid genetic\/optimization algorithm for finite horizon partially observed markov decision processes. Journal on Computing\u00a016(1), 27\u201338 (2004)","journal-title":"Journal on Computing"},{"key":"5_CR26","doi-asserted-by":"crossref","unstructured":"Louren\u00e7o, H.R., Martin, O., St\u00fctzle, T.: Iterated local search. In: Glover and Kochenberger [17], pp. 321\u2013353","DOI":"10.1007\/0-306-48056-5_11"},{"key":"5_CR27","unstructured":"Marino, A., Pr\u00fcgel-Bennett, A., Glass, C.A.: Improving graph colouring with linear programming and genetic algorithms. In: Proceedings of EUROGEN 1999, Jyv\u00e4skyi\u00e4, Finland, pp. 113\u2013118 (1999)"},{"key":"5_CR28","doi-asserted-by":"crossref","unstructured":"Moscato, P., Cotta, C.: A gentle introduction to memetic algorithms. In: Glover and Kochenberger [17], pp. 105\u2013144.","DOI":"10.1007\/0-306-48056-5_5"},{"key":"5_CR29","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/BF02125405","volume":"63","author":"A. Nagar","year":"1995","unstructured":"Nagar, A., Heragu, S.S., Haddock, J.: A meta-heuristic algorithm for a bi-criteria scheduling problem. Annals of Operations Research\u00a063, 397\u2013414 (1995)","journal-title":"Annals of Operations Research"},{"key":"5_CR30","doi-asserted-by":"crossref","DOI":"10.1002\/9781118627372","volume-title":"Integer and Combinatorial Optimization","author":"G. Nemhauser","year":"1988","unstructured":"Nemhauser, G., Wolsey, L.: Integer and Combinatorial Optimization. John Wiley & Sons, Chichester (1988)"},{"key":"5_CR31","doi-asserted-by":"publisher","first-page":"731","DOI":"10.1111\/1475-3995.00385","volume":"9","author":"A. Plateau","year":"2002","unstructured":"Plateau, A., Tachat, D., Tolla, P.: A hybrid search combining interior point methods and metaheuristics for 0-1 programming. International Transactions in Operational Research\u00a09, 731\u2013746 (2002)","journal-title":"International Transactions in Operational Research"},{"key":"5_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"642","DOI":"10.1007\/978-3-540-30217-9_65","volume-title":"Parallel Problem Solving from Nature - PPSN VIII","author":"J. Puchinger","year":"2004","unstructured":"Puchinger, J., Raidl, G.R.: An evolutionary algorithm for column generation in integer programming: an effective approach for 2D bin packing. In: Yao, X., Burke, E.K., Lozano, J.A., Smith, J., Merelo-Guerv\u00f3s, J.J., Bullinaria, J.A., Rowe, J.E., Ti\u0148o, P., Kab\u00e1n, A., Schwefel, H.-P. (eds.) PPSN 2004. LNCS, vol.\u00a03242, pp. 642\u2013651. Springer, Heidelberg (2004)"},{"key":"5_CR33","unstructured":"Puchinger, J., Raidl, G.R.: Models and algorithms for three-stage two-dimensional bin packing. Technical Report TR 186\u20131\u201304\u201304, Institute of Computer Graphics and Algorithms, Vienna University of Technology, submitted to the European Journal of Operations Research (2004)"},{"key":"5_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/978-3-540-24652-7_17","volume-title":"Evolutionary Computation in Combinatorial Optimization","author":"J. Puchinger","year":"2004","unstructured":"Puchinger, J., Raidl, G.R., Koller, G.: Solving a real-world glass cutting problem. In: Gottlieb, J., Raidl, G.R. (eds.) EvoCOP 2004. LNCS, vol.\u00a03004, pp. 162\u2013173. Springer, Heidelberg (2004)"},{"key":"5_CR35","first-page":"207","volume-title":"Proceedings of the 1998 IEEE International Conference on Evolutionary Computation","author":"G.R. Raidl","year":"1998","unstructured":"Raidl, G.R.: An improved genetic algorithm for the multiconstrained 0\u20131 knapsack problem. In: Fogel, D.B. (ed.) Proceedings of the 1998 IEEE International Conference on Evolutionary Computation, pp. 207\u2013211. IEEE Press, Los Alamitos (1998)"},{"key":"5_CR36","first-page":"990","volume-title":"Proceedings of the 2003 ACM Symposium on Applied Computing","author":"G.R. Raidl","year":"2004","unstructured":"Raidl, G.R., Feltl, H.: An improved hybrid genetic algorithm for the generalized assignment problem. In: Haddadd, H.M., others (eds.) Proceedings of the 2003 ACM Symposium on Applied Computing, pp. 990\u2013995. ACM Press, New York (2004)"},{"key":"5_CR37","unstructured":"Staggemeier, A.T., Clark, A.R., Aickelin, U., Smith, J.: A hybrid genetic algorithm to solve a lot-sizing and scheduling problem. In: Proceedings of the 16th triannual Conference of the International Federation of Operational Research Societies, Edinburgh, U.K. (2002)"},{"key":"5_CR38","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1023\/A:1009669824615","volume":"4","author":"S. Talukdar","year":"1998","unstructured":"Talukdar, S., Baeretzen, L., Gove, A., de Souza, P.: Asynchronous teams: Cooperation schemes for autonomous agents. Journal of Heuristics\u00a04, 295\u2013321 (1998)","journal-title":"Journal of Heuristics"},{"key":"5_CR39","doi-asserted-by":"crossref","unstructured":"Talukdar, S., Murty, S., Akkiraju, R.: Asynchronous teams. In: Glover and Kochenberger [17], pp. 537\u2013556.","DOI":"10.1007\/0-306-48056-5_19"},{"key":"5_CR40","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.: An approximate solution method for combinatorial optimisation. Transactions of the Society of Instrument and Control Engineers\u00a0130, 329\u2013336 (1994)","journal-title":"Transactions of the Society of Instrument and Control Engineers"},{"key":"5_CR41","unstructured":"Thompson, P., Orlin, J.: The theory of cycle transfers. Technical Report OR-200-89, MIT Operations Research Center, Boston, MA (1989)"},{"key":"5_CR42","doi-asserted-by":"publisher","first-page":"935","DOI":"10.1287\/opre.41.5.935","volume":"41","author":"P. Thompson","year":"1993","unstructured":"Thompson, P., Psaraftis, H.: Cycle transfer algorithm for multivehicle routing and scheduling problems. Operations Research\u00a041, 935\u2013946 (1993)","journal-title":"Operations Research"},{"key":"5_CR43","unstructured":"Vasquez, M., Hao, J.-K.: A hybrid approach for the 0\u20131 multidimensional knapsack problem. In: Proceedings of the International Joint Conference on Artificial Intelligence 2001, pp. 328\u2013333 (2001)"},{"key":"5_CR44","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1007\/978-1-4615-5775-3_34","volume-title":"Metaheuristics: Advances and Trends in Local Search Paradigms for Optimization","author":"D.L. Woodruff","year":"1999","unstructured":"Woodruff, D.L.: A chunking based selection strategy for integrating meta-heuristics with branch and bound. In: Voss, S., et al. (eds.) Metaheuristics: Advances and Trends in Local Search Paradigms for Optimization, pp. 499\u2013511. Kluwer Academic Publishers, Dordrecht (1999)"}],"container-title":["Lecture Notes in Computer Science","Artificial Intelligence and Knowledge Engineering Applications: A Bioinspired Approach"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11499305_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,25]],"date-time":"2024-03-25T17:17:40Z","timestamp":1711387060000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11499305_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540263197","9783540316732"],"references-count":44,"URL":"https:\/\/doi.org\/10.1007\/11499305_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}