{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T23:20:16Z","timestamp":1768000816289,"version":"3.49.0"},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1993,12,1]],"date-time":"1993-12-01T00:00:00Z","timestamp":754704000000},"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":[[1993,12]]},"DOI":"10.1007\/bf02023006","type":"journal-article","created":{"date-parts":[[2005,8,10]],"date-time":"2005-08-10T09:49:15Z","timestamp":1123667355000},"page":"469-488","source":"Crossref","is-referenced-by-count":154,"title":["Solving real-life vehicle routing problems efficiently using tabu search"],"prefix":"10.1007","volume":"41","author":[{"given":"Fr\u00e9d\u00e9ric","family":"Semet","sequence":"first","affiliation":[]},{"given":"Eric","family":"Taillard","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF02023006_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/mnsc.24.1.1","volume":"24","author":"G.H. Bradley","year":"1977","unstructured":"G.H. Bradley, G.G. Brown and G.W. Graves, Design and implementation of large scale primal transshipment algorithms, Manag. Sci. 24(1977)1.","journal-title":"Manag. Sci."},{"key":"BF02023006_CR2","unstructured":"D. Costa, A tabu search algorithm for computing an operational timetable, ORWP 90\/91, DMA, \u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne (1990), Eur. J. Oper. Res., to appear."},{"key":"BF02023006_CR3","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1002\/net.3230110205","volume":"11","author":"M.L. Fisher","year":"1981","unstructured":"M.L. Fisher and R. Jaikumar, A generalized assignment heuristic for vehicle routing, Networks 11(1981)109.","journal-title":"Networks"},{"key":"BF02023006_CR4","unstructured":"A. Hertz, Finding a feasible course schedule using tabu search, Publication 703, University of Montreal (1990)."},{"key":"BF02023006_CR5","doi-asserted-by":"crossref","first-page":"2245","DOI":"10.1002\/j.1538-7305.1965.tb04146.x","volume":"44","author":"S. Lin","year":"1965","unstructured":"S. Lin, Computer solutions of the traveling salesman problem, Bell Syst. Tech. J. 44(1965)2245.","journal-title":"Bell Syst. Tech. J."},{"key":"BF02023006_CR6","volume-title":"Combinatorial Optimization Algorithms and Complexity","author":"C.H. Papadimitriou","year":"1982","unstructured":"C.H. Papadimitriou and K. Steiglitz,Combinatorial Optimization Algorithms and Complexity (Prentice-Hall, Englewood Cliffs, 1982)."},{"key":"BF02023006_CR7","unstructured":"F. Semet, Probl\u00e8mes de tourn\u00e9es de v\u00e9hicules sous contraintes d'inaccessibilit\u00e9, Internal Report, DMA, \u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne (1991)."},{"key":"BF02023006_CR8","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1287\/opre.35.2.254","volume":"35","author":"M.M. Solomon","year":"1987","unstructured":"M.M. Solomon, Algorithms for the vehicle routing and scheduling problems with time window constraints, Oper. Res. 35(1987)254.","journal-title":"Oper. Res."},{"key":"BF02023006_CR9","unstructured":"E. Taillard, Parellel taboo search for the job shop scheduling problem, ORWP 89\/11, DMA, \u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne (1989), ORSA J. Comput., to appear."},{"key":"BF02023006_CR10","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1016\/S0167-8191(05)80147-4","volume":"17","author":"E. Taillard","year":"1991","unstructured":"E. Taillard, Robust taboo search for the quadratic assignment problem, Parallel Comput. 17(1991)443.","journal-title":"Parallel Comput."},{"key":"BF02023006_CR11","first-page":"165","volume":"23","author":"M.L. Tricot","year":"1989","unstructured":"M.L. Tricot and M. Donegani, Formules de r\u00e9actualisation pour une famille d'indices de proximit\u00e9 inter-classe en classification hi\u00e9rarchique, RAIRO Recherche Op\u00e9rationnelle 23(1989)165.","journal-title":"RAIRO Recherche Op\u00e9rationnelle"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02023006.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02023006\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02023006","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T18:39:56Z","timestamp":1557772796000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02023006"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,12]]},"references-count":11,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1993,12]]}},"alternative-id":["BF02023006"],"URL":"https:\/\/doi.org\/10.1007\/bf02023006","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,12]]}}}