{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:06:24Z","timestamp":1725516384431},"publisher-location":"Berlin, Heidelberg","reference-count":58,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540782940"},{"type":"electronic","value":"9783540782957"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-78295-7_6","type":"book-chapter","created":{"date-parts":[[2008,8,11]],"date-time":"2008-08-11T13:20:59Z","timestamp":1218460859000},"page":"151-183","source":"Crossref","is-referenced-by-count":7,"title":["Hybrids of Constructive Metaheuristics and Constraint Programming: A Case Study with ACO"],"prefix":"10.1007","author":[{"given":"Bernd","family":"Meyer","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"6_CR1_1","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/S0305-0483(98)00042-5","volume":"27","author":"A Allahverdi","year":"1999","unstructured":"A. Allahverdi, J. N. D. Gupta, and T. Aldowaisan. A review of scheduling research involving setup considerations. Omega, 27(2):219\u2013239, 1999.","journal-title":"Omega"},{"issue":"3","key":"6_CR2_1","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1007\/PL00011432","volume":"90","author":"N Ascheuer","year":"2001","unstructured":"N. Ascheuer, M. Fischetti, and M. Gr\u00f6tschel. Solving the asymmetric travelling salesman problem with time windows by branch-and-cut. Mathematical Programming, 90(3):475\u2013506, 2001.","journal-title":"Mathematical Programming"},{"key":"6_CR3_1","doi-asserted-by":"crossref","unstructured":"S. Baluja and R. Caruana. Removing the genetics from the standard genetic algorithm. In Int. Conf. Machine Learning (ML-95), 1995.","DOI":"10.1016\/B978-1-55860-377-6.50014-1"},{"key":"6_CR4_1","doi-asserted-by":"crossref","unstructured":"A. Bauer, B. Bullnheimer, R. F. Hartl, and C. Strauss. An ant colony optimization approach for the single machine total tardiness problem. In Proceedings of the Congress on Evolutionary Computation, Washington\/DC, July 1999.","DOI":"10.1109\/CEC.1999.782653"},{"key":"6_CR5_1","unstructured":"C. Blum, November 2003. Personal Communication."},{"issue":"4","key":"6_CR6_1","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1016\/j.plrev.2005.10.001","volume":"2","author":"C Blum","year":"2005","unstructured":"C. Blum. Ant colony optimization: Introduction and recent trends. Physics of Life Reviews, 2(4):353\u2013373, 2005.","journal-title":"Physics of Life Reviews"},{"issue":"3","key":"6_CR7_1","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1145\/937503.937505","volume":"35","author":"C Blum","year":"2003","unstructured":"C. Blum and A. Roli. Metaheuristics in combinatorial optimization: Overview and conceptual comparison. ACM Computing Surveys, 35(3):268\u2013308, 2003.","journal-title":"ACM Computing Surveys"},{"key":"6_CR8_1","doi-asserted-by":"crossref","unstructured":"C. Blum and M. Sampels. When model bias is stronger than selection pressure. In Parallel Problem Solving From Nature (PPSN-VII), Granada, September 2002.","DOI":"10.1007\/3-540-45712-7_86"},{"key":"6_CR9_1","unstructured":"P. A. Bosman and D. Thierens. Continuous iterated density estimation evolutionary algorithms within the IDEA framework. In Genetic and Evolutionary Computation Conference - GECCO, pages 197\u2013200, Las Vegas, July 2000."},{"key":"6_CR10_1","doi-asserted-by":"crossref","unstructured":"M. Carlsson, G. Ottosson, and B. Carlson. An open-ended finite domain constraint solver. In Proc. PLILP\u201997 Programming Languages: Implementations, Logics, and Programs, Southampton, September 1997.","DOI":"10.1007\/BFb0033845"},{"key":"6_CR11_1","volume-title":"International Conference on Logic Programming","author":"Y Caseau","year":"1994","unstructured":"Y. Caseau and F. Laburthe. Improved CLP scheduling with task intervals. In International Conference on Logic Programming, Santa Margherita Ligure, Italy, June 1994."},{"key":"6_CR12_1","unstructured":"D. M. Chickering, D. Geiger, and D. Heckerman. Learning bayesian networks is NP-hard. Technical report, Microsoft Research, Redmont, WA, 1994. MSR-TR-94-17."},{"key":"6_CR13_1","unstructured":"C. Coello and A. Carlos. A survey of constraint handling techniques used with evolutionary algorithms. Technical report, Laboratorio Nacional de Informtica Avanzada, 1999. Technical Report Lania-RI-9904."},{"issue":"11\u201312","key":"6_CR14_1","doi-asserted-by":"publisher","first-page":"1245","DOI":"10.1016\/S0045-7825(01)00323-1","volume":"191","author":"CA Coello","year":"2002","unstructured":"C. A. Coello. Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: a survey of the state of the art. Computer Methods in Applied Mechanics and Engineering, 191(11\u201312):1245\u20131287, 2002.","journal-title":"Computer Methods in Applied Mechanics and Engineering"},{"issue":"2\u20133","key":"6_CR15_1","first-page":"141","volume":"9","author":"O Cord\u00f3n","year":"2002","unstructured":"O. Cord\u00f3n, F. Herrera, and T. St\u00fctzle. A review on the ant colony optimization metaheuristic: Basis, models and new trends. Mathware and Soft Computing, 9(2\u20133):141\u2013175, 2002.","journal-title":"Mathware and Soft Computing"},{"issue":"1","key":"6_CR16_1","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/s10479-005-5724-z","volume":"134","author":"P-T Boer De","year":"2005","unstructured":"P.-T. De Boer, D. P. Kroese, S. Mannor, and R. Y. Rubinstein. A tutorial on the cross-entropy method. Annals of Operations Research, 134(1):19\u201367, 2005.","journal-title":"Annals of Operations Research"},{"key":"6_CR17_1","volume-title":"Constraint Processing","author":"R Dechter","year":"2003","unstructured":"R. Dechter. Constraint Processing. Morgan Kaufmann Publishers, San Francisco, CA, 2003."},{"key":"6_CR18_1","doi-asserted-by":"crossref","unstructured":"M. den Besten, T. St\u00fctzle, and M. Dorigo. Ant colony optimization for the total weighted tardiness problem. In Parallel Problem Solving from Nature - PPSN VI, Paris, France, September 2000.","DOI":"10.1007\/3-540-45356-3_60"},{"key":"6_CR19_1","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1162\/106454699568728","volume":"5","author":"M Dorigo","year":"1999","unstructured":"M. Dorigo, G. D. Di Caro, and L. M. Gambardella. Ant algorithms for discrete optimization. Artificial Life, 5:137\u2013172, 1999.","journal-title":"Artificial Life"},{"key":"6_CR20_1","unstructured":"M. Dorigo and L. M. Gambardella. Ant colony system: A cooperative learning approach to the traveling salesman problem. Technical Report TR\/IRIDIA\/1996-5, Universite Libre de Bruxelles, 1996."},{"issue":"1","key":"6_CR21_1","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1109\/4235.585892","volume":"1","author":"M Dorigo","year":"1997","unstructured":"M. Dorigo and L. M. Gambardella. Ant colony system: A cooperative learning approach to the traveling salesman problem. IEEE Transactions on Evolutionary Computation, 1(1):53\u201366, 1997.","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"6_CR22_1","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/1290.001.0001","volume-title":"Ant Colony Optimization","author":"M Dorigo","year":"2004","unstructured":"M. Dorigo and T. St\u00fctzle. Ant Colony Optimization. MIT Press, Cambridge, 2004."},{"key":"6_CR23_1","doi-asserted-by":"crossref","unstructured":"M. Dorigo, M. Zlocin, N. Meuleau, and M. Birattari. Updating ACO pheromones using stochastic gradient ascent and cross-entropy methods. In Proceedings of the Evo Workshops, Kinsale, Ireland, April 2002.","DOI":"10.1007\/3-540-46004-7_3"},{"key":"6_CR24_1","doi-asserted-by":"crossref","unstructured":"B. Efron. The Jackknife, the bootstrap and other resampling plans. SIAM, 1982.","DOI":"10.1137\/1.9781611970319"},{"issue":"5","key":"6_CR25_1","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1109\/TEVC.2003.817236","volume":"7","author":"R Farmani","year":"2003","unstructured":"R. Farmani and J. A. Wright. Self-adaptive fitness formulation for constrained optimization. IEEE Transactions on Evolutionary Computation, 7(5):445\u2014455, 2003.","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"6_CR26_1","volume-title":"Handbook of metaheuristics","author":"F Focacci","year":"2003","unstructured":"F. Focacci, F. Laburthe, and A. Lodi. Local search and constraint programming. In F. Glover and G. Kochenberger, editors, Handbook of metaheuristics. Kluwer, Boston\/MA, 2003."},{"issue":"4","key":"6_CR27_1","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1287\/ijoc.14.4.403.2827","volume":"14","author":"F Focacci","year":"2003","unstructured":"F. Focacci, A. Lodi, and M. Milano. A hybrid exact algorithm for the TSPTW. INFORMS Journal on Computing, 14(4):403\u2013417, 2003.","journal-title":"INFORMS Journal on Computing"},{"issue":"1","key":"6_CR28_1","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1016\/S0377-2217(01)00329-0","volume":"143","author":"M Gravel","year":"2002","unstructured":"M. Gravel, W. L. Price, and C. Gagn\u00e9. Scheduling continuous casting of aluminum using a multiple objective ant colony optimization metaheuristic. European Journal of Operational Research, 143(1):218\u2013229, 2002.","journal-title":"European Journal of Operational Research"},{"key":"6_CR29_1","unstructured":"M. Held. Analysis and improvement of constraint handling in ant colony algorithms, November 2005. BCS Honours Thesis, Monash University."},{"volume-title":"Estimation of distribution algorithms: a new tool for evolutionary computation","year":"2002","key":"6_CR30_1","unstructured":"P. Larra\u00f1aga and J. A. Lozano (eds.). Estimation of distribution algorithms: a new tool for evolutionary computation. Kluwer, Boston, 2002."},{"key":"6_CR31_1","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1016\/S0927-0507(05)80189-6","volume-title":"Logistics of Production and Inventory","author":"EL Lawler","year":"1993","unstructured":"E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan, and D. B. Shmoys. Sequencing and scheduling: algorithms and complexity. In S. C. Graves, A. H. G. Rinnooy Kan, and P. H. Zipkin, editors, Logistics of Production and Inventory, pages 445\u2013522. North Holland, Amsterdam, Netherlands, 1993."},{"key":"6_CR32_1","doi-asserted-by":"crossref","unstructured":"J. A. Lozano, P. Larra\u00f1aga, I. Inza, and E. Bengoetxea (eds.). Towards a New Evolutionary Computation. Springer-Verlag, 2006.","DOI":"10.1007\/3-540-32494-1"},{"key":"6_CR33_1","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/5625.001.0001","volume-title":"Programming With Constraints","author":"K Marriott","year":"1998","unstructured":"K. Marriott and P. Stuckey. Programming With Constraints. MIT Press, Cambridge, MA, 1998."},{"key":"6_CR34_1","unstructured":"B. Meyer. On the convergence behaviour of ant colony search. In Asia-Pacific Conference on Complex Systems, Cairns, December 2004."},{"key":"6_CR35_1","doi-asserted-by":"crossref","unstructured":"B. Meyer. Constraint handling and stochastic ranking in ACO. In IEEE CEC \u2013 Congress on Evolutionary Computation, Edinburgh, September 2005.","DOI":"10.1109\/CEC.2005.1555031"},{"key":"6_CR36_1","doi-asserted-by":"crossref","unstructured":"B. Meyer and A. Ernst. Integrating ACO and constraint propagation. In Ant Colony Optimization and Swarm Intelligence (ANTS 2004), Brussels, September 2004.","DOI":"10.1007\/978-3-540-28646-2_15"},{"key":"6_CR37_1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04131-4","volume-title":"How to Solve It: Modern Heuristics","author":"Z Michalewicz","year":"2000","unstructured":"Z. Michalewicz and D. B. Fogel. How to Solve It: Modern Heuristics. Springer-Verlag, Berlin, 2000."},{"key":"6_CR38_1","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1162\/evco.1997.5.3.303","volume":"5","author":"H M\u00fchlenbein","year":"1998","unstructured":"H. M\u00fchlenbein. The equation for response to selection and its use for prediction. Evolutionary Computation, 5:303\u2013346, 1998.","journal-title":"Evolutionary Computation"},{"key":"6_CR39_1","doi-asserted-by":"crossref","unstructured":"H. M\u00fchlenbein and G. Paa\u00df. From recombination of genes to the estimation of distributions I. binary parameters. In Parallel Problem Solving from Nature - PPSN IV, pages 178\u2013187, Berlin, September 1996.","DOI":"10.1007\/3-540-61723-X_982"},{"key":"6_CR40_1","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1023\/A:1009687210594","volume":"3","author":"W Nuijten","year":"1998","unstructured":"W. Nuijten and C. Le Pape. Constraint-based job scheduling with ILOG scheduler. Journal of Heuristics, 3:271\u2013286, 1998.","journal-title":"Journal of Heuristics"},{"key":"6_CR41_1","volume-title":"Combinatorial Optimization","author":"CH Papadimitriou","year":"1998","unstructured":"C. H. Papadimitriou and K. Steiglitz. Combinatorial Optimization. Dover Publications Inc., Mineola, NY, 2nd edition, 1998.","edition":"2"},{"key":"6_CR42_1","doi-asserted-by":"crossref","DOI":"10.1007\/b10910","volume-title":"Hierarchial Bayesian Optimization Algorithm","author":"M Pelikan","year":"2005","unstructured":"M. Pelikan. Hierarchial Bayesian Optimization Algorithm. Springer-Verlag, Berlin, 2005."},{"issue":"1","key":"6_CR43_1","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1013500812258","volume":"21","author":"M Pelikan","year":"2002","unstructured":"M. Pelikan, D. E. Goldberg, and F. G. Lobo. A survey of optimization by building and using probabilistic models. Computational Optimization and Applications, 21(1):5\u201320, 2002.","journal-title":"Computational Optimization and Applications"},{"issue":"3","key":"6_CR44_1","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1023\/A:1009694016861","volume":"5","author":"G Pesant","year":"1999","unstructured":"G. Pesant and M. Gendreau. A constraint programming framework for local search methods. Journal of Heuristics, 5(3):255\u2013279, 1999.","journal-title":"Journal of Heuristics"},{"issue":"1","key":"6_CR45_1","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1287\/trsc.32.1.12","volume":"32","author":"G Pesant","year":"1998","unstructured":"G. Pesant, M. Gendreau, J.-Y. Potvinand, and J.-M. Rousseau. An exact constraint logic programming algorithm for the traveling salesman problem with time windows. Transportation Science, 32(1):12\u201329, 1998.","journal-title":"Transportation Science"},{"key":"6_CR46_1","doi-asserted-by":"crossref","unstructured":"J. Puchinger and G. R. Raidl. Combining metaheuristics and exact algorithms in combinatorial optimization: A survey and classification. In J. Mira and J. R. Alvarez, editors, Artificial Intelligence and Knowledge Engineering Applications: A Bioinspired Approach. Springer-Verlag, 2005.","DOI":"10.1007\/11499305_5"},{"key":"6_CR47_1","doi-asserted-by":"crossref","unstructured":"J.-F. Puget. Constraint programming next challenge: Simplicity of use. In Principles and Practice of Constraint Programming\u2014CP\u201904, Toronto, September 2004.","DOI":"10.1007\/978-3-540-30201-8_2"},{"key":"6_CR48_1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-4321-0","volume-title":"The Cross-Entropy Method: A Unified Approach to Combinatorial Optimization, Monte-Carlo Simulation, and Machine Learning","author":"RY Rubinstein","year":"2004","unstructured":"R. Y. Rubinstein and D. P. Kroese. The Cross-Entropy Method: A Unified Approach to Combinatorial Optimization, Monte-Carlo Simulation, and Machine Learning. Springer-Verlag, Berlin, 2004."},{"issue":"3","key":"6_CR49_1","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1109\/4235.873238","volume":"4","author":"TP Runarsson","year":"2000","unstructured":"T. P. Runarsson and X. Yao. Stochastic ranking for constrained evolutionary optimization. IEEE Transactions on Evolutionary Computation, 4(3):284\u2014294, 2000.","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"6_CR50_1","volume-title":"Evolution and Optimum Seeking","author":"H-P Schwefel","year":"1995","unstructured":"H.-P. Schwefel. Evolution and Optimum Seeking. Wiley, New York, 1995."},{"issue":"11","key":"6_CR51_1","doi-asserted-by":"publisher","first-page":"859","DOI":"10.1007\/s001700200097","volume":"19","author":"HJ Shin","year":"2002","unstructured":"H. J. Shin, C.-O. Kim, and S. S. Kim. A tabu search algorithm for single machine scheduling with release times, due dates, and sequence-dependent set-up times. International Journal of Advanced Manufacturing Technology, 19(11):859\u2013866, 2002.","journal-title":"International Journal of Advanced Manufacturing Technology"},{"key":"6_CR52_1","doi-asserted-by":"crossref","unstructured":"K. Socha, J. Knowels, and M. Sampels. A MAX-MIN ant system for the university course timetabling problem. In International Workshop on Ant Algorithms (ANTS 2002), Brussels, September 2002.","DOI":"10.1007\/3-540-45724-0_1"},{"key":"6_CR53_1","doi-asserted-by":"crossref","unstructured":"K. Socha, M. Sampels, and M. Manfrin. Ant algorithms for the university course timetabling problem with regard to the state-of-the-art. In European Workshop on Evolutionary Computation in Combinatorial Optimization (EvoCOP 2003), April 2003.","DOI":"10.1007\/3-540-36605-9_31"},{"issue":"8","key":"6_CR54_1","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1016\/S0167-739X(00)00043-1","volume":"16","author":"T St\u00fctzle","year":"2000","unstructured":"T. St\u00fctzle and H. H. Hoos. MAX-MIN ant system. Future Generation Computer Systems, 16(8):889\u2013914, 2000.","journal-title":"Future Generation Computer Systems"},{"key":"6_CR55_1","volume-title":"The OPL Optimization Programming Language","author":"P Hentenryck Van","year":"1999","unstructured":"P. Van Hentenryck. The OPL Optimization Programming Language. MIT Press, Cambridge, MA, 1999."},{"key":"6_CR56_1","unstructured":"P. Van Hentenryck and L. Michel. Synthesis of constraint-based local search algorithms from high-level models. In AAAI-07, Vancouver, July 2007."},{"key":"6_CR57_1","doi-asserted-by":"crossref","unstructured":"V. C. S. Wiers. A review of the applicability of OR and AI scheduling techniques in practice. Omega, 25(2), 1997.","DOI":"10.1016\/S0305-0483(96)00050-3"},{"key":"6_CR58_1","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1023\/B:ANOR.0000039526.52305.af","volume":"131","author":"M Zlochin","year":"2004","unstructured":"M. Zlochin, M. Birattari, N. Meuleau, and M. Dorigo. Model-based search for combinatorial optimization: A critical survey. Annals of Operations Research, 131:373\u2013395, 2004.","journal-title":"Annals of Operations Research"}],"container-title":["Studies in Computational Intelligence","Hybrid Metaheuristics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-78295-7_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:14:02Z","timestamp":1606184042000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-78295-7_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540782940","9783540782957"],"references-count":58,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-78295-7_6","relation":{},"ISSN":["1860-949X"],"issn-type":[{"type":"print","value":"1860-949X"}],"subject":[],"published":{"date-parts":[[2008]]}}}