{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,17]],"date-time":"2023-11-17T02:21:53Z","timestamp":1700187713898},"publisher-location":"Berlin, Heidelberg","reference-count":119,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540428985","type":"print"},{"value":"9783540456124","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45612-0_1","type":"book-chapter","created":{"date-parts":[[2007,5,4]],"date-time":"2007-05-04T00:24:18Z","timestamp":1178238258000},"page":"1-23","source":"Crossref","is-referenced-by-count":60,"title":["Meta-heuristics: The State of the Art"],"prefix":"10.1007","author":[{"given":"Stefan","family":"Vo\u00df","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,10,29]]},"reference":[{"key":"1_CR1","volume-title":"Local Search in Combinatorial Optimization","year":"1997","unstructured":"E.H.L. Aarts and J.K. Lenstra, editors. Local Search in Combinatorial Optimization. Wiley, Chichester, 1997."},{"key":"1_CR2","first-page":"163","volume-title":"Annotated Bibliographies in Combinatorial Optimization","author":"E.H.L. Aarts","year":"1997","unstructured":"E.H.L. Aarts and M. Verhoeven. Local search. In M. Dell\u2019Amico, F. Maffioli, and S. Martello, editors, Annotated Bibliographies in Combinatorial Optimization, pages 163\u2013180. Wiley, Chichester, 1997."},{"key":"1_CR3","unstructured":"R.K. Ahuja, O. Ergun, J.B. Orlin, and A.B. Punnen. A survey of very large-scale neighborhood search techniques. Working paper, Sloan School of Management, MIT, 1999."},{"key":"1_CR4","first-page":"361","volume-title":"Local Search in Combinatorial Optimization","author":"E.J. Anderson","year":"1997","unstructured":"E.J. Anderson, C.A. Glass, and C.N. Potts. Machine scheduling. In E.H.L. Aarts and J.K. Lenstra, editors, Local Search in Combinatorial Optimization, pages 361\u2013414. Wiley, Chichester, 1997."},{"key":"1_CR5","first-page":"33","volume-title":"Proceedings of the 26th Conference on Technology of Object-Oriented Languages and Systems (TOOLS USA\u201998)","author":"A.A. Andreatta","year":"1998","unstructured":"A.A. Andreatta, S.E.R. Carvalho, and C.C. Ribeiro. An object-oriented framework for local search heuristics. In Proceedings of the 26th Conference on Technology of Object-Oriented Languages and Systems (TOOLS USA\u201998), pages 33\u201345. IEEE, Piscataway, 1998."},{"key":"1_CR6","volume-title":"Handbook of Evolutionary Computation","year":"1997","unstructured":"T. B\u00e4ck, D.B. Fogel, and Z. Michalewicz, editors. Handbook of Evolutionary Computation. Institute of Physics Publishing, Bristol, 1997."},{"key":"1_CR7","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/BF02430363","volume":"1","author":"R.S. Barr","year":"1995","unstructured":"R.S. Barr, B.L. Golden, J.P. Kelly, M.G.C. Resende, and W.R. Stewart. Designing and reporting on computational experiments with heuristic methods. Journal of Heuristics, 1:9\u201332, 1995.","journal-title":"Journal of Heuristics"},{"key":"1_CR8","first-page":"61","volume-title":"Modern Heuristic Search Methods","author":"R. Battiti","year":"1996","unstructured":"R. Battiti. Reactive search: Toward self-tuning heuristics. In V.J. Rayward-Smith, I.H. Osman, C.R. Reeves, and G.D. Smith, editors, Modern Heuristic Search Methods, pages 61\u201383. Wiley, Chichester, 1996."},{"key":"1_CR9","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1023\/A:1009634810396","volume":"5","author":"D.P. Bertsekas","year":"1999","unstructured":"D.P. Bertsekas and D.A. Castanon. Rollout algorithms for stochastic scheduling problems. Journal of Heuristics, 5:89\u2013108, 1999.","journal-title":"Journal of Heuristics"},{"key":"1_CR10","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1023\/A:1009635226865","volume":"3","author":"D.P. Bertsekas","year":"1997","unstructured":"D.P. Bertsekas, J.N. Tsitsiklis, and C. Wu. Rollout algorithms for combinatorial optimization. Journal of Heuristics, 3:245\u2013262, 1997.","journal-title":"Journal of Heuristics"},{"key":"1_CR11","first-page":"1","volume-title":"Computational Intelligence: Imitating Life","author":"J.C. Bezdek","year":"1994","unstructured":"J.C. Bezdek. What is Computational Intelligence. In J.M. Zurada, R.J. Marks II, and C.J. Robinson, editors, Computational Intelligence: Imitating Life, pages 1\u201312. IEEE Press, New York, 1994."},{"key":"1_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1007\/978-3-540-48085-3_11","volume-title":"Principles and Practice of Constraint Programming-CP\u2019 99","author":"Y. Caseau","year":"1999","unstructured":"Y. Caseau, F. Laburthe, and G. Silverstein. A meta-heuristic factory for vehicle routing problems. In J. Jaffar, editor, Principles and Practice of Constraint Programming-CP\u2019 99, Lecture Notes in Computer Science 1713, pages 144\u2013158. Springer, Berlin, 1999."},{"key":"1_CR13","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/0167-6377(93)90023-A","volume":"14","author":"I. Charon","year":"1993","unstructured":"I. Charon and O. Hudry. The noising method: A new method for combinatorial optimization. Operations Research Letters, 14:133\u2013137, 1993.","journal-title":"Operations Research Letters"},{"key":"1_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0004-3702(00)00053-9","volume":"123","author":"K.M.F. Choi","year":"2000","unstructured":"K.M.F. Choi, J.H.M. Lee, and P.J. Stuckey. A Lagrangian reconstruction of GENET. Artificial Intelligence, 123:1\u201339, 2000.","journal-title":"Artificial Intelligence"},{"key":"1_CR15","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1287\/ijoc.9.1.61","volume":"9","author":"T.G. Crainic","year":"1997","unstructured":"T.G. Crainic, M. Toulouse, and M. Gendreau. Toward a taxonomy of parallel tabu search heuristics. INFORMS Journal on Computing, 9:61\u201372, 1997.","journal-title":"INFORMS Journal on Computing"},{"key":"1_CR16","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1023\/A:1009621410177","volume":"6","author":"B. Backer de","year":"2000","unstructured":"B. de Backer, V. Furnon, P. Shaw, P. Kilby, and P. Prosser. Solving vehicle routing problems using constraint programming and metaheuristics. Journal of Heuristics, 6:501\u2013523, 2000.","journal-title":"Journal of Heuristics"},{"key":"1_CR17","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1109\/3477.484436","volume":"B-26","author":"M. Dorigo","year":"1996","unstructured":"M. Dorigo, V. Maniezzo, and A. Colorni. Ant system: Optimization by a colony of cooperating agents. IEEE Transactions on Systems, Man and Cybernetics, B-26:29\u201341, 1996.","journal-title":"IEEE Transactions on Systems, Man and Cybernetics"},{"key":"1_CR18","unstructured":"A. Dowsland. Simulated annealing. In C. Reeves, editor, Modern Heuristic Techniques for Combinatorial Problems, pages 20\u201369. Halsted, Blackwell, 1993."},{"key":"1_CR19","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/0021-9991(90)90201-B","volume":"90","author":"G. Dueck","year":"1990","unstructured":"G. Dueck and T. Scheuer. Threshold accepting: a general purpose optimization algorithm appearing superior to simulated annealing. Journal of Computational Physics, 90:161\u2013175, 1990.","journal-title":"Journal of Computational Physics"},{"key":"1_CR20","doi-asserted-by":"crossref","unstructured":"C.W. Duin and S. Vo\u03b2. Steiner tree heuristics-a survey. In H. Dyckhoff, U. Derigs, M. Salomon, and H.C. Tijms, editors, Operations Research Proceedings 1993, pages 485\u2013496, Berlin, 1994. Springer.","DOI":"10.1007\/978-3-642-78910-6_160"},{"key":"1_CR21","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1002\/(SICI)1097-0037(199910)34:3<181::AID-NET2>3.0.CO;2-Y","volume":"34","author":"C.W. Duin","year":"1999","unstructured":"C.W. Duin and S. Vo\u03b2. The pilot method: A strategy for heuristic repetition with application to the Steiner problem in graphs. Networks, 34:181\u2013191, 1999.","journal-title":"Networks"},{"key":"1_CR22","doi-asserted-by":"publisher","first-page":"635","DOI":"10.1016\/0305-0548(91)90001-8","volume":"18","author":"T.A. Feo","year":"1991","unstructured":"T.A. Feo, K. Venkatraman, and J.F. Bard. A GRASP for a difficult single machine scheduling problem. Computers & Operations Research, 18:635\u2013643, 1991.","journal-title":"Computers & Operations Research"},{"key":"1_CR23","volume-title":"Working paper","author":"A. Fink","year":"1999","unstructured":"A. Fink and S. Vo\u03b2. Applications of modern heuristic search methods to continuous flow-shop scheduling problems. Working paper, Technische Universit\u00e4t Braunschweig, Germany, 1999."},{"key":"1_CR24","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/S0360-8352(99)00074-1","volume":"37","author":"A. Fink","year":"1999","unstructured":"A. Fink and S. Vo\u03b2. Generic metaheuristics application to industrial engineering problems. Computers & Industrial Engineering, 37:281\u2013284, 1999.","journal-title":"Computers & Industrial Engineering"},{"key":"1_CR25","first-page":"153","volume-title":"Proceedings of the 4th INFORMS Conference on Information Systems and Technology","author":"A. Fink","year":"1999","unstructured":"A. Fink, S. Vo\u03b2, and D.L. Woodruff. An adoption path for intelligent heuristic search componentware. In E. Rolland and N.S. Umanath, editors, Proceedings of the 4th INFORMS Conference on Information Systems and Technology, pages 153\u2013168. INFORMS, Linthicum, 1999."},{"key":"1_CR26","series-title":"DIM ACS Series in Discrete Mathematics and Theoretical Computer Science","doi-asserted-by":"crossref","first-page":"619","DOI":"10.1090\/dimacs\/026\/29","volume-title":"Cliques, Coloring, and Satisfiability: Second DIM ACS Implementation Challenge","author":"C. Fleurent","year":"1996","unstructured":"C. Fleurent and J.A. Ferland. Object-oriented implementation of heuristic search methods for graph coloring, maximum clique, and satisfiability. In D.S. Johnson and M.A. Trick, editors, Cliques, Coloring, and Satisfiability: Second DIM ACS Implementation Challenge, volume 26 of DIM ACS Series in Discrete Mathematics and Theoretical Computer Science, pages 619\u2013652. AMS, Princeton, 1996."},{"key":"1_CR27","first-page":"23","volume-title":"Proceedings of the Second Annual Conference on Evolutionary Programming","author":"D.B. Fogel","year":"1993","unstructured":"D.B. Fogel. On the philosophical differences between evolutionary algorithms and genetic algorithms. In D.B. Fogel and W. Atmar, editors, Proceedings of the Second Annual Conference on Evolutionary Programming, pages 23\u201329. Evolutionary Programming Society, La Jolla, 1993."},{"key":"1_CR28","volume-title":"Evolutionary Computation: Toward a New Philosophy of Machine Intelligence","author":"D.B. Fogel","year":"1995","unstructured":"D.B. Fogel. Evolutionary Computation: Toward a New Philosophy of Machine Intelligence. IEEE Press, New York, 1995."},{"key":"1_CR29","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1287\/ijoc.12.3.237.12636","volume":"12","author":"L.M. Gambardella","year":"2000","unstructured":"L.M. Gambardella and M. Dorigo. An ant colony system hybridized with a new local search for the sequential ordering problem. INFORMS Journal on Computing, 12:237\u2013255, 2000.","journal-title":"INFORMS Journal on Computing"},{"key":"1_CR30","volume-title":"Computers and Intractability, A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"M.R. Garey and D.S. Johnson. Computers and Intractability, A Guide to the Theory of NP-Completeness. Freeman, New York, 1979."},{"key":"1_CR31","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1111\/j.1540-5915.1977.tb01074.x","volume":"8","author":"F. Glover","year":"1977","unstructured":"F. Glover. Heuristics for integer programming using surrogate constraints. Decision Sciences, 8:156\u2013166, 1977.","journal-title":"Decision Sciences"},{"key":"1_CR32","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1016\/0305-0548(86)90048-1","volume":"13","author":"F. Glover","year":"1986","unstructured":"F. Glover. Future paths for integer programming and links to artificial intelligence. Computers & Operations Research, 13:533\u2013549, 1986.","journal-title":"Computers & Operations Research"},{"key":"1_CR33","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","volume":"2","author":"F. Glover","year":"1990","unstructured":"F. Glover. Tabu search-Part II. ORSA Journal on Computing, 2:4\u201332, 1990.","journal-title":"ORSA Journal on Computing"},{"key":"1_CR34","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/BF01719256","volume":"17","author":"F. Glover","year":"1995","unstructured":"F. Glover. Scatter search and star-paths: beyond the genetic metaphor. OR Spektrum, 17:125\u2013137, 1995.","journal-title":"OR Spektrum"},{"key":"1_CR35","first-page":"1","volume-title":"Interfaces in Computer Science and Operations Research: Advances in Metaheuristics, Optimization, and Stochastic Modeling Technologies","author":"F. Glover","year":"1997","unstructured":"F. Glover. Tabu search and adaptive memory programming-Advances, applications and challenges. In R.S. Barr, R.V. Helgason, and J.L. Kennington, editors, Interfaces in Computer Science and Operations Research: Advances in Metaheuristics, Optimization, and Stochastic Modeling Technologies, pages 1\u201375. Kluwer, Boston, 1997."},{"key":"1_CR36","doi-asserted-by":"crossref","unstructured":"F. Glover, editor. Tabu Search Methods for Optimization. European Journal of Operational Research 106:221\u2013692. Elsevier, Amsterdam, 1998.","DOI":"10.1016\/S0377-2217(97)00259-2"},{"key":"1_CR37","doi-asserted-by":"crossref","volume-title":"Tabu Search","author":"F. Glover","year":"1997","unstructured":"F. Glover and M. Laguna. Tabu Search. Kluwer, Boston, 1997.","DOI":"10.1007\/978-1-4615-6089-0"},{"key":"1_CR38","volume-title":"Genetic Algorithms in Search, Optimization, and Machine Learning","author":"D.E. Goldberg","year":"1989","unstructured":"D.E. Goldberg. Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, Reading, 1989."},{"key":"1_CR39","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1016\/S0377-2217(97)00123-9","volume":"103","author":"S. Grolimund","year":"1997","unstructured":"S. Grolimund and J.-G. Ganascia. Driving tabu search with case-based reasoning. European Journal of Operational Research, 103:326\u2013338, 1997.","journal-title":"European Journal of Operational Research"},{"key":"1_CR40","unstructured":"T. Gr\u00fcnert. Lagrangean tabu search. In C.C. Ribeiro, editor, Third Metaheuristics International Conference: Extended Abstracts, pages 263\u2013267, 1999."},{"key":"1_CR41","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/S0166-218X(99)00035-9","volume":"96","author":"J. Gu","year":"1999","unstructured":"J. Gu. The Multi-SAT algorithm. Discrete Applied Mathematics, 96\u201397:111\u2013126, 1999.","journal-title":"Discrete Applied Mathematics"},{"key":"1_CR42","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":"P. Hansen and N. Mladenovi\u0107. An introduction to variable neighborhood search. In S. Vo\u03b2, S. Martello, I.H. Osman, and C. Roucairol, editors, Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization, pages 433\u2013458. Kluwer, Boston, 1999."},{"key":"1_CR43","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/0167-6377(87)90021-6","volume":"6","author":"J.P. Hart","year":"1987","unstructured":"J.P. Hart and A.W. Shogan. Semi-greedy heuristics: An empirical study. Operations Research Letters, 6:107\u2013114, 1987.","journal-title":"Operations Research Letters"},{"key":"1_CR44","unstructured":"W. Harvey and M. Ginsberg. Limited discrepancy search. In Proceedings of the 14th IJCAI, pages 607\u2013615, San Mateo, 1995. Morgan Kaufmann."},{"key":"1_CR45","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1057\/palgrave.jors.2600730","volume":"50","author":"S. Heipcke","year":"1999","unstructured":"S. Heipcke. Comparing constraint programming and mathematical programming approaches to discrete optimisation-the change problem. Journal of the Operational Research Society, 50:581\u2013595, 1999.","journal-title":"Journal of the Operational Research Society"},{"key":"1_CR46","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0377-2217(99)00435-X","volume":"126","author":"A. Hertz","year":"2000","unstructured":"A. Hertz and D. Kobler. A framework for the description of evolutionary algorithms. European Journal of Operational Research, 126:1\u201312, 2000.","journal-title":"European Journal of Operational Research"},{"key":"1_CR47","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1007\/BFb0029787","volume-title":"Parallel Problem Solving from Nature-PPSN I","author":"F. Hoffmeister","year":"1991","unstructured":"F. Hoffmeister and T. B\u00e4ck. Genetic algorithms and evolution strategies: Similarities and differences. In H.-P. Schwefel and R. M\u00e4nner, editors, Parallel Problem Solving from Nature-PPSN I, Lecture Notes in Computer Science 496, pages 455\u2013469. Springer, Berlin, 1991."},{"key":"1_CR48","volume-title":"Adaptation in Natural and Artificial Systems","author":"J.H. Holland","year":"1975","unstructured":"J.H. Holland. Adaptation in Natural and Artificial Systems. The University of Michigan Press, Ann Arbor, 1975."},{"key":"1_CR49","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/BF02430364","volume":"1","author":"J.N. Hooker","year":"1995","unstructured":"J.N. Hooker. Testing heuristics: We have it all wrong. Journal of Heuristics, 1:33\u201342, 1995.","journal-title":"Journal of Heuristics"},{"key":"1_CR50","first-page":"1","volume-title":"Advances in Computational and Stochastic Optimization, Logic Programming, and Heuristic Search","author":"J.N. Hooker","year":"1998","unstructured":"J.N. Hooker. Constraint satisfaction methods for generating valid cuts. In D.L. Woodruff, editor, Advances in Computational and Stochastic Optimization, Logic Programming, and Heuristic Search, pages 1\u201330. Kluwer, Boston, 1998."},{"key":"1_CR51","unstructured":"H.H. Hoos and T. St\u00fctzle. Evaluating Las Vegas algorithms-Pitfalls and remedies. In Proceedings of UAI-98, pages 238\u2013245. 1998."},{"key":"1_CR52","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1023\/A:1006350622830","volume":"24","author":"H.H. Hoos","year":"2000","unstructured":"H.H. Hoos and T. St\u00fctzle. Local search algorithms for SAT. Journal of Automated Reasoning, 24:421\u2013481, 2000.","journal-title":"Journal of Automated Reasoning"},{"key":"1_CR53","unstructured":"HOTFRAME\/Heuristic Optimization Framework. http:\/\/www.winforms.phil.tubs.de\/research\/hotframe.htm , 2000."},{"key":"1_CR54","first-page":"33","volume":"25","author":"L. Ingber","year":"1996","unstructured":"L. Ingber. Adaptive simulated annealing (ASA): Lessons learned. Control and Cybernetics, 25:33\u201354, 1996.","journal-title":"Control and Cybernetics"},{"key":"1_CR55","series-title":"Lect Notes Comput Sci","volume-title":"Principles and Practice of Constraint Programming-CP\u2019 99","year":"1999","unstructured":"J. Jaffar, editor. Principles and Practice of Constraint Programming-CP\u2019 99. Lecture Notes in Computer Science 1713. Springer, Berlin, 1999."},{"key":"1_CR56","unstructured":"Y. Jiang, H. Kautz, and B. Selman. Solving problems with hard and soft constraints using a stochastic algorithm for MAX-SAT. Technical report, AT&T Bell Laboratories, 1995."},{"key":"1_CR57","doi-asserted-by":"crossref","first-page":"865","DOI":"10.1287\/opre.37.6.865","volume":"37","author":"D.S. Johnson","year":"1989","unstructured":"D.S. Johnson, C.R. Aragon, L.A. McGeoch, and C. Schevon. Optimization by simulated annealing: An experimental evaluation; part i, graph partitioning. Operations Research, 37:865\u2013892, 1989.","journal-title":"Operations Research"},{"key":"1_CR58","volume-title":"Technical report","author":"M.S. Jones","year":"2000","unstructured":"M.S. Jones, G.P. McKeown, and V.J. Rayward-Smith. Distribution, cooperation, and hybridization for combinatorial optimization. Technical report, University of East Anglia, Norwich, 2000."},{"key":"1_CR59","doi-asserted-by":"publisher","first-page":"893","DOI":"10.1109\/43.144853","volume":"11","author":"A.B. Kahng","year":"1992","unstructured":"A.B. Kahng and G. Robins. A new class of iterative Steiner tree heuristics with good performance. IEEE Transactions on Computer-Aided Design, 11:893\u2013902, 1992.","journal-title":"IEEE Transactions on Computer-Aided Design"},{"key":"1_CR60","unstructured":"H. Kautz and B. Selman. Pushing the envelope: Planning, propositional logic, and stochastic search. In Proceedings of the 13th National Conference on Artificial Intelligence (AAAI-96), pages 1194\u20131201. 1996."},{"key":"1_CR61","series-title":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science","first-page":"573","volume-title":"The Satisfiability Problem: Theory and Applications","author":"H. K. Selman","year":"1997","unstructured":"H. Kautz, Selman, and Y. Jiang. General stochastic approach to solving problems with hard and soft constraints. In D. Gu, J. Du, and P. Pardalos, editors, The Satisfiability Problem: Theory and Applications, DIMACS Series in Discrete Mathematics and Theoretical Computer Science 35, pages 573\u2013586. AMS, Providence, 1997."},{"key":"1_CR62","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S. Kirkpatrick","year":"1983","unstructured":"S. Kirkpatrick, C.D. Gelatt Jr., and M.P. Vecchi. Optimization by simulated annealing. Science, 220:671\u2013680, 1983.","journal-title":"Science"},{"key":"1_CR63","series-title":"Annals of Operations Research","volume-title":"Metaheuristics in Combinatorial Optimization","year":"1996","unstructured":"G. Laporte and I.H. Osman, editors. Metaheuristics in Combinatorial Optimization. Annals of Operations Research 63. Baltzer, Amsterdam, 1996."},{"key":"1_CR64","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/0004-3702(78)90029-2","volume":"10","author":"J.L. Lauriere","year":"1978","unstructured":"J.L. Lauriere. A language and a program for stating and solving combinatorial problems. Artificial Intelligence, 10:29\u2013127, 1978.","journal-title":"Artificial Intelligence"},{"key":"1_CR65","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1287\/opre.21.2.498","volume":"21","author":"S. Lin","year":"1973","unstructured":"S. Lin and B.W. Kernighan. An effective heuristic algorithm for the traveling-salesman problem. Operations Research, 21:498\u2013516, 1973.","journal-title":"Operations Research"},{"key":"1_CR66","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/ijoc.8.1.1","volume":"8","author":"C. McGeoch","year":"1996","unstructured":"C. McGeoch. Toward an experimental method for algorithm simulation. INFORMS Journal on Computing, 8:1\u201315, 1996.","journal-title":"INFORMS Journal on Computing"},{"key":"1_CR67","volume-title":"Genetic Algorithms + Data Structures = Evolution Programs","author":"Z. Michalewicz","year":"1999","unstructured":"Z. Michalewicz. Genetic Algorithms + Data Structures = Evolution Programs. Springer, Berlin, 3rd edition, 1999.","edition":"3rd edition"},{"key":"1_CR68","volume-title":"How to Solve It: Modern Heuristics","author":"Z. Michalewicz","year":"1999","unstructured":"Z. Michalewicz and D.B. Fogel. How to Solve It: Modern Heuristics. Springer, Berlin, 1999."},{"key":"1_CR69","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/ijoc.11.1.1","volume":"11","author":"L. Michel","year":"1999","unstructured":"L. Michel and P. van Hentenryck. LOCALIZER: A modeling language for local search. INFORMS Journal on Computing, 11:1\u201314, 1999.","journal-title":"INFORMS Journal on Computing"},{"key":"1_CR70","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1023\/A:1009818401322","volume":"5","author":"L. Michel","year":"2000","unstructured":"L. Michel and P. van Hentenryck. Localizer. Constraints, 5:43\u201384, 2000.","journal-title":"Constraints"},{"key":"1_CR71","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/BF02022564","volume":"41","author":"P. Moscato","year":"1993","unstructured":"P. Moscato. An introduction to population approaches for optimization and hierarchical objective functions: A discussion on the role of tabu search. Annals of Operations Research, 41:85\u2013121, 1993.","journal-title":"Annals of Operations Research"},{"key":"1_CR72","first-page":"137","volume-title":"Local Search in Combinatorial Optimization","author":"H. M\u00fchlenbein","year":"1997","unstructured":"H. M\u00fchlenbein. Genetic algorithms. In E.H.L. Aarts and J.K. Lenstra, editors, Local Search in Combinatorial Optimization, pages 137\u2013171. Wiley, Chichester, 1997."},{"key":"1_CR73","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0377-2217(81)90024-2","volume":"8","author":"H. M\u00fcller-Merbach","year":"1981","unstructured":"H. M\u00fcller-Merbach. Heuristics and their design: a survey. European Journal of Operational Research, 8:1\u201323, 1981.","journal-title":"European Journal of Operational Research"},{"key":"1_CR74","series-title":"DIMACS","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1090\/dimacs\/057\/02","volume-title":"Constraint Programming and Large Scale Discrete Optimization","author":"A. Nareyek","year":"2001","unstructured":"A. Nareyek. Using Global Constraints for Local Search. In E. C. Freuder and R. J. Wallace, editors, Constraint Programming and Large Scale Discrete Optimization, DIMACS Volume 57, pages 9\u201328. American Mathematical Society Publications, Providence, 2001."},{"key":"1_CR75","doi-asserted-by":"crossref","unstructured":"A. Nareyek. Beyond the Plan-Length Criterion. In A. Nareyek, editor, Local Search for Planning and Scheduling. Springer LNAI 2048, Berlin, 2001. (this volume)","DOI":"10.1007\/3-540-45612-0_4"},{"key":"1_CR76","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/BF01720977","volume":"17","author":"I.H. Osman","year":"1995","unstructured":"I.H. Osman. Heuristics for the generalized assignment problem: simulated annealing and tabu search approaches. OR Spektrum, 17:211\u2013225, 1995.","journal-title":"OR Spektrum"},{"key":"1_CR77","volume-title":"Meta-Heuristics: Theory and Applications","year":"1996","unstructured":"I.H. Osman and J.P. Kelly, editors. Meta-Heuristics: Theory and Applications. Kluwer, Boston, 1996."},{"key":"1_CR78","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1007\/BF02125421","volume":"63","author":"I.H. Osman","year":"1996","unstructured":"I.H. Osman and G. Laporte. Metaheuristics: A bibliography. Annals of Operations Research, 63:513\u2013623, 1996.","journal-title":"Annals of Operations Research"},{"key":"1_CR79","volume-title":"Heuristics: Intelligent Search Strategies for Computer Problem Solving","author":"J. Pearl","year":"1984","unstructured":"J. Pearl. Heuristics: Intelligent Search Strategies for Computer Problem Solving. Addison-Wesley, Reading, 1984."},{"key":"1_CR80","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:255\u2013279, 1999.","journal-title":"Journal of Heuristics"},{"key":"1_CR81","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/S0166-218X(96)00123-0","volume":"76","author":"E. Pesch","year":"1997","unstructured":"E. Pesch and F. Glover. TSP ejection chains. Discrete Applied Mathematics, 76:165\u2013182, 1997.","journal-title":"Discrete Applied Mathematics"},{"key":"1_CR82","doi-asserted-by":"crossref","unstructured":"E. Pesch and S. Vo\u03b2, editors. Applied Local Search. OR Spektrum 17:55\u2013225. Springer, Berlin, 1995.","DOI":"10.1007\/BF01719248"},{"key":"1_CR83","doi-asserted-by":"crossref","volume-title":"How to solve it","author":"G. Polya","year":"1945","unstructured":"G. Polya. How to solve it. Princeton University Press, Princeton, 1945.","DOI":"10.1515\/9781400828678"},{"key":"1_CR84","unstructured":"C. Potts and S. van de Velde. Dynasearch-iterative local improvement by dynamic programming. Technical report, University of Twente, 1995."},{"key":"1_CR85","unstructured":"V.J. Rayward-Smith, editor. Applications of Modern Heuristic Methods Waller, Henley-on-Thames, 1995."},{"key":"1_CR86","volume-title":"Modern Heuristic Search Methods","year":"1996","unstructured":"V.J. Rayward-Smith, I.H. Osman, C.R. Reeves, and G.D. Smith, editors. Modern Heuristic Search Methods. Wiley, Chichester, 1996."},{"key":"1_CR87","volume-title":"Modern Heuristic Techniques for Combinatorial Problems","year":"1993","unstructured":"C.R. Reeves, editor. Modern Heuristic Techniques for Combinatorial Problems. Blackwell, Oxford, 1993."},{"key":"1_CR88","unstructured":"C.C. Ribeiro, E. Uchoa, and R.F. Werneck. A hybrid GRASP with perturbations for the Steiner problem in graphs. Technical report, Department of Computer Science, Catholic University of Rio de Janeiro, 2000."},{"key":"1_CR89","volume-title":"Technical report","author":"L.-M. Rousseau","year":"2000","unstructured":"L.-M. Rousseau, M. Gendreau, and G. Pesant. Using constraint-based operators to solve the vehicle routing problem with time windows. Technical report, CRT, University of Montreal, Canada, 2000."},{"key":"1_CR90","volume-title":"Iterative Computer Algorithms with Applications in Engineering: Solving Combinatorial Optimization Problems","author":"S.M. Sait","year":"1999","unstructured":"S.M. Sait and H. Youssef. Iterative Computer Algorithms with Applications in Engineering: Solving Combinatorial Optimization Problems. IEEE Computer Society Press, Los Alamitos, 1999."},{"key":"1_CR91","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/978-1-4615-6135-4_7","volume-title":"Fuzzy Evolutionary Computation","author":"M. Sakawa","year":"1997","unstructured":"M. Sakawa and T. Shibano. Multiobjective fuzzy satisficing methods for 0-1 knapsack problems through genetic algorithms. In W. Pedrycz, editor, Fuzzy Evolutionary Computation, pages 155\u2013177. Kluwer, Boston, 1997."},{"key":"1_CR92","unstructured":"D. Schuurmans and F. Southey. Local search characteristics of incomplete SAT procedures. In Proceedings of the 17th National Conference on Artificial Intelligence (AAAI-2000), pages 297\u2013302. 2000."},{"key":"1_CR93","first-page":"1","volume-title":"Genetic Algorithms and Evolution Strategy in Engineering and Computer Science: Recent Advances and Industrial Applications","author":"H.-P. Schwefel","year":"1998","unstructured":"H.-P. Schwefel and T. B\u00e4ck. Artificial evolution: How and why? In D. Quagliarella, J. P\u00e9riaux, C. Poloni, and G. Winter, editors, Genetic Algorithms and Evolution Strategy in Engineering and Computer Science: Recent Advances and Industrial Applications, pages 1\u201319. Wiley, Chichester, 1998."},{"key":"1_CR94","unstructured":"B. Selman, H. Kautz, and B. Cohen. Noise strategies for improving local search. In Proceedings of the 11th National Conference on Artificial Intelligence (AAAI-94), pages 337\u2013343. 1994."},{"key":"1_CR95","unstructured":"B. Selman, H. Levesque, and D. Mitchell. A new method for solving hard satisfiability problems. In Proceedings of the 9th National Conference on Artificial Intelligence (AAAI-92), pages 440\u2013446. 1992."},{"key":"1_CR96","volume-title":"Working paper","author":"P. Shaw","year":"1998","unstructured":"P. Shaw. Using constraint programming and local search methods to solve vehicle routing problems. Working paper, ILOG S.A., Gentilly, France, 1998."},{"key":"1_CR97","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1287\/ijoc.11.1.15","volume":"11","author":"K. Smith","year":"1999","unstructured":"K. Smith. Neural networks for combinatorial optimisation: A review of more than a decade of research. INFORMS Journal on Computing, 11:15\u201334, 1999.","journal-title":"INFORMS Journal on Computing"},{"key":"1_CR98","volume-title":"Performance Analysis Methods for Heuristic Search Optimization with an Application to Cooperative Agent Algorithms","author":"L. Sondergeld","year":"2001","unstructured":"L. Sondergeld. Performance Analysis Methods for Heuristic Search Optimization with an Application to Cooperative Agent Algorithms. Shaker, Aachen, 2001."},{"key":"1_CR99","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1287\/ijoc.7.4.453","volume":"7","author":"R.H. Storer","year":"1995","unstructured":"R.H. Storer, S.D. Wu, and R. Vaccari. Problem and heuristic space search strategies for job shop scheduling. ORSA Journal on Computing, 7:453\u2013467, 1995.","journal-title":"ORSA Journal on Computing"},{"key":"1_CR100","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1007\/978-1-4615-5775-3_22","volume-title":"Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization","author":"T. St\u00fctzle","year":"1999","unstructured":"T. St\u00fctzle and H. Hoos. The max-min ant system and local search for combinatorial optimization problems. In S. Voss, S. Martello, I.H. Osman, and C. Roucairol, editors, Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization, pages 313\u2013329. Kluwer, Boston, 1999."},{"key":"1_CR101","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/978-1-4615-4567-5_7","volume-title":"Computing Tools for Modeling, Optimization and Simulation","author":"E. Taillard","year":"2000","unstructured":"E. Taillard. An introduction to ant systems. In M. Laguna and J.L. Gonzalez-Velarde, editors, Computing Tools for Modeling, Optimization and Simulation, pages 131\u2013144. Kluwer, Boston, 2000."},{"key":"1_CR102","unstructured":"E. Taillard and S. Vo\u03b2. Popmusic. Working paper, University of Applied Sciences of Western Switzerland, 1999."},{"key":"1_CR103","volume-title":"Technical Report IDSIA-19-98","author":"E.D. Taillard","year":"1998","unstructured":"E.D. Taillard, L.M. Gambardella, M. Gendreau, and J.-Y. Potvin. Adaptive memory programming: A unified view of meta-heuristics. Technical Report IDSIA-19-98, Istituto Dalle Molle di Studi sull\u2019Intelligenza Artificiale, Lugano, 1998."},{"key":"1_CR104","doi-asserted-by":"publisher","first-page":"969","DOI":"10.1016\/S0305-0548(97)00093-2","volume":"25","author":"R.J.M. Vaessens","year":"1998","unstructured":"R.J.M. Vaessens, E.H.L. Aarts, and J.K. Lenstra. A local search template. Computers & Operations Research, 25:969\u2013979, 1998.","journal-title":"Computers & Operations Research"},{"key":"1_CR105","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"564","DOI":"10.1007\/3-540-60299-2_35","volume-title":"Principles and Practice of Constraint Programming-CP\u2019 95","author":"P. Hentenryck van","year":"1995","unstructured":"P. van Hentenryck. Constraint solving for combinatorial search problems: A tutorial. In U. Montanari and F. Rossi, editors, Principles and Practice of Constraint Programming-CP\u2019 95, Lecture Notes in Computer Science 976, pages 564\u2013587. Springer, Berlin, 1995."},{"key":"1_CR106","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/BF02430365","volume":"1","author":"M.G.A. Verhoeven","year":"1995","unstructured":"M.G.A. Verhoeven and E.H.L. Aarts. Parallel local search techniques. Journal of Heuristics, 1:43\u201365, 1995.","journal-title":"Journal of Heuristics"},{"key":"1_CR107","series-title":"Lecture Notes in Economics and Mathematical Systems","volume-title":"Applied Simulated Annealing","year":"1993","unstructured":"R.V.V. Vidal, editor. Applied Simulated Annealing. Lecture Notes in Economics and Mathematical Systems 396. Springer, Berlin, 1993."},{"key":"1_CR108","unstructured":"S. Vo\u03b2. Intelligent Search. Manuscript, TU Darmstadt, 1993."},{"key":"1_CR109","first-page":"333","volume-title":"Network Optimization Problems","author":"S. Vo\u03b2","year":"1993","unstructured":"S. Vo\u03b2. Tabu search: applications and prospects. In D.-Z. Du and P. Pardalos, editors, Network Optimization Problems, pages 333\u2013353. World Scientific, Singapore, 1993."},{"key":"1_CR110","unstructured":"S. Vo\u03b2. Observing logical interdependencies in tabu search: Methods and results. In V.J. Rayward-Smith, I.H. Osman, C.R. Reeves, and G.D. Smith, editors, Modern Heuristic Search Methods, pages 41\u201359, Chichester, 1996. Wiley."},{"key":"1_CR111","volume-title":"Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization","year":"1999","unstructured":"S. Vo\u03b2, S. Martello, I.H Osman, and C. Roucairol, editors. Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization. Kluwer, Boston, 1999."},{"key":"1_CR112","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-48369-1","volume-title":"Integer Optimization by Local Search","author":"J.P. Walser","year":"1999","unstructured":"J.P. Walser. Integer Optimization by Local Search. Lecture Notes in Artificial Intelligence 1637. Springer, Berlin, 1999."},{"key":"1_CR113","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/0004-3702(95)00124-7","volume":"85","author":"D. Whitley","year":"1996","unstructured":"D. Whitley, S. Rana, J. Dzubera, and K.E. Mathias. Evaluating evolutionary algorithms. Artificial Intelligence, 85:245\u2013276, 1996.","journal-title":"Artificial Intelligence"},{"key":"1_CR114","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1109\/4235.585893","volume":"1","author":"D.H. Wolpert","year":"1997","unstructured":"D.H. Wolpert and W.G. Macready. No free lunch theorems for optimization. IEEE Transactions on Evolutionary Computation, 1:67\u201382, 1997.","journal-title":"IEEE Transactions on Evolutionary Computation"},{"issue":"2","key":"1_CR115","first-page":"1","volume":"18","author":"D.L. Woodruff","year":"1997","unstructured":"D.L. Woodruff. A class library for heuristic search optimization. INFORMS Computer Science Technical Section Newsletter, 18(2):1\u20135, 1997.","journal-title":"INFORMS Computer Science Technical Section Newsletter"},{"key":"1_CR116","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1016\/S0377-2217(97)00293-2","volume":"106","author":"D.L. Woodruff","year":"1998","unstructured":"D.L. Woodruff. Proposals for chunking and tabu search. European Journal of Operational Research, 106:585\u2013598, 1998.","journal-title":"European Journal of Operational Research"},{"key":"1_CR117","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1007\/978-1-4615-5775-3_34","volume-title":"Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization","author":"D.L. Woodruff","year":"1999","unstructured":"D.L. Woodruff. A chunking based selection strategy for integrating meta-heuristics with branch and bound. In S. Vo\u03b2, S. Martello, I.H. Osman, and C. Roucairol, editors, Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization, pages 499\u2013511. Kluwer, Boston, 1999."},{"key":"1_CR118","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1016\/0377-2217(89)90412-8","volume":"43","author":"S.H. Zanakis","year":"1989","unstructured":"S.H. Zanakis, J.R. Evans, and A.A. Vazacopoulos. Heuristic methods and applications: a categorized survey. European Journal of Operational Research, 43:88\u2013110, 1989.","journal-title":"European Journal of Operational Research"},{"key":"1_CR119","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-015-7949-0","volume-title":"Fuzzy Set Theory and its Applications","author":"H.-J. Zimmermann","year":"1991","unstructured":"H.-J. Zimmermann. Fuzzy Set Theory and its Applications. Kluwer, Boston, 2nd edition, 1991.","edition":"2nd edition"}],"container-title":["Lecture Notes in Computer Science","Local Search for Planning and Scheduling"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45612-0_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,21]],"date-time":"2020-04-21T18:49:26Z","timestamp":1587494966000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45612-0_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540428985","9783540456124"],"references-count":119,"URL":"http:\/\/dx.doi.org\/10.1007\/3-540-45612-0_1","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"published":{"date-parts":[[2001]]}}}