{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T23:22:07Z","timestamp":1777591327632,"version":"3.51.4"},"reference-count":47,"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\/bf02023004","type":"journal-article","created":{"date-parts":[[2005,8,10]],"date-time":"2005-08-10T13:49:15Z","timestamp":1123681755000},"page":"421-451","source":"Crossref","is-referenced-by-count":708,"title":["Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem"],"prefix":"10.1007","volume":"41","author":[{"given":"Ibrahim Hassan","family":"Osman","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"BF02023004_CR1","doi-asserted-by":"crossref","unstructured":"E. Aarts and J. Korst,Simulated Annealing and Boltzmann Machine (Wiley, 1989).","DOI":"10.1111\/j.1467-9574.1989.tb01245.x"},{"key":"BF02023004_CR2","doi-asserted-by":"crossref","first-page":"731","DOI":"10.1002\/net.3230190702","volume":"19","author":"Y. Agarwal","year":"1989","unstructured":"Y. Agarwal, K. Mathur and H. Salkin, A set partitioning based exact algorithm for the vehicle routing problem, Networks 19(1989)731\u2013749.","journal-title":"Networks"},{"key":"BF02023004_CR3","doi-asserted-by":"crossref","first-page":"456","DOI":"10.1287\/opre.39.3.456","volume":"39","author":"K. Altinkemer","year":"1991","unstructured":"K. Altinkemer and B. Gavish, Parallel savings based heuristics for the delivery problem, Oper. Res. 39(1991)456\u2013469.","journal-title":"Oper. Res."},{"key":"BF02023004_CR4","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1016\/0305-0483(83)90033-6","volume":"118","author":"J. Beasley","year":"1983","unstructured":"J. Beasley, Route first-cluster second methods for vehicle routing, Omega 118(1983)403\u2013408.","journal-title":"Omega"},{"key":"BF02023004_CR5","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/inte.13.6.4","volume":"13","author":"W. Bell","year":"1983","unstructured":"W. Bell, L. Dalberto, M. Fisher, A. Greenfield, R. Jaikumar, R. Mack and P. Prutzman, Improving distribution of industrial gases with an on-line computerized routing and scheduling systems, Interfaces 13(1983)4\u201323.","journal-title":"Interfaces"},{"key":"BF02023004_CR6","first-page":"69","volume":"10","author":"L. Bodin","year":"1983","unstructured":"L. Bodin, B. Golden, A. Assad and M. Ball, Routing and scheduling of vehicles and crews: The state of the art, Comp. Oper. Res. 10(1983)69\u2013211.","journal-title":"Comp. Oper. Res."},{"key":"BF02023004_CR7","doi-asserted-by":"crossref","first-page":"571","DOI":"10.1287\/opre.38.4.571","volume":"38","author":"L. Bodin","year":"1990","unstructured":"L. Bodin, Twenty years of routing and scheduling, Oper. Res. 38(1990)571\u2013579.","journal-title":"Oper. Res."},{"key":"BF02023004_CR8","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1287\/mnsc.27.1.19","volume":"27","author":"G. Brown","year":"1981","unstructured":"G. Brown and G. Graves, Real-time dispatch of petroleum tank trunks, Manag. Sci. 27(1981)19\u201332.","journal-title":"Manag. Sci."},{"key":"BF02023004_CR9","unstructured":"N. Christofides, Vehicle routing, in:The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, ed. E. Lawler, J. Lenstra, A. Rinnooy Kan and D. Shmoys (Wiley, 1985)."},{"key":"BF02023004_CR10","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1057\/jors.1969.75","volume":"20","author":"N. Christofides","year":"1969","unstructured":"N. Christofides and S. Eilon, An algorithm for the vehicle dispatching problem, Oper. Res. Quart. 20(1969)309\u2013318.","journal-title":"Oper. Res. Quart."},{"key":"BF02023004_CR11","unstructured":"N. Christofides, A. Mingozzi and P. Toth, The vehicle routing problem, in:Combinatorial Optimization, ed. N. Christofides, A. Mingozzi, P. Toth and C. Sandi (Wiley, 1979)."},{"key":"BF02023004_CR12","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/BF01589353","volume":"20","author":"N. Christofides","year":"1981","unstructured":"N. Christofides, A. Mingozzi and P. Toth, Exact algorithms for the vehicle routing problem, based on spanning tree shortest path relaxation, Math. Progr. 20(1981)255\u2013282.","journal-title":"Math. Progr."},{"key":"BF02023004_CR13","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1002\/net.3230110207","volume":"11","author":"N. Christofides","year":"1981","unstructured":"N. Christofides, A. Mingozzi and P. Toth, State space relaxation procedures for the computation of bounds to routing problems, Networks 11(1981)145\u2013164.","journal-title":"Networks"},{"key":"BF02023004_CR14","doi-asserted-by":"crossref","first-page":"568","DOI":"10.1287\/opre.12.4.568","volume":"12","author":"G. Clarke","year":"1964","unstructured":"G. Clarke and J.W. Wright, Scheduling of vehicles from a central depot to a number of delivery points, Oper. Res. 12(1964)568\u2013581.","journal-title":"Oper. Res."},{"key":"BF02023004_CR15","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1057\/jors.1985.82","volume":"36","author":"S. Evans","year":"1985","unstructured":"S. Evans and J. Norback, The impact of a decision-support system for vehicle routing in a food service supply situation, J. Oper. Res. Soc. 36(1985)467\u2013472.","journal-title":"J. Oper. Res. Soc."},{"key":"BF02023004_CR16","first-page":"45","volume":"1","author":"M. Fisher","year":"1982","unstructured":"M. Fisher, R. Greenfield, R. Jaikumar and J. Lester, A computerized vehicle routing application, Interfaces 1(1982)45\u201352.","journal-title":"Interfaces"},{"key":"BF02023004_CR17","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1002\/net.3230110205","volume":"11","author":"M. Fisher","year":"1981","unstructured":"M. Fisher and R. Jaikumar, A generalised assignment heuristic for vehicle routing, Networks 11(1981)109\u2013124.","journal-title":"Networks"},{"key":"BF02023004_CR18","volume-title":"Operational Research'87, IFORS, 1988","author":"M. Fisher","year":"1988","unstructured":"M. Fisher, Lagrangian optimization algorithms for vehicle routing problems, in:Operational Research'87, IFORS, 1988, ed. G.K. Rand (Elsevier Science\/North-Holland, 1988)."},{"key":"BF02023004_CR19","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1057\/jors.1967.44","volume":"18","author":"T. Gaskell","year":"1967","unstructured":"T. Gaskell, Bases for vehicle fleet scheduling, Oper. Res. Quart. 18(1967)367\u2013384.","journal-title":"Oper. Res. Quart."},{"key":"BF02023004_CR20","volume-title":"A tabu search heuristic for the vehicle routing problem","author":"M. Gendreau","year":"1991","unstructured":"M. Gendreau, A. Hertz and G. Laporte, A tabu search heuristic for the vehicle routing problem, Report CRT-777, Centre de Recherche sur les Transports, Universit\u00e9 de Montr\u00e9al, Canada (1991)."},{"key":"BF02023004_CR21","first-page":"340","volume":"24","author":"B. Gillet","year":"1976","unstructured":"B. Gillet and L. Miller, A heuristic algorithm for vehicle dispatches, Oper. Res. 24(1976)340\u2013349.","journal-title":"Oper. Res."},{"key":"BF02023004_CR22","doi-asserted-by":"crossref","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, Comp. Oper. Res. 13(1986)533\u2013549.","journal-title":"Comp. Oper. Res."},{"key":"BF02023004_CR23","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F. Glover","year":"1989","unstructured":"F. Glover, Tabu search, Part I, ORSA J. Comput. 1(1989)190\u2013206.","journal-title":"ORSA J. Comput."},{"key":"BF02023004_CR24","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 J. Comput. 2(1990)4\u201332.","journal-title":"ORSA J. Comput."},{"key":"BF02023004_CR25","volume-title":"Simple tabu thresholding in optimization","author":"F. Glover","year":"1992","unstructured":"F. Glover, Simple tabu thresholding in optimization, Graduate of Business, Unicersity of Colorado, Boulder (May 1992)."},{"key":"BF02023004_CR26","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1287\/opre.35.1.6","volume":"35","author":"B. Golden","year":"1987","unstructured":"B. Golden and E. Watts, Computerized vehicle routing in the soft drink industry, Oper. Res. 35(1987)6\u201317.","journal-title":"Oper. Res."},{"key":"BF02023004_CR27","volume-title":"Vehicle Routing: Methods and Studies","author":"B. Golden","year":"1988","unstructured":"B. Golden and A. Assad,Vehicle Routing: Methods and Studies (Elsevier Science\/North-Holland, 1988)."},{"key":"BF02023004_CR28","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1287\/moor.10.4.527","volume":"10","author":"M. Haimovich","year":"1985","unstructured":"M. Haimovich and A.H.G. Rinnooy Kan, Bounds and heuristics for capacitated routing problems, Math. Oper. Res. 10(1985)527\u2013542.","journal-title":"Math. Oper. Res."},{"key":"BF02023004_CR29","doi-asserted-by":"crossref","unstructured":"D.S. Johnson, Local optimization and the traveling salesman problem,Proc. 17th Int. Colloquium on Automata, Languages and Programming, Lecture Notes in Computer Science (1990) pp. 446\u2013461.","DOI":"10.1007\/BFb0032050"},{"key":"BF02023004_CR30","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S. Kirkpatrick","year":"1983","unstructured":"S. Kirkpatrick, J.C.D. Gelott and M.P. Vecchi, Optimization by simulated annealing, Science 220(1983)671\u2013680.","journal-title":"Science"},{"key":"BF02023004_CR31","doi-asserted-by":"crossref","first-page":"1050","DOI":"10.1287\/opre.33.5.1050","volume":"33","author":"G. Laporte","year":"1985","unstructured":"G. Laporte, Y. Nobert and M. Desrochers, Optimal routing under capacity and distance restriction, Oper. Res. 33(1985)1050\u20131073.","journal-title":"Oper. Res."},{"key":"BF02023004_CR32","first-page":"147","volume":"31","author":"G. Laporte","year":"1987","unstructured":"G. Laporte and Y. Nobert, Exact algorithms for the vehicle routing problem, Ann. Discr. Math. 31(1987)147\u2013184.","journal-title":"Ann. Discr. Math."},{"key":"BF02023004_CR33","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1002\/net.3230110211","volume":"11","author":"J. Lenstra","year":"1981","unstructured":"J. Lenstra and A. Rinnooy Kan, Complexity of vehicle routing and scheduling problems, Networks 11(1981)221\u2013228.","journal-title":"Networks"},{"key":"BF02023004_CR34","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. Comp. J. 44(1965)2245\u20132269.","journal-title":"Bell Syst. Comp. J."},{"key":"BF02023004_CR35","first-page":"2245","volume":"21","author":"S. Lin","year":"1973","unstructured":"S. Lin and B.W. Kernighan, An effective heuristic algorithm for the travelling salesman problem, Oper. Res. 21(1973)2245\u20132269.","journal-title":"Oper. Res."},{"key":"BF02023004_CR36","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1057\/jors.1976.95","volume":"27","author":"R.H. Mole","year":"1976","unstructured":"R.H. Mole and S.R. Jameson, A sequential route-building algorithm employing a generalised savings criterion, Oper. Res. Quart. 27(1976)503\u2013511.","journal-title":"Oper. Res. Quart."},{"key":"BF02023004_CR37","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/0305-0548(85)90026-7","volume":"12","author":"M. Nelson","year":"1985","unstructured":"M. Nelson, K. Nygard, J. Griffin and W. Shreve, Implementation techniques for the vehicle routing problem, Comp. Oper. Res. 12(1985)273\u2013283.","journal-title":"Comp. Oper. Res."},{"key":"BF02023004_CR38","volume-title":"Traveling salesman-type combinatorial optimization problems and their relation to the logistics of regional blood banking","author":"I. Or","year":"1976","unstructured":"I. Or, Traveling salesman-type combinatorial optimization problems and their relation to the logistics of regional blood banking, Ph.D. Dissertation, Northwestern University, Evanston, IL (1976)."},{"key":"BF02023004_CR39","volume-title":"Metastrategy simulated annealing and tabu search for combinatorial optimization problems","author":"I.H. Osman","year":"1991","unstructured":"I.H. Osman, Metastrategy simulated annealing and tabu search for combinatorial optimization problems, Ph.D. Dissertation, The Management School, Imperial College of Science and Medicine, University of London, London (1991)."},{"key":"BF02023004_CR40","volume-title":"Heuristics for combinatorial optimization problems: development and new directions","author":"I.H. Osman","year":"1991","unstructured":"I.H. Osman, Heuristics for combinatorial optimization problems: development and new directions,Proc. 1st Seminar on Information Technology and Applications, Markfield Conference Centre, Leicester, UK (1991)."},{"key":"BF02023004_CR41","volume-title":"A comparison of heuristics for the generalised assignment problem","author":"I.H. Osman","year":"1990","unstructured":"I.H. Osman, A comparison of heuristics for the generalised assignment problem, Working Paper, University of Kent, Canterbury, UK (1990)."},{"key":"BF02023004_CR42","unstructured":"I.H. Osman and N. Christofides, Simulated annealing and descent algorithms for capacitated clustering problems, presented as EURO-XI, Beograd, Yugoslavia (1989)."},{"key":"BF02023004_CR43","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1016\/0305-0483(89)90059-5","volume":"17","author":"I.H. Osman","year":"1989","unstructured":"I.H. Osman and C.N. Potts, Simulated annealing for permutation flow-shop scheduling, Omega 17(1989)551\u2013557.","journal-title":"Omega"},{"key":"BF02023004_CR44","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1016\/0377-2217(88)90154-3","volume":"34","author":"H. Paessens","year":"1988","unstructured":"H. Paessens, Saving algorithms for the vehicle routing problem, Eur. J. Oper. Res. 34(1988)336\u2013344.","journal-title":"Eur. J. Oper. Res."},{"key":"BF02023004_CR45","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1287\/opre.25.3.517","volume":"25","author":"R.A. Russell","year":"1977","unstructured":"R.A. Russell, An effective heuristic for theM-tour traveling salesman problem with some side conditions, Oper. Res. 25(1977)517\u2013524.","journal-title":"Oper. Res."},{"key":"BF02023004_CR46","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1016\/0377-2217(84)90050-X","volume":"15","author":"W.R. Stewart Jr.","year":"1984","unstructured":"W.R. Stewart, Jr. and B.L. Golden, A Lagrangian relaxation heuristic for vehicle routing, Eur. J. Oper. Res. 15(1984)84\u201388.","journal-title":"Eur. J. Oper. Res."},{"key":"BF02023004_CR47","volume-title":"Robust tabu search for the quadratic assignment problem","author":"E. Taillard","year":"1990","unstructured":"E. Taillard, Robust tabu search for the quadratic assignment problem, Working Paper ORWP 90\/10, D\u00e9partement de Math\u00e9matiques, Ecole Polytechnic F\u00e9d\u00e9rale de Lausanne, Switzerland (1990)."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02023004.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02023004\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02023004","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,8]],"date-time":"2020-04-08T20:09:45Z","timestamp":1586376585000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02023004"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,12]]},"references-count":47,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1993,12]]}},"alternative-id":["BF02023004"],"URL":"https:\/\/doi.org\/10.1007\/bf02023004","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,12]]}}}