{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,26]],"date-time":"2026-07-26T19:59:13Z","timestamp":1785095953067,"version":"3.55.0"},"reference-count":63,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2001,11,1]],"date-time":"2001-11-01T00:00:00Z","timestamp":1004572800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[2001,11]]},"DOI":"10.1016\/s0377-2217(00)00268-x","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T21:07:57Z","timestamp":1027631277000},"page":"1-16","source":"Crossref","is-referenced-by-count":171,"title":["Adaptive memory programming: A unified view of metaheuristics"],"prefix":"10.1016","volume":"135","author":[{"given":"\u00c9ric D","family":"Taillard","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Luca M","family":"Gambardella","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michel","family":"Gendreau","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jean-Yves","family":"Potvin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(00)00268-X_BIB1","first-page":"193","article-title":"Statistical cooling: A general approach to combinatorial optimization problems","volume":"40","author":"Aarts","year":"1985","journal-title":"Philips Journal of Research"},{"key":"10.1016\/S0377-2217(00)00268-X_BIB2","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/S0166-218X(97)00129-7","article-title":"On the quality of local search for the quadratic assignment problem","volume":"82","author":"Angel","year":"1998","journal-title":"Discrete Applied Mathemetics"},{"key":"10.1016\/S0377-2217(00)00268-X_BIB3","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/S0968-090X(97)00005-3","article-title":"A parallel tabu search heuristic for the vehicle routing problem with time windows","volume":"5C","author":"Badeau","year":"1997","journal-title":"Transportation Research"},{"key":"10.1016\/S0377-2217(00)00268-X_BIB4","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1287\/ijoc.6.2.126","article-title":"The reactive tabu search","volume":"6","author":"Battiti","year":"1994","journal-title":"ORSA Journal on Computing"},{"key":"10.1016\/S0377-2217(00)00268-X_BIB5","unstructured":"Blanton, J.L., Wainwright, R.L., 1993. Multiple vehicle routing with time and capacity constraints using genetic algorithms. In: Forrest, S. (Ed.), Proceedings of the Fifth International Conference on Genetic Algorithms. pp. 452\u2013459"},{"key":"10.1016\/S0377-2217(00)00268-X_BIB6","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/0167-6377(94)90065-5","article-title":"A new adaptive multi-start technique for combinatorial global optimizations","volume":"16","author":"Boese","year":"1994","journal-title":"Operations Research Letters"},{"key":"10.1016\/S0377-2217(00)00268-X_BIB7","series-title":"Metaheuristics: Advances and Trends in Local Search Paradigms for Optimization","first-page":"285","article-title":"Applying the ant system to the vehicle routing problem","author":"Bullnheimer","year":"1999"},{"key":"10.1016\/S0377-2217(00)00268-X_BIB8","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1287\/ijoc.9.4.417","article-title":"A reactive tabu search metaheuristic for the vehicle routing problem with time windows","volume":"9","author":"Chiang","year":"1997","journal-title":"INFORMS Journal on Computing"},{"key":"10.1016\/S0377-2217(00)00268-X_BIB9","unstructured":"Colorni, A., Dorigo, M., Maniezzo, V. 1992a. Distributed optimization by ant colonies. In: Varela, F.J., Bourgine, P. (Eds.), Proceedings of the First European Conference on Artificial Life (ECAL-91). The MIT Press, Cambridge, MA, pp. 134\u2013142"},{"key":"10.1016\/S0377-2217(00)00268-X_BIB10","unstructured":"Colorni, A., Dorigo, M., Maniezzo, V. 1992b. An investigation of some properties of an ant algorithm. In: Manner, R., Manderick, B. (Eds.), Parallel Problem Solving from Nature, vol. 2. North-Holland, Amsterdam, pp. 509\u2013520"},{"key":"10.1016\/S0377-2217(00)00268-X_BIB11","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/0377-2217(90)90301-Q","article-title":"An improved annealing scheme for the QAP","volume":"46","author":"Connolly","year":"1990","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(00)00268-X_BIB12","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/BF02430368","article-title":"Embedding of a sequential procedure within an evolutionary algorithm for coloring problems in graphs","volume":"1","author":"Costa","year":"1995","journal-title":"Journal of Heuristics"},{"key":"10.1016\/S0377-2217(00)00268-X_BIB13","unstructured":"Cung, V.-D., Mautor, T., Michelon, P., Tavares, A., 1997. A scatter search based approach for the quadratic assignment problem. In: Baeck, T., Michalewicz, Z., Yao, X. (Eds.), Proceedings of the IEEE International Conference on Evolutionary Computation and Evolutionary Programming. pp. 165\u2013170"},{"key":"10.1016\/S0377-2217(00)00268-X_BIB14","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1109\/4235.585892","article-title":"Ant colony system: A cooperative learning approach to the traveling salesman problem","volume":"1","author":"Dorigo","year":"1997","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"10.1016\/S0377-2217(00)00268-X_BIB15","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1109\/3477.484436","article-title":"The ant system: Optimization by a colony of cooperating agents","volume":"26B","author":"Dorigo","year":"1996","journal-title":"IEEE Transactions on Systems Man an Cybernetics"},{"key":"10.1016\/S0377-2217(00)00268-X_BIB16","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1287\/trsc.31.1.49","article-title":"A tabu search heuristic for the vehicle routing problem with backhauls and time windows","volume":"31","author":"Duhamel","year":"1997","journal-title":"Transportation Science"},{"key":"10.1016\/S0377-2217(00)00268-X_BIB17","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1287\/ijoc.4.1.32","article-title":"Some convergence results for probabilistic tabu search","volume":"4","author":"Faigle","year":"1992","journal-title":"ORSA Journal on Computing"},{"key":"10.1016\/S0377-2217(00)00268-X_BIB18","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF01096763","article-title":"Greedy randomized adaptive search procedures","volume":"16","author":"Feo","year":"1995","journal-title":"Journal of Global Optimization"},{"key":"10.1016\/S0377-2217(00)00268-X_BIB19","first-page":"190","article-title":"Genetic hybrids for the quadratic assignment problem","volume":"16","author":"Fleurent","year":"1996","journal-title":"DIMACS Series in Mathematics and Theoretical Computer Science"},{"key":"10.1016\/S0377-2217(00)00268-X_BIB20","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1007\/BF02125407","article-title":"Genetic and hybrid algorithms for graph coloring","volume":"63","author":"Fleurent","year":"1996","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0377-2217(00)00268-X_BIB21","doi-asserted-by":"crossref","unstructured":"Gambardella, L.M., Dorigo, M., 1996. Solving symmetric and asymmetric TSPs by ant colonies. In: Proceedings of the IEEE Conference on Evolutionary Computation (ICEC'96). IEEE Press, New York, pp. 622\u2013627","DOI":"10.1109\/ICEC.1996.542672"},{"key":"10.1016\/S0377-2217(00)00268-X_BIB22","unstructured":"Gambardella, L.M., Taillard, \u00c9.D., Agazzi, G. MACS-VRPTW: A multiple ant colony system for vehicle routing problems with time windows. In: Corne, D., Glover, F., Dorigo, M. (Eds.), New Ideas in Optimisation. McGraw-Hill, New York, pp. 63\u201376"},{"key":"10.1016\/S0377-2217(00)00268-X_BIB23","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1057\/palgrave.jors.2600676","article-title":"Ant colonies for the quadratic assignment problem","volume":"50","author":"Gambardella","year":"1999","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/S0377-2217(00)00268-X_BIB24","doi-asserted-by":"crossref","first-page":"1276","DOI":"10.1287\/mnsc.40.10.1276","article-title":"A tabu search heuristic for the vehicle routing problem","volume":"40","author":"Gendreau","year":"1994","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(00)00268-X_BIB25","unstructured":"Gendreau, M., Badeau, P., Guertin, F., Potvin, J.-Y., Taillard, \u00c9.D., 1996. A solution procedure for real-time routing and dispatching of commercial vehicles. In: Proceedings of the Third World Congress on Intelligent Transport Systems. Orlando, FL"},{"key":"10.1016\/S0377-2217(00)00268-X_BIB26","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1287\/trsc.33.4.381","article-title":"Parallel tabu search for real-time vehicle routing and dispatching","volume":"33","author":"Gendreau","year":"1999","journal-title":"Transportation Science"},{"key":"10.1016\/S0377-2217(00)00268-X_BIB27","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1111\/j.1540-5915.1977.tb01074.x","article-title":"Heuristics for integer programming using surrogate constraints","volume":"8","author":"Glover","year":"1977","journal-title":"Decision Sciences"},{"key":"10.1016\/S0377-2217(00)00268-X_BIB28","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1016\/0305-0548(86)90048-1","article-title":"Future paths for integer programming and links to artificial intelligence","volume":"13","author":"Glover","year":"1986","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0377-2217(00)00268-X_BIB29","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","article-title":"Tabu search \u2013 Part I","volume":"1","author":"Glover","year":"1989","journal-title":"ORSA Journal on Computing"},{"key":"10.1016\/S0377-2217(00)00268-X_BIB30","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","article-title":"Tabu search \u2013 Part II","volume":"2","author":"Glover","year":"1990","journal-title":"ORSA Journal on Computing"},{"key":"10.1016\/S0377-2217(00)00268-X_BIB31","doi-asserted-by":"crossref","unstructured":"Glover, F., 1997. Tabu search and adaptive memory programming \u2013 advances, applications and challenges. In: Barr, Helgason, Kennington (Eds.), Advances in Metaheuristics, Optimization and Stochastic Modeling Technologies. Kluwer Academic Publishers, Boston, MA, pp. 1\u201375","DOI":"10.1007\/978-1-4615-4102-8_1"},{"key":"10.1016\/S0377-2217(00)00268-X_BIB32","series-title":"Tabu Search","author":"Glover","year":"1997"},{"key":"10.1016\/S0377-2217(00)00268-X_BIB33","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1016\/S0305-0548(96)00065-2","article-title":"An adaptive memory heuristic for a class of vehicle routing problems with min\u2013max objective","volume":"24","author":"Golden","year":"1997","journal-title":"Computers and OR"},{"key":"10.1016\/S0377-2217(00)00268-X_BIB34","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1287\/moor.13.2.311","article-title":"Cooling schedules for optimal annealing","volume":"13","author":"Hajek","year":"1988","journal-title":"Mathematics of Operations Research"},{"key":"10.1016\/S0377-2217(00)00268-X_BIB35","series-title":"Metaheuristics: Advances and Trends in Local Search Paradigms for Optimization","first-page":"433","article-title":"An introduction to variable neighborhood search","author":"Hansen","year":"1999"},{"key":"10.1016\/S0377-2217(00)00268-X_BIB36","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/BF02239976","article-title":"Using tabu search techniques for graph coloring","volume":"39","author":"Hertz","year":"1987","journal-title":"Computing"},{"key":"10.1016\/S0377-2217(00)00268-X_BIB37","series-title":"Adaptation in Natural and Artificial Systems","author":"Holland","year":"1975"},{"key":"10.1016\/S0377-2217(00)00268-X_BIB38","series-title":"New Ideas in Optimisation","first-page":"219","article-title":"Memetic algorithms: A short introduction","author":"Moscato","year":"1999"},{"key":"10.1016\/S0377-2217(00)00268-X_BIB39","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0167-8191(88)90098-1","article-title":"Evolution algorithms in combinatorial optimization","volume":"7","author":"M\u00fchlenbein","year":"1988","journal-title":"Parallel Computing"},{"key":"10.1016\/S0377-2217(00)00268-X_BIB40","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1007\/BF02023004","article-title":"Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem","volume":"41","author":"Osman","year":"1993","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0377-2217(00)00268-X_BIB41","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1023\/A:1009629727566","article-title":"A memory adaptive reasoning technique for solving the capacitated minimum spanning tree problem","volume":"5","author":"Patterson","year":"1999","journal-title":"Journal of Heuristics"},{"key":"10.1016\/S0377-2217(00)00268-X_BIB42","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1287\/ijoc.8.2.165","article-title":"The vehicle routing problem with time windows \u2013 Part II: Genetic search","volume":"8","author":"Potvin","year":"1996","journal-title":"INFORMS Journal on Computing"},{"key":"10.1016\/S0377-2217(00)00268-X_BIB43","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1287\/ijoc.8.2.158","article-title":"The vehicle routing problem with time windows \u2013 Part I: Tabu search","volume":"8","author":"Potvin","year":"1996","journal-title":"INFORMS Journal on Computing"},{"key":"10.1016\/S0377-2217(00)00268-X_BIB44","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/BF02430370","article-title":"Probabilistic diversification and intensification in local search for vehicle routing","volume":"1","author":"Rochat","year":"1995","journal-title":"Journal of Heuristics"},{"key":"10.1016\/S0377-2217(00)00268-X_BIB45","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/BF02125454","article-title":"Diversification strategies in tabu search algorithms for the maximum clique problem","volume":"63","author":"Soriano","year":"1996","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0377-2217(00)00268-X_BIB46","series-title":"Metaheuristics: Advances and Trends in Local Search Paradigms for Optimization","first-page":"313","article-title":"MAX\u2013MIN ant system and local search for combinatorial optimization problems \u2013 towards adaptive tools for combinatorial global optimization","author":"St\u00fctzle","year":"1999"},{"key":"10.1016\/S0377-2217(00)00268-X_BIB47","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1016\/S0167-8191(05)80147-4","article-title":"Robust taboo search for the quadratic assignment problem","volume":"17","author":"Taillard","year":"1991","journal-title":"Parallel Computing"},{"key":"10.1016\/S0377-2217(00)00268-X_BIB48","doi-asserted-by":"crossref","first-page":"661","DOI":"10.1002\/net.3230230804","article-title":"Parallel iterative search methods for vehicle routing problems","volume":"23","author":"Taillard","year":"1993","journal-title":"Networks"},{"key":"10.1016\/S0377-2217(00)00268-X_BIB49","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1287\/ijoc.6.2.108","article-title":"Parallel taboo search techniques for the job shop scheduling problem","volume":"6","author":"Taillard","year":"1994","journal-title":"ORSA Journal on Computing"},{"key":"10.1016\/S0377-2217(00)00268-X_BIB50","unstructured":"Taillard, \u00c9.D., 1994. A diversification\/intensification technique for local search applied to vehicle routing problems, Working paper, Centre de recherche sur les transports, Universit\u00e9 de Montr\u00e9al, Canada"},{"key":"10.1016\/S0377-2217(00)00268-X_BIB51","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0966-8349(95)00008-6","article-title":"Comparison of iterative searches for the quadratic assignment problem","volume":"3","author":"Taillard","year":"1995","journal-title":"Location Science"},{"key":"10.1016\/S0377-2217(00)00268-X_BIB52","unstructured":"Taillard, \u00c9.D., 1996. Heuristic methods for large centroid clustering problems, Technical report IDSIA-96-96, IDSIA, Lugano"},{"key":"10.1016\/S0377-2217(00)00268-X_BIB53","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1051\/ro:1999101","article-title":"A heuristic column generation method for the heterogeneous VRP","volume":"33","author":"Taillard","year":"1999","journal-title":"Operations Research \u2013 Recherche op\u00e9rationnelle"},{"key":"10.1016\/S0377-2217(00)00268-X_BIB54","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1287\/trsc.31.2.170","article-title":"A tabu search heuristic for the vehicle routing problem with soft time windows","volume":"31","author":"Taillard","year":"1997","journal-title":"Transportation Science"},{"key":"10.1016\/S0377-2217(00)00268-X_BIB55","unstructured":"Taillard, \u00c9.D., 1998. FANT: Fast Ant System, Technical report IDSIA-46-98, IDSIA, Lugano"},{"key":"10.1016\/S0377-2217(00)00268-X_BIB56","doi-asserted-by":"crossref","first-page":"1065","DOI":"10.1057\/jors.1996.133","article-title":"Vehicle routing with multiple use of vehicles","volume":"47","author":"Taillard","year":"1996","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/S0377-2217(00)00268-X_BIB57","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0305-0548(93)E0020-T","article-title":"A genetic approach to the quadratic assignment problem","volume":"22","author":"Tate","year":"1995","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0377-2217(00)00268-X_BIB58","doi-asserted-by":"crossref","unstructured":"Thangiah, S.R. 1995. An adaptive clustering method using a geometric shape for vehicle routing problems with time windows. In: Eshelman L.J. (Ed.), Proceedings of the Sixth International Conference on Genetic Algorithms. Morgan Kaufmann, San Mateo, CA, pp. 536\u2013543","DOI":"10.1201\/9781420050073.ch11"},{"key":"10.1016\/S0377-2217(00)00268-X_BIB59","doi-asserted-by":"crossref","unstructured":"Thangiah, S.R., Nygard, K.E., Juell, P.L., 1991. GIDEON: A genetic algorithm system for vehicle routing with time windows. In: Proceedings of the Seventh IEEE Conference on Artificial Intelligence Applications. IEEE Computer Soc. Press, Silver Spring, MD, pp. 322\u2013328","DOI":"10.1109\/CAIA.1991.120888"},{"key":"10.1016\/S0377-2217(00)00268-X_BIB60","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1080\/01966324.1993.10737361","article-title":"Algorithms for vehicle routing problems with time deadlines","volume":"13","author":"Thangiah","year":"1993","journal-title":"American Journal of Mathematical and Management Sciences"},{"key":"10.1016\/S0377-2217(00)00268-X_BIB61","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1287\/mnsc.12.10.B450","article-title":"The facilities layout problem in perspective","volume":"12","author":"Vollmann","year":"1966","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(00)00268-X_BIB62","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1287\/trsc.30.4.379","article-title":"A network-flow based tabu search heuristic for the vehicle routing problem","volume":"30","author":"Xu","year":"1996","journal-title":"Transportation Science"},{"key":"10.1016\/S0377-2217(00)00268-X_BIB63","unstructured":"Zufferey, N., 1998. Coloration de graphe \u00e0 l'aide de m\u00e9thodes \u00e0 m\u00e9moire adaptative, Diploma thesis, D\u00e9partement de math\u00e9matiques, \u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne, Lausanne"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S037722170000268X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S037722170000268X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,17]],"date-time":"2020-01-17T19:28:34Z","timestamp":1579289314000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S037722170000268X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,11]]},"references-count":63,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2001,11]]}},"alternative-id":["S037722170000268X"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(00)00268-x","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2001,11]]}}}