{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,14]],"date-time":"2026-07-14T09:34:38Z","timestamp":1784021678397,"version":"3.55.0"},"reference-count":140,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2005,11,1]],"date-time":"2005-11-01T00:00:00Z","timestamp":1130803200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2005,11]]},"DOI":"10.1007\/s10479-005-3971-7","type":"journal-article","created":{"date-parts":[[2005,11,26]],"date-time":"2005-11-26T12:12:53Z","timestamp":1133007173000},"page":"189-213","source":"Crossref","is-referenced-by-count":217,"title":["Metaheuristics in Combinatorial Optimization"],"prefix":"10.1007","volume":"140","author":[{"given":"Michel","family":"Gendreau","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jean-Yves","family":"Potvin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"3971_CR1","first-page":"91","volume-title":"Local Search in Combinatorial Optimization","author":"E.H.L. Aarts","year":"1997","unstructured":"Aarts, E.H.L., J.H.M. Korst, and P.J.M. van Laarhoven. (1997). \u201cSimulated Annealing.\u201d In E.H.L. Aarts and J.K. Lenstra (eds.), Local Search in Combinatorial Optimization Chichester: Wiley, pp. 91\u2013136."},{"key":"3971_CR2","volume-title":"Local Search in Combinatorial Optimization","year":"1997","unstructured":"Aarts, E.H.L. and J.K. Lenstra. (eds.) (1997). Local Search in Combinatorial Optimization. Chichester: Wiley."},{"key":"3971_CR3","first-page":"209","volume-title":"Handbook of Applied Optimization","author":"E.H.L. Aarts","year":"2002","unstructured":"Aarts, E.H.L. and H.M.M. Ten Eikelder. (2002). \u201cSimulated Annealing.\u201d In P.M. Pardalos and M.G.C. Resende (eds.), Handbook of Applied Optimization. New York: Oxford University Press, pp. 209\u2013220."},{"key":"3971_CR4","volume-title":"Handbook of Evoluationary Computation, G9.5","author":"E.H.L. Aarts","year":"1997","unstructured":"Aarts, E.H.L. and M.G.A. Verhoeven. (1997). \u201cGenetic Local Search for the Traveling Salesman Problem.\u201d In T. B\u00e4ck, D.B. Fogel, Z. Michalewicz (eds.), Handbook of Evoluationary Computation, G9.5, New York: Oxford University Press."},{"key":"3971_CR5","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/S0166-218X(01)00338-9","volume":"123","author":"R.K. Ahuja","year":"2002","unstructured":"Ahuja, R.K., O. Ergun, J.B. Orlin, and A.P. Punnen. (2002). \u201cA Survey of Very Large-Scale Neighborhood Search Techniques.\u201d Discrete Applied Mathematics 123, 75\u2013102.","journal-title":"Discrete Applied Mathematics"},{"key":"3971_CR6","volume-title":"Simulated Annealing: Parallelization Techniques","year":"1992","unstructured":"Azencott, R. (ed.) (1992). Simulated Annealing: Parallelization Techniques. Chichester: Wiley."},{"key":"3971_CR7","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1287\/ijoc.6.2.126","volume":"6","author":"R. Battiti","year":"1994","unstructured":"Battiti, R. and G. Tecchiolli. (1994). \u201cThe Reactive Tabu Search.\u201d ORSA Journal on Computing 6, 126\u2013140.","journal-title":"ORSA Journal on Computing"},{"key":"3971_CR8","first-page":"138","volume-title":"Handbook of Applied Optimization","author":"J.E. Beasley","year":"2002","unstructured":"Beasley, J.E. (2002). \u201cPopulation Heuristics.\u201d In P.M. Pardalos and M.G.C. Resende (eds.), Handbook of Applied Optimization. New York: Oxford University Press, pp. 138\u2013156."},{"key":"3971_CR9","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1287\/trsc.1030.0049","volume":"38","author":"R. Bent","year":"2004","unstructured":"Bent, R. and P. Van Hentenryck. (2004). \u201cA Two-Stage Hybrid Local Local Search for the Vehicle Routing Problem with Time Windows.\u201d Transportation Science 38, 515\u2013530.","journal-title":"Transportation Science"},{"key":"3971_CR10","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1109\/3468.668962","volume":"28","author":"I. Benyahia","year":"1998","unstructured":"Benyahia, I. and J.-Y. Potvin. (1998). \u201cDecision Support for Vehicle Dispatching using Genetic Programming.\u201d IEEE Transactions on Systems, Man and Cybernetics 28, 306\u2013314.","journal-title":"IEEE Transactions on Systems, Man and Cybernetics"},{"key":"3971_CR11","unstructured":"Br\u00e4ysy, O. (2001). \u201cLocal Search and Variable Neighborhood Search Algorithms for the Vehicle Routing Problem with Time Windows.\u201d Doctoral Dissertation, University of Vaasa, Finland."},{"key":"3971_CR12","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1007\/s10732-005-5431-6","volume":"10","author":"O. Br\u00e4ysy","year":"2004","unstructured":"Br\u00e4ysy, O., M. Gendreau, and W. Dullaert. (2004). \u201cEvolutionay Algorithms for the Vehicle Routing Problem with Time Windows.\u201d Journal of Heuristics 10, 587\u2013611.","journal-title":"Journal of Heuristics"},{"key":"3971_CR13","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/BF02579017","volume":"10","author":"O. Br\u00e4ysy","year":"2002","unstructured":"Br\u00e4ysy, O. and M. Gendreau. (2002). \u201cTabu Search Heuristics for the Vehicle Routing Problem with Time Windows.\u201d TOP 10, 211\u2013238.","journal-title":"TOP"},{"key":"3971_CR14","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1287\/trsc.1030.0057","volume":"39","author":"O. Br\u00e4ysy","year":"2005","unstructured":"Br\u00e4ysy, O. and M. Gendreau. (2005). \u201cVehicle Routing Problem with Time Windows, Part II: Metaheuristics.\u201d Transportation Science 39, 119\u2013139.","journal-title":"Transportation Science"},{"key":"3971_CR15","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/978-1-4615-5775-3_20","volume-title":"Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization","author":"B. Bullnheimer","year":"1999","unstructured":"Bullnheimer, B., R.F. Hartl, and C. Strauss. (1999). \u201cApplying the Ant System to the Vehicle Routing Problem.\u201d In S. Voss, S. Martello, I.H. Osman, and C. Roucairol (eds.), Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization. Boston: Kluwer, pp. 285\u2013296."},{"key":"3971_CR16","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1023\/A:1018940026670","volume":"89","author":"B. Bullnheimer","year":"1999","unstructured":"Bullnheimer, B., R.F. Hartl, and C. Strauss. (1999). \u201cAn Improved Ant System for the Vehicle Routing Problem.\u201d Annals of Operations Research 89, 319\u2013328.","journal-title":"Annals of Operations Research"},{"key":"3971_CR17","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/3-540-45365-2_21","volume":"2037","author":"E.K. Burke","year":"2001","unstructured":"Burke, E.K., P. Cowling, and R. Keuthen. (2001). \u201cEffective Local and Guided Variable Neighborhood Search Methods for the Asymmetric Traveling Salesman Problem.\u201d Lecture Notes in Computer Science 2037, 203\u2013212.","journal-title":"Lecture Notes in Computer Science"},{"key":"3971_CR18","volume-title":"Efficient and Accurate Parallel Genetic Algorithms","author":"E. Cant\u00fa-Paz","year":"2000","unstructured":"Cant\u00fa-Paz, E. (2000). Efficient and Accurate Parallel Genetic Algorithms. Boston: Kluwer."},{"key":"3971_CR19","first-page":"185","volume-title":"Essays and Surveys in Metaheuristics","author":"C. Carreto","year":"2001","unstructured":"Carreto, C. and B. Baker. (2001). \u201cA GRASP Interactive Approach to the Vehicle Routing Problem with Backhauls.\u201d In C.C. Ribeiro, P. Hansen (eds.), Essays and Surveys in Metaheuristics. Boston: Kluwer, pp. 185\u2013200."},{"key":"3971_CR20","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/BF00940812","volume":"45","author":"V. Cerny","year":"1985","unstructured":"Cerny, V. (1985). \u201cThermodynamical Approach to the Traveling Salesman Problem: An Efficient Simulation Algorithm.\u201d Journal of Optimization Theory and Applications 45, 41\u201351.","journal-title":"Journal of Optimization Theory and Applications"},{"key":"3971_CR21","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1016\/0377-2217(94)00058-K","volume":"86","author":"P. Chardaire","year":"1995","unstructured":"Chardaire, P., J.L. Lutton, and A. Sutter. (1995). \u201cThermostatistical persistency: A Powerful Improving Concept for Simulated Annealing Algorithms.\u201d European Journal of Operational Research 86, 565\u2013579.","journal-title":"European Journal of Operational Research"},{"key":"3971_CR22","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1287\/ijoc.14.1.52.7712","volume":"14","author":"R.K. Congram","year":"2002","unstructured":"Congram, R.K., C.N. Potts, and S.L. van der Velde. (2002). \u201cAn Iterated Dynasearch Algorithm for the Single Machine Total Weighted Tardiness Scheduling Problem.\u201d INFORMS Journal on Computing 14, 52\u201367.","journal-title":"INFORMS Journal on Computing"},{"key":"3971_CR23","doi-asserted-by":"crossref","first-page":"512","DOI":"10.1057\/palgrave.jors.2601319","volume":"53","author":"J.-F. Cordeau","year":"2002","unstructured":"Cordeau, J.-F., M. Gendreau, G. Laporte, J.-Y. Potvin, and F. Semet. (2002). \u201cA Guide to Vehicle Routing Heuristics.\u201d Journal of the Operational Research Society 53, 512\u2013522.","journal-title":"Journal of the Operational Research Society"},{"key":"3971_CR24","doi-asserted-by":"crossref","first-page":"928","DOI":"10.1057\/palgrave.jors.2601163","volume":"52","author":"J.-F. Cordeau","year":"2001","unstructured":"Cordeau, J.-F., G. Laporte, and A. Mercier. (2001). \u201cA Unified Tabu Search Heuristic for Vehicle Routing Problems with Time Windows.\u201d Journal of the Operational Research Society 52, 928\u2013936.","journal-title":"Journal of the Operational Research Society"},{"key":"3971_CR25","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1016\/S0191-2615(02)00045-0","volume":"B37","author":"J.-F. Cordeau","year":"2003","unstructured":"Cordeau, J.-F. and G. Laporte. (2003). \u201cA Tabu Search Heuristic for the Static Multi-Vehicle Dial-a-Ride Problem.\u201d Transportation Research B37, 579\u2013594.","journal-title":"Transportation Research"},{"key":"3971_CR26","first-page":"145","volume-title":"Metaheuristic Optimization via Memory and Evolution: Tabu Search and Scatter Search","author":"J.-F. Cordeau","year":"2004","unstructured":"Cordeau, J.-F. and G. Laporte. (2004). \u201cTabu Search Heuristics for the Vehicle Routing Problem.\u201d In C. Rego and B. Alidaee (eds.), Metaheuristic Optimization via Memory and Evolution: Tabu Search and Scatter Search. Boston: Kluwer, pp. 145\u2013163."},{"key":"3971_CR27","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1023\/A:1011301019184","volume":"7","author":"R. Cordone","year":"2001","unstructured":"Cordone, R. and R.W. Calvo. (2001). \u201cA Heuristic for the Vehicle Routing Problem with Time Windows.\u201d Journal of Heuristics 7, 107\u2013129.","journal-title":"Journal of Heuristics"},{"key":"3971_CR28","volume-title":"New Ideas in Optimization","year":"1999","unstructured":"Corne, D., M. Dorigo, and F. Glover. (eds.) (1999). New Ideas in Optimization, London: McGraw-Hill."},{"key":"3971_CR29","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/978-1-4615-5775-3_23","volume-title":"Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization","author":"T.G. Crainic","year":"1999","unstructured":"Crainic, T.G. and M. Gendreau. (1999). \u201cTowards an Evolutionary Method\u2014Cooperative Multi-Thread Parallel Tabu Search Heuristic Hybrid.\u201d In S. Voss, S. Martello, I.H. Osman and C. Roucairol (eds.), Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization. Boston: Kluwer, pp. 331\u2013344."},{"key":"3971_CR30","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1287\/ijoc.12.3.223.12638","volume":"12","author":"T.G. Crainic","year":"2000","unstructured":"Crainic, T.G., M. Gendreau, and J.M. Farvolden. (2000). \u201cA Simplex-Based Tabu Search Method for Capacitated Network Design.\u201d INFORMS Journal on Computing 12, 223\u2013236.","journal-title":"INFORMS Journal on Computing"},{"key":"3971_CR31","unstructured":"Crainic, T.G., M. Gendreau, P. Hansen, N. Hoeb, and N. Mladenovi\u0107. (2001). \u201cParallel Variable Neighborhood Search for the p-Median.\u201d In Proceedings of MIC'2001, Porto, 595\u2013599."},{"key":"3971_CR32","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1007\/BF02023001","volume":"41","author":"T.G. Crainic","year":"1993","unstructured":"Crainic, T.G., M. Gendreau, P. Soriano, and M. Toulouse. (1993). \u201cA Tabu Search Procedure for Multicommodity Location\/Allocation with Balancing Requirements.\u201d Annals of Operations Research 41, 359\u2013383.","journal-title":"Annals of Operations Research"},{"key":"3971_CR33","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1007\/0-306-48056-5_17","volume-title":"Handbook of Metaheuristics","author":"T.G. Crainic","year":"2003","unstructured":"Crainic, T.G. and M. Toulouse. (2003). \u201cParallel Strategies for Meta-Heuristics.\u201d In F. Glover and G. Kochenberger (eds.), Handbook of Metaheuristics. Boston: Kluwer, pp. 475\u2013513."},{"key":"3971_CR34","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1287\/ijoc.9.1.61","volume":"9","author":"T.G. Crainic","year":"1997","unstructured":"Crainic, T.G., M. Toulouse, and M. Gendreau. (1997). \u201cTowards a Taxonomy of Parallel Tabu Search Algorithms.\u201d INFORMS Journal on Computing 9, 61\u201372.","journal-title":"INFORMS Journal on Computing"},{"key":"3971_CR35","unstructured":"Crispim, J. and J. Brandao. (2001). \u201cReactive Tabu Search and Variable Neighborhood Descent Applied to the Vehicle Routing Problem with Backhauls.\u201d In Proceedings of MIC'2001, 931-636, Porto."},{"key":"3971_CR36","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/978-1-4615-1507-4_13","volume-title":"Essays and Surveys in Metaheuristics","author":"V.-D. Cung","year":"2002","unstructured":"Cung, V.-D., S.L. Martins, C.C. Ribeiro, and C. Roucairol. (2002). \u201cStrategies for the Parallel Implementation of Metaheuristics.\u201d In C.C. Ribeiro and P. Hansen (eds.), Essays and Surveys in Metaheuristics. Boston: Kluwer, pp. 263\u2013308."},{"key":"3971_CR37","first-page":"225","volume-title":"The Vehicle Routing Problem","author":"G. Desaulniers","year":"2001","unstructured":"Desaulniers, G., J. Desrosiers, A. Erdmann, M.M. Solomon, and F. Soumis. (2001). \u201cVRP with Pickup and Delivery.\u201d In P. Toth and D.Vigo (eds.), The Vehicle Routing Problem, Philadelphia: SIAM, pp. 225\u2013242."},{"key":"3971_CR38","unstructured":"Dorigo, M. (1992). \u201cOptimization, Learning, and Natural Algorithms,\u201d Ph.D. Thesis, Politecnico di Milano."},{"key":"3971_CR39","first-page":"11","volume-title":"New Ideas in Optimization","author":"M. Dorigo","year":"1999","unstructured":"Dorigo, M. and G. Di Caro. (1999). \u201cThe Ant Colony Optimization Meta-Heuristic.\u201d D. Corne, In M. Dorigo and F. Glover (eds.), New Ideas in Optimization, London: McGraw-Hill, pp. 11\u201332."},{"key":"3971_CR40","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1162\/106454699568728","volume":"5","author":"M. Dorigo","year":"1999","unstructured":"Dorigo, M., G. Di Caro, and L.M. Gambardella. (1999). \u201cAnt Algorithms for Discrete Optimization.\u201d Artificial Life 5, 137\u2013172.","journal-title":"Artificial Life"},{"key":"3971_CR41","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1109\/4235.585892","volume":"1","author":"M. Dorigo","year":"1997","unstructured":"Dorigo, M. and L.M. Gambardella. (1997). \u201cAnt Colony System: A Cooperative Learning Approach to the Traveling Salesman Problem.\u201d IEEE Transactions on Evolutionary Computation 1, 53\u201366.","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"3971_CR42","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/S0303-2647(97)01708-5","volume":"43","author":"M. Dorigo","year":"1997","unstructured":"Dorigo, M. and L.M. Gambardella. (1997). \u201cAnt Colonies for the Traveling Salesman Problem.\u201d BioSystems 43, 73\u201381.","journal-title":"BioSystems"},{"key":"3971_CR43","doi-asserted-by":"crossref","unstructured":"Dorigo, M., V. Maniezzo, and A. Colorni. (1996). \u201cThe Ant System: Optimization by a Colony of Cooperating Agents.\u201d IEEE Transactions on Systems, Man, and Cybernetics B26, 29\u201341.","DOI":"10.1109\/3477.484436"},{"key":"3971_CR44","doi-asserted-by":"crossref","unstructured":"Dorigo, M. and T. St\u00fctzle. (2003). \u201cThe Ant Colony Optimization Metaheuristic: Algorithms, Applications, and Advances.\u201d In F. Glover and G. Kochenberger (eds.), Handbook of Metaheuristics. Boston: Kluwer, pp. 251\u2013285.","DOI":"10.1007\/0-306-48056-5_9"},{"key":"3971_CR45","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0021-9991(90)90201-B","volume":"90","author":"G. Dueck","year":"1990","unstructured":"Dueck, G. and T. Scheuer. (1990). \u201cThreshold Accepting: A General Purpose Optimization Algorithm.\u201d Journal of Computational Physics 90, 161\u2013175.","journal-title":"Journal of Computational Physics"},{"key":"3971_CR46","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1287\/trsc.31.1.49","volume":"31","author":"C. Duhamel","year":"1997","unstructured":"Duhamel, C., J.-Y. Potvin, and J.-M. Rousseau. (1997). \u201cA Tabu Search Heuristic for the Vehicle Routing Problem with Backhauls and Time Windows.\u201d Transportation Science 31, 49\u201359.","journal-title":"Transportation Science"},{"key":"3971_CR47","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0167-6377(89)90002-3","volume":"8","author":"T.A. Feo","year":"1989","unstructured":"Feo, T.A. and M.G.C. Resende. (1989). \u201cA Probabilistic Heuristic for a Computationally Difficult Set Covering Problem.\u201d Operations Research Letters 8, 67\u201371.","journal-title":"Operations Research Letters"},{"key":"3971_CR48","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF01096763","volume":"6","author":"T.A. Feo","year":"1995","unstructured":"Feo, T.A. and M.G.C. Resende. (1995). \u201cGreedy Randomized Adaptive Search Procedures.\u201d Journal of Global Optimization 6, 109\u2013133.","journal-title":"Journal of Global Optimization"},{"key":"3971_CR49","doi-asserted-by":"crossref","unstructured":"Festa, P. and M.C.G. Resende. (2002). \u201cGRASP: An Annotated Bibliography.\u201d In C.C. Ribeiro and P. Hansen (eds.), Essays and Surveys in Metaheuristics. Boston: Kluwer, pp. 325\u2013368.","DOI":"10.1007\/978-1-4615-1507-4_15"},{"key":"3971_CR50","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1287\/ijoc.11.2.198","volume":"11","author":"C. Fleurent","year":"1999","unstructured":"Fleurent, C. and F. Glover. (1999). \u201cImproved Constructive Multistart Strategies for the Quadratic Assignment Problem using Adaptive Memory.\u201d INFORMS Journal on Computing 11, 198\u2013204.","journal-title":"INFORMS Journal on Computing"},{"key":"3971_CR51","unstructured":"Gambardella, L.-M., E.D. Taillard, and G. Agazzi. (1999). \u201cMACS-VRPTW: A Multiple Ant Colony System for Vehicle Routing Problems with Time Windows.\u201d In D. Corne, M. Dorigo and F. Glover (eds.), New Ideas in Optimization, London: McGraw-Hill, pp. 63\u201376."},{"key":"3971_CR52","doi-asserted-by":"crossref","unstructured":"Gambardella, L.-M., E.D. Taillard, and M. Dorigo. (1999). \u201cAnt Colonies for the Quadratic Assignment Problem.\u201d Journal of the Operational Research Society 50, 167\u2013176.","DOI":"10.1057\/palgrave.jors.2600676"},{"key":"3971_CR53","doi-asserted-by":"crossref","unstructured":"Gendreau, M. (2003). \u201cAn Introduction to Tabu Search.\u201d In F. Glover and G. Kochenberger (eds.), Handbook of Metaheuristics. Boston: Kluwer, pp. 37\u201354.","DOI":"10.1007\/0-306-48056-5_2"},{"key":"3971_CR54","doi-asserted-by":"crossref","unstructured":"Gendreau, M. (2002). \u201cRecent Advances in Tabu Search.\u201d In C.C. Ribeiro and P. Hansen (eds.), Essays and Surveys in Metaheuristics, Boston: Kluwer, pp. 369\u2013378.","DOI":"10.1007\/978-1-4615-1507-4_16"},{"key":"3971_CR55","unstructured":"Gendreau, M., F. Guertin, J.-Y. Potvin, and R. S\u00e9guin. (1998). \u201cNeighborhood Search Heuristics for a Dynamic Vehicle Dispatching Problem with Pick-ups and Deliveries.\u201d Technical Report CRT-98-10, Centre de recherche sur les transports, Universit\u00e9 de Montr\u00e9al."},{"key":"3971_CR56","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1287\/trsc.33.4.381","volume":"33","author":"M. Gendreau","year":"1999","unstructured":"Gendreau, M., F. Guertin, J.-Y. Potvin, and E.D. Taillard. (1999). \u201cParallel Tabu Search for Real-Time Vehicle Routing and Dispatching.\u201d Transportation Science 33, 381\u2013390.","journal-title":"Transportation Science"},{"key":"3971_CR57","unstructured":"Gendreau, M., G. Laporte, and J.-Y. Potvin. (1997). \u201cVehicle Routing: Modern Heuristics\u201d E.H.L. Aarts and J.K. Lenstra (eds.), In Local Search in Combinatorial Optimization, Chichester: Wiley, pp. 311\u2013336."},{"key":"3971_CR58","doi-asserted-by":"crossref","unstructured":"Gendreau, M., G. Laporte, and J.-Y. Potvin. (2002). \u201cMetaheuristics for the Capacitated VRP\u201d in The Vehicle Routing Problem, P. Toth and D. Vigo (eds.), Philadelphia: SIAM, pp. 129\u2013154.","DOI":"10.1137\/1.9780898718515.ch6"},{"key":"3971_CR59","doi-asserted-by":"crossref","first-page":"1641","DOI":"10.1016\/S0167-8191(01)00103-X","volume":"27","author":"M. Gendreau","year":"2001","unstructured":"Gendreau, M., G. Laporte, and F. Semet. (2001). \u201cA Dynamic Model and Parallel Tabu Search Heuristic for Real-Time Ambulance Relocation.\u201d Parallel Computing 27, 1641\u20131653.","journal-title":"Parallel Computing"},{"key":"3971_CR60","first-page":"255","volume":"37","author":"B. Gendron","year":"1999","unstructured":"Gendron, B., J.-Y. Potvin, and P. Soriano. (1999). \u201cTabu Search with Exact Neighbor Evaluation for Multicommodity Location with Balancing Requirements.\u201d INFOR 37, 255\u2013270.","journal-title":"INFOR"},{"key":"3971_CR61","unstructured":"Glover, F. (1963). \u201cParametric Combinations of Local Job Shop Rules.\u201d Chapter IV, ONR Research Memorandum no. 117, GSIA, Carnegie-Mellon University, Pittsburgh, U.S.A."},{"key":"3971_CR62","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1111\/j.1540-5915.1977.tb01074.x","volume":"8","author":"F. Glover","year":"1977","unstructured":"Glover, F. (1977). \u201cHeuristics for Integer Programming using Surrogate Constraints.\u201d Decision Sciences 8, 156\u2013166.","journal-title":"Decision Sciences"},{"key":"3971_CR63","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1016\/0305-0548(86)90048-1","volume":"13","author":"F. Glover","year":"1986","unstructured":"Glover, F. (1986). \u201cFuture Paths for Integer Programming and Links to Artificial Intelligence.\u201d Computers & Operations Research 13, 533\u2013549.","journal-title":"Computers & Operations Research"},{"key":"3971_CR64","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F. Glover","year":"1989","unstructured":"Glover, F. (1989). \u201cTabu Search\u2014Part I.\u201d ORSA Journal on Computing 1, 190\u2013206.","journal-title":"ORSA Journal on Computing"},{"key":"3971_CR65","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","volume":"2","author":"F. Glover","year":"1990","unstructured":"Glover, F. (1990). \u201cTabu Search\u2014Part II.\u201d ORSA Journal on Computing 2, 4\u201332.","journal-title":"ORSA Journal on Computing"},{"key":"3971_CR66","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0166-218X(94)00037-E","volume":"65","author":"F. Glover","year":"1996","unstructured":"Glover, F. (1996). \u201cEjection Chains, Reference Structures and Alternating Path Methods for the Traveling Salesman Problem.\u201d Discrete Applied Mathematics 65, 223\u2013253.","journal-title":"Discrete Applied Mathematics"},{"key":"3971_CR67","doi-asserted-by":"crossref","unstructured":"Glover, F. (1997). \u201cTabu Search and Adaptive Memory Programming\u2014Advances, Applications and Challenges.\u201d In R.S. Barr, R.V. Helgason and J.L. Kennington (eds.), Advances in Metaheuristics, Optimization and Stochastic Modeling Technologies. Boston: Kluwer, pp. 1\u201375.","DOI":"10.1007\/978-1-4615-4102-8_1"},{"key":"3971_CR68","doi-asserted-by":"crossref","unstructured":"Glover, F. and G.A. Kochenberger. (eds.) (2003). Handbook of Metaheuristics, Boston: Kluwer.","DOI":"10.1007\/b101874"},{"key":"3971_CR69","doi-asserted-by":"crossref","unstructured":"Glover, F. and M. Laguna. (1997). Tabu Search. Boston: Kluwer.","DOI":"10.1007\/978-1-4615-6089-0"},{"key":"3971_CR70","first-page":"194","volume-title":"Handbook of Applied Optimization","author":"F. Glover","year":"2002","unstructured":"Glover, F. and M. Laguna. (2002). \u201cTabu Search.\u201d In P.M. Pardalos and M.G.C. Resende (eds.), Handbook of Applied Optimization, New York: Oxford University Press, pp. 194\u2013208."},{"key":"3971_CR71","first-page":"653","volume":"39","author":"F. Glover","year":"2000","unstructured":"Glover, F., M. Laguna, and R. Marti. (2000). \u201cFundamentals of Scatter Search and Path Relinking.\u201d Control and Cybernetics 39, 653\u2013684.","journal-title":"Control and Cybernetics"},{"key":"3971_CR72","doi-asserted-by":"crossref","unstructured":"Glover, F., M. Laguna, E.D. Taillard, and D. de Werra. (eds.) (1993). Tabu Search, Annals of Operations 41.","DOI":"10.1007\/BF02078647"},{"key":"3971_CR73","unstructured":"Goldberg, D.E. (1989). Genetic Algorithms in Search, Optimization & Machine Learning, Reading: Addison-Wesley."},{"key":"3971_CR74","unstructured":"Hansen, P., B. Jaumard, N. Mladenovi\u0107, and A. Parreira. (2000). \u201cVariable Neighborhood Search for Weighted Maximum Satisfiability Problem.\u201d Les Cahiers du GERAD, G-2000-62, Montr\u00e9al."},{"key":"3971_CR75","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. and N. Mladenovi\u0107. (1999). \u201cAn Introduction to Variable Neighborhood Search.\u201d In S. Voss, S. Martello, I.H. Osman and C. Roucairol (eds.), Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization. Boston: Kluwer, pp. 433\u2013458."},{"key":"3971_CR76","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/0-306-48056-5_6","volume-title":"Handbook of Metaheuristics","author":"P. Hansen","year":"2003","unstructured":"Hansen, P. and N. Mladenovi\u0107. (2003). \u201cVariable Neighborhood Search.\u201d In F. Glover and G. Kochenberger (eds.), Handbook of Metaheuristics. Boston: Kluwer, pp. 145\u2013184."},{"key":"3971_CR77","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1016\/S0377-2217(00)00100-4","volume":"130","author":"P. Hansen","year":"2001","unstructured":"Hansen, P. and N. Mladenovi\u0107. (2001). \u201cVariable Neighborhood Search: Principles and Applications.\u201d European Journal of Operational Research 130, 449\u2013467.","journal-title":"European Journal of Operational Research"},{"key":"3971_CR78","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1007\/978-1-4615-1507-4_19","volume-title":"Essays and Surveys in Metaheuristics","author":"P. Hansen","year":"2002","unstructured":"Hansen, P. and N. Mladenovi\u0107. (2002). \u201cDevelopments of Variable Neighborhood Search.\u201d In C.C. Ribeiro and P. Hansen (eds.), Essays and Surveys in Metaheuristics. Boston: Kluwer, pp. 415\u2013440."},{"key":"3971_CR79","first-page":"221","volume-title":"Handbook of Applied Optimization","author":"P. Hansen","year":"2000","unstructured":"Hansen, P. and N. Mladenovi\u0107. (2000). \u201cVariable Neighborhood Search.\u201d In P.M. Pardalos and M.G.C. Resende (eds.), Handbook of Applied Optimization. New York: Oxford University Press, pp. 221\u2013234."},{"key":"3971_CR80","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1023\/A:1011336210885","volume":"7","author":"P. Hansen","year":"2001","unstructured":"Hansen, P., N. Mladenovi\u0107, and D. Perez-Brito. (2001). \u201cVariable Neighborhood Decomposition Search.\u201d Journal of Heuristics 7, 335\u2013350.","journal-title":"Journal of Heuristics"},{"key":"3971_CR81","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/0167-6377(87)90021-6","volume":"6","author":"J.P. Hart","year":"1987","unstructured":"Hart, J.P. and A.W. Shogan. (1987). \u201cSemi-Greedy Heuristics: An Empirical Study.\u201d Operations Research Letters 6, 107\u2013114.","journal-title":"Operations Research Letters"},{"key":"3971_CR82","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/0-306-48056-5_10","volume-title":"Handbook of Metaheuristics","author":"D. Henderson","year":"2003","unstructured":"Henderson, D., S.H. Jacobson, and A.W. Johnson. (2003). \u201cThe Theory and Practice of Simulated Annealing.\u201d In F. Glover and G. Kochenberger (eds.), Handbook of Metaheuristics. Boston: Kluwer, pp. 287\u2013319."},{"key":"3971_CR83","unstructured":"Hjorring, C.A. (1995). \u201cThe Vehicle Routing Problem and Local Search Metaheuristics.\u201d Ph.D. Thesis, University of Auckland."},{"key":"3971_CR84","unstructured":"Holland, J.H. (1975). Adaptation in Natural and Artificial Systems, The University of Michigan Press."},{"key":"3971_CR85","first-page":"215","volume-title":"Local Search in Combinatorial Optimization","author":"D.S. Johnson","year":"1997","unstructured":"Johnson, D.S. and L.A. McGeoch. (1997). \u201cThe Traveling Salesman Problem: A Case Study.\u201d In E.H.L. Aarts and J.K. Lenstra (eds.), Local Search in Combinatorial Optimization, Chichester: Wiley, pp. 215\u2013310."},{"key":"3971_CR86","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S. Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., C.D. Gelatt Jr., and M.P. Vecchi. (1983). \u201cOptimization by Simulated Annealing.\u201d Science 220, 671\u2013680.","journal-title":"Science"},{"key":"3971_CR87","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1287\/ijoc.7.1.10","volume":"7","author":"G. Kontoravdis","year":"1995","unstructured":"Kontoravdis, G. and J.F. Bard. (1995). \u201cA GRASP for the Vehicle Routing Problem with Time Windows.\u201d ORSA Journal on Computing 7, 10\u201323.","journal-title":"ORSA Journal on Computing"},{"key":"3971_CR88","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/0305-0483(94)90006-X","volume":"22","author":"C. Koulamas","year":"1994","unstructured":"Koulamas, C., S.R. Antony, and R. Jaen. (1994). \u201cA Survey of Simulated Annealing Applications to Operations Research Problems.\u201d Omega 22, 41\u201356.","journal-title":"Omega"},{"key":"3971_CR89","first-page":"183","volume-title":"Handbook of Applied Optimization","author":"M. Laguna","year":"2002","unstructured":"Laguna, M. (2002). \u201cScatter Search.\u201d In P.M. Pardalos and M.G.C. Resende (eds.), Handbook of Applied Optimization. New York: Oxford University Press, pp. 183\u2013193."},{"key":"3971_CR90","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1287\/ijoc.11.1.44","volume":"11","author":"M. Laguna","year":"1999","unstructured":"Laguna, M. and R. Mart\u00ed. (1999). \u201cGRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization.\u201d INFORMS Journal on Computing 11, 44\u201352.","journal-title":"INFORMS Journal on Computing"},{"key":"3971_CR91","unstructured":"Land, M. (1998). \u201cEvolutionary Algorithms with Local Search for Combinatorial Optimization.\u201d Ph.D. Dissertation, University of California, San Diego."},{"key":"3971_CR92","unstructured":"Laporte, G. and I.H. Osman. (eds.) (1996). \u201cMetaheuristics in Combinatorial Optimization.\u201d Annals of Operations Research 63."},{"key":"3971_CR93","unstructured":"LeBouthillier, A., T.G. Crainic, and R. Keller. (2000). \u201cParallel Cooperative Evolutionary Algorithm for Vehicle Routing Problems with Time Windows.\u201d In Proceedings of Odysseus 2000, Chania, pp. 78\u201381."},{"key":"3971_CR94","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1111\/j.1475-3995.1997.tb00094.x","volume":"4","author":"F. Leclerc","year":"1997","unstructured":"Leclerc, F. and J.-Y. Potvin. (1997). \u201cGenetic Algorithms for Vehicle Dispatching.\u201d International Transactions in Operational Research 4, 391\u2013400.","journal-title":"International Transactions in Operational Research"},{"key":"3971_CR95","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1023\/B:ANOR.0000039518.73626.a5","volume":"131","author":"F.-X. Lelouarn","year":"2004","unstructured":"Lelouarn, F.-X., M. Gendreau, and J.-Y. Potvin. (2004). \u201cGENI Ants for the Traveling Salesman Problem.\u201d Annals of Operations Research 131, 187\u2013201.","journal-title":"Annals of Operations Research"},{"key":"3971_CR96","first-page":"474","volume-title":"Handbook of Applied Optimization","author":"A. Lokketangen","year":"2002","unstructured":"Lokketangen, A. (2002). \u201cHeuristics for 0-1 Mixed Integer Programming.\u201d In P.M. Pardalos and M.G.C. Resende (eds.), Handbook of Applied Optimization, New York: Oxford University Press, pp. 474\u2013477."},{"key":"3971_CR97","doi-asserted-by":"crossref","first-page":"624","DOI":"10.1016\/S0377-2217(97)00295-6","volume":"106","author":"A. Lokketangen","year":"1998","unstructured":"Lokketangen, A. and F. Glover. (1998). \u201cSolving Zero-One Mixed Integer Programming Problems using Tabu Search.\u201d European Journal of Operational Research 106, 624\u2013658.","journal-title":"European Journal of Operational Research"},{"key":"3971_CR98","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/978-1-4615-5775-3_10","volume-title":"Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization","author":"A. Lokketangen","year":"1999","unstructured":"Lokketangen, A. and F. Glover. (1999). \u201cCandidate List and Exploration Strategies for Solving 0\/1 MIP Problems using a Pivot Neighborhood.\u201d In S. Voss, S. Martello, I.H. Osman, C. Roucairol (eds.), Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization. Boston: Kluwer, pp. 141\u2013154."},{"key":"3971_CR99","first-page":"321","volume-title":"Handbook of Metaheuristics","author":"H.R. Loren\u00e7o","year":"2003","unstructured":"Loren\u00e7o, H.R., O. Martin, and T. St\u00fctzle. (2003). \u201cIterated Local Search.\u201d In F. Glover and G. Kochenberger (eds.), Handbook of Metaheuristics. Boston: Kluwer, pp. 321\u2013353."},{"key":"3971_CR100","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1007\/978-1-4615-1507-4_21","volume-title":"Essays and Surveys in Metaheuristics","author":"V. Maniezzo","year":"2002","unstructured":"Maniezzo, V. and A. Carbonaro. (2002). \u201cAnt Colony Optimization: An Overview.\u201d In C.C. Ribeiro and P. Hansen (eds.), Essays and Surveys in Metaheuristics, Boston: Kluwer, pp. 469\u2013492."},{"key":"3971_CR101","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1023\/A:1026546708757","volume":"17","author":"S.L. Martins","year":"2000","unstructured":"Martins, S.L., M.G.C. Resende, C.C. Ribeiro and P. Pardalos. (2000). \u201cA Parallel GRASP for the Steiner Tree Problem in Graphs using a Hybrid Local Search Strategy.\u201d Journal of Global Optimization 17, 267\u2013283.","journal-title":"Journal of Global Optimization"},{"key":"3971_CR102","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03315-9","volume-title":"Genetic Algorithms + Data Structures \u2212 Evolution Programs","author":"Z. Michalewicz","year":"1996","unstructured":"Michalewicz, Z. (1996). Genetic Algorithms + Data Structures \u2212 Evolution Programs. Third Edition, Berlin: Springer."},{"key":"3971_CR103","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1023\/A:1015057701750","volume":"8","author":"M. Middendorf","year":"2002","unstructured":"Middendorf, M., F. Reischle, and H. Schmeck. (2002). \u201cMulti Colony Ant Algorithms.\u201d Journal of Heuristics 8, 305\u2013320.","journal-title":"Journal of Heuristics"},{"key":"3971_CR104","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N. Mladenovi\u0107","year":"1997","unstructured":"Mladenovi\u0107, N. and P. Hansen. (1997). \u201cVariable Neighborhood Search.\u201d Computers & Operations Research 24, 1097\u20131100.","journal-title":"Computers & Operations Research"},{"key":"3971_CR105","first-page":"219","volume-title":"New Ideas in Optimization","author":"P. Moscato","year":"1999","unstructured":"Moscato, P. (1999). \u201cMemetic Algorithms: A short introduction.\u201d In D. Corne, M. Dorigo and F. Glover (eds.), New Ideas in Optimization, London: McGraw-Hill, pp. 219\u2013234."},{"key":"3971_CR106","first-page":"157","volume-title":"Handbook of Applied Optimization","author":"P. Moscato","year":"2002","unstructured":"Moscato, P. (2002). \u201cMemetic Algorithms.\u201d In P.M. Pardalos and M.G.C. Resende (eds.), Handbook of Applied Optimization, New York: Oxford University Press, pp. 157\u2013167."},{"key":"3971_CR107","unstructured":"M\u00fchlenbein, H. (1992). \u201cHow Genetic Algorithms Really Work: Mutation and Hill-Climbing.\u201d In R. M\u00e4nner and B. Manderick (eds.), Parallel Problem Solving from Nature 2. North-Holland, Amsterdam, pp. 15\u201326."},{"key":"3971_CR108","unstructured":"M\u00fchlenbein, H. (1997). \u201cGenetic Algorithms.\u201d In Local Search in Combinatorial Optimization. E.H.L. Aarts and J.K. Lenstra (eds.), Chichester: Wiley, pp. 137\u2013171."},{"key":"3971_CR109","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1007\/BF02023004","volume":"41","author":"I.H. Osman","year":"1993","unstructured":"Osman, I.H. (1993). \u201cMetastrategy Simulated Annealing and Tabu Search Algorithms for the Vehicle Routing.\u201d Annals of Operations Research 41, 421\u2013452.","journal-title":"Annals of Operations Research"},{"key":"3971_CR110","volume-title":"Meta-Heuristics: Theory & Applications","year":"1996","unstructured":"Osman, I.H. and J.P. Kelly. (eds.) (1996). Meta-Heuristics: Theory & Applications. Boston: Kluwer."},{"key":"3971_CR111","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1007\/BF02125421","volume":"63","author":"I.H. Osman","year":"1996","unstructured":"Osman, I.H. and G. Laporte. (1996). \u201cMetaheuristics: A Bibliography.\u201d Annals of Operations Research 63, 513\u2013623.","journal-title":"Annals of Operations Research"},{"key":"3971_CR112","first-page":"123","volume-title":"Handbook of Applied Optimization, Chapter 3.6 on Metaheuristics","year":"2002","unstructured":"Pardalos, P.M. and M.G.C. Resende. (eds.) (2002). Handbook of Applied Optimization, Chapter 3.6 on Metaheuristics. New York: Oxford University Press, pp. 123-234."},{"key":"3971_CR113","first-page":"168","volume-title":"Handbook of Applied Optimization","author":"L.S. Pitsoulis","year":"2002","unstructured":"Pitsoulis, L.S. and M.G.C. Resende. (2002). \u201cGreedy Randomized Adaptive Search Procedures.\u201d In P.M. Pardalos and M.G.C. Resende (eds.), Handbook of Applied Optimization, New York: Oxford University Press, pp. 168\u2013182."},{"key":"3971_CR114","first-page":"339","volume":"63","author":"J.-Y. Potvin","year":"1996","unstructured":"Potvin, J.-Y. (1996). \u201cGenetic Algorithms for the Traveling Salesman Problem.\u201d Annals of Operations Research 63, 339\u2013370.","journal-title":"Annals of Operations Research"},{"key":"3971_CR115","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/BF00132738","volume":"6","author":"J.-Y. Potvin","year":"1996","unstructured":"Potvin, J.-Y., C. Duhamel, and F. Guertin. (1996). \u201cA Genetic Algorithm for Vehicle Routing with Backhauling.\u201d Applied Intelligence 6, 345\u2013355.","journal-title":"Applied Intelligence"},{"key":"3971_CR116","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1287\/ijoc.12.3.164.12639","volume":"12","author":"M. Prais","year":"2000","unstructured":"Prais, M. and C.C. Ribeiro. (2000). \u201cReactive GRASP: An Application to a Matrix Decomposition Problem.\u201d INFORMS Journal on Computing 12, 164\u2013176.","journal-title":"INFORMS Journal on Computing"},{"key":"3971_CR117","first-page":"1","volume":"9","author":"M. Prais","year":"2000","unstructured":"Prais, M. and C.C. Ribeiro. (2000). \u201cParameter Variation in GRASP procedures.\u201d Investigaci\u00f3n Operativa 9, 1\u201320.","journal-title":"Investigaci\u00f3n Operativa"},{"key":"3971_CR118","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1111\/j.1475-3995.1999.tb00173.x","volume":"6","author":"P. Preux","year":"1999","unstructured":"Preux, P. and E.G. Talbi. (1999). \u201cTowards hybrid evolutionary algorithms.\u201d International Transactions in Operational Research 6, 557\u2013570.","journal-title":"International Transactions in Operational Research"},{"key":"3971_CR119","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/S0167-8191(00)00102-2","volume":"27","author":"C. Rego","year":"2001","unstructured":"Rego, C. (2001). \u201cNode Ejection Chains for the Vehicle Routing Problem: Sequential and Parallel Algorithms.\u201d Parallel Computing 27, 201\u2013222.","journal-title":"Parallel Computing"},{"key":"3971_CR120","unstructured":"Rego, C. and F. Glover. (2001). \u201cLocal Search and Metaheuristics for the Traveling Salesman Problem.\u201d Technical Report HCES-07-01, Hearin Center for Enterprise Science, The University of Mississipi."},{"key":"3971_CR121","first-page":"661","volume-title":"Metaheuristics: Theory and Applications","author":"C. Rego","year":"1996","unstructured":"Rego, C. and C. Roucairol. (1996). \u201cA Parallel Tabu Search Algorithm Using Ejection Chains for the Vehicle Routing Problem.\u201d In I.H. Osman and J.P. Kelly (eds.), Metaheuristics: Theory and Applications. Boston: Kluwer, pp. 661\u2013675."},{"key":"3971_CR122","doi-asserted-by":"crossref","unstructured":"Reeves, C.R. (2003). \u201cGenetic Algorithms.\u201d In F. Glover and G. Kochenberger (eds.), Hanbook of Metaheuristics, in Handbook of Metaheuristics. Boston: Kluwer, pp. 55\u201382.","DOI":"10.1007\/0-306-48056-5_3"},{"key":"3971_CR123","volume-title":"Modern Heuristic Techniques for Combinatorial Problems","year":"1993","unstructured":"Reeves, C.R. (ed) (1993). Modern Heuristic Techniques for Combinatorial Problems. Oxford: Blackwell."},{"key":"3971_CR124","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1162\/evco.1998.6.1.45","volume":"6","author":"C.R. Reeves","year":"1998","unstructured":"Reeves, C.R. and T. Yamada. (1998). \u201cGenetic Algorithms, Path Relinking and the Flowshop Sequencing Problem.\u201d Evolutionary Computation 6, 45\u201360.","journal-title":"Evolutionary Computation"},{"key":"3971_CR125","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/0-306-48056-5_8","volume-title":"Handbook of Metaheuristics","author":"M.G.C. Resende","year":"2003","unstructured":"Resende, M.G.C. and C.C. Ribeiro. (2003). \u201cGreedy Randomized Adaptive Search Procedures.\u201d In F. Glover and G. Kochenberger (eds.), Handbook of Metaheuristics. Boston: Kluwer, pp. 219\u2013249."},{"key":"3971_CR126","volume-title":"Essays and Surveys in Metaheuristics","year":"2002","unstructured":"Ribeiro, C.C. and P. Hansen. (eds.) (2002). Essays and Surveys in Metaheuristics. Boston: Kluwer."},{"key":"3971_CR127","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/BF02430370","volume":"1","author":"Y. Rochat","year":"1995","unstructured":"Rochat, Y. and E.D. Taillard. (1995). \u201cProbabilistic Diversification and Intensification in Local Search for Vehicle Routing.\u201d Journal of Heuristics 1, 147\u2013167.","journal-title":"Journal of Heuristics"},{"key":"3971_CR128","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1023\/A:1013661617536","volume":"8","author":"L.-M. Rousseau","year":"2002","unstructured":"Rousseau, L.-M., M. Gendreau, and G. Pesant. (2002). \u201cUsing Constraint-Based Operators with Variable Neighborhood Search to Solve the Vehicle Routing Problem with Time Windows\u201d Journal of Heuristics 8, 43\u201358.","journal-title":"Journal of Heuristics"},{"key":"3971_CR129","unstructured":"St\u00fctzle, T. and M. Dorigo. (1999). \u201cACO Algorithms for the Traveling Salesman Problem\u201d, In K. Miettinen, M. Makela, P. Neittaanmaki and J. Periaux (eds.), Evolutionary Algorithms in Engineering and Computer Science, Chichester: Wiley."},{"key":"3971_CR130","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/978-3-7091-6492-1_54","volume-title":"Artificial Neural Networks and Genetic Algorithms","author":"T. St\u00fctzle","year":"1998","unstructured":"St\u00fctzle, T. and H.H. Hoos. (1998). \u201cImprovements on the Ant System: Introducing the MAX-MIN Ant System.\u201d In G.D. Smith, N.C. Steele and R.F. Albrecht (eds.), Artificial Neural Networks and Genetic Algorithms. Berlin: Springer Verlag, pp. 245\u2013249."},{"key":"3971_CR131","doi-asserted-by":"crossref","first-page":"889","DOI":"10.1016\/S0167-739X(00)00043-1","volume":"16","author":"T. St\u00fctzle","year":"2000","unstructured":"St\u00fctzle, T. and H.H. Hoos. (2000). \u201cMAX-MIN Ant System.\u201d Future Generation Computer Systems Journal 16, 889\u2013914.","journal-title":"Future Generation Computer Systems Journal"},{"key":"3971_CR132","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1016\/S0377-2217(97)00284-1","volume":"106","author":"M. Sun","year":"1998","unstructured":"Sun, M., J.E. Aronson, P.G. McKeown, and D. Drinka. (1998). \u201cA Tabu Search Heuristic for the Fixed Charge Transportation Problem.\u201d European Journal of Operational Research 106, 441\u2013456.","journal-title":"European Journal of Operational Research"},{"key":"3971_CR133","first-page":"130","volume-title":"Handbook of Applied Optimization","author":"E.D. Taillard","year":"2002","unstructured":"Taillard, E.D. (2002). \u201cAnt Systems.\u201d In P.M. Pardalos and M.G.C. Resende (eds.), Handbook of Applied Optimization, New York: Oxford University Press, pp. 130\u2013137."},{"key":"3971_CR134","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1287\/trsc.31.2.170","volume":"31","author":"E.D. Taillard","year":"1997","unstructured":"Taillard, E.D., P. Badeau, M. Gendreau, F. Guertin, and J.-Y. Potvin. (1997). \u201cA Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows.\u201d Transportation Science 31, 170\u2013186.","journal-title":"Transportation Science"},{"key":"3971_CR135","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0377-2217(00)00268-X","volume":"135","author":"E.D. Taillard","year":"2001","unstructured":"Taillard, E.D., L.-M. Gambardella, M. Gendreau, and J.-Y. Potvin. (2001). \u201cAdaptive Memory Programming: A Unified View of Metaheuristics.\u201d European Journal of Operational Research 135, 1\u201316.","journal-title":"European Journal of Operational Research"},{"key":"3971_CR136","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). \u201cA Taxonomy of Hybrid Metaheuristics.\u201d Journal of Heuristics 8, 541\u2013564.","journal-title":"Journal of Heuristics"},{"key":"3971_CR137","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1287\/trsc.31.1.60","volume":"31","author":"P. Toth","year":"1997","unstructured":"Toth, P. and D. Vigo. (1997). \u201cHeuristic Algorithms for the Handicapped Persons Transportation Problem.\u201d Transportation Science 31, 60\u201371.","journal-title":"Transportation Science"},{"key":"3971_CR138","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1287\/ijoc.15.4.333.24890","volume":"15","author":"P. Toth","year":"2003","unstructured":"Toth, P. and D. Vigo. (2003). \u201cThe Granular Tabu Search and Its Application to the Vehicle-Routing Problem.\u201d INFORMS Journal on Computing 15, 333\u2013346.","journal-title":"INFORMS Journal on Computing"},{"key":"3971_CR139","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/BF02430365","volume":"1","author":"M.G.A. Verhoeven","year":"1996","unstructured":"Verhoeven, M.G.A. and E.H.L. Aarts. (1996). \u201cParallel Local Search Techniques.\u201d Journal of Heuristics 1, 43\u201365.","journal-title":"Journal of Heuristics"},{"key":"3971_CR140","volume-title":"Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization","year":"1999","unstructured":"Voss, S., S. Martello, I.H. Osman, and C. Roucairol. (eds.) (1999). Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization. Boston: Kluwer."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-005-3971-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-005-3971-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-005-3971-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T06:12:30Z","timestamp":1586585550000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-005-3971-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,11]]},"references-count":140,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2005,11]]}},"alternative-id":["3971"],"URL":"https:\/\/doi.org\/10.1007\/s10479-005-3971-7","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,11]]}}}