{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,17]],"date-time":"2026-06-17T22:34:27Z","timestamp":1781735667916,"version":"3.54.5"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1996,2,1]],"date-time":"1996-02-01T00:00:00Z","timestamp":823132800000},"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":[[1996,2]]},"DOI":"10.1007\/bf02601637","type":"journal-article","created":{"date-parts":[[2007,4,7]],"date-time":"2007-04-07T05:16:21Z","timestamp":1175922981000},"page":"3-27","source":"Crossref","is-referenced-by-count":235,"title":["Simulated annealing metaheuristics for the vehicle routing problem with time windows"],"prefix":"10.1007","volume":"63","author":[{"given":"Wen-Chyuan","family":"Chiang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Robert A.","family":"Russell","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"BF02601637_CR1","first-page":"261","volume":"6","author":"E. Baker","year":"1986","unstructured":"E. Baker and J. Schaffer, Solution improvement heuristics for the vehicle routing and scheduling problem with time window constraints, Amer. J. Math. Manag. Sci. 6 (1986) 261\u2013300.","journal-title":"Amer. J. Math. Manag. Sci."},{"key":"BF02601637_CR2","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/0377-2217(86)90193-1","volume":"26","author":"E. Bonomi","year":"1986","unstructured":"E. Bonomi and J.L. Lutton, The asymptotic behavior of quadratic sum assignment problems: A statistical mechanics approach, Euro. J. Oper. Res. 26 (1986) 295\u2013300.","journal-title":"Euro. J. Oper. Res."},{"key":"BF02601637_CR3","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/BF00940812","volume":"45","author":"V. Cerny","year":"1985","unstructured":"V. Cerny, Thermodynamic approach to the traveling salesman problem, J. Optim. Theory Appl. 45 (1985) 41\u201351.","journal-title":"J. Optim. Theory Appl."},{"key":"BF02601637_CR4","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/0377-2217(90)90301-Q","volume":"46","author":"D.T. Connolly","year":"1990","unstructured":"D.T. Connolly, An improved annealing scheme for the QAP, Euro. J. Op\u00e9r. Res. 46 (1990) 93\u2013100.","journal-title":"Euro. J. Op\u00e9r. Res."},{"key":"BF02601637_CR5","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1002\/net.3230140205","volume":"14","author":"N. Christofides","year":"1984","unstructured":"N. Christofides and J. Beasley, The period routing problem, Networks 14 (1984) 237\u2013246.","journal-title":"Networks"},{"key":"BF02601637_CR6","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1287\/opre.40.2.342","volume":"40","author":"M. Desrochers","year":"1992","unstructured":"M. Desrochers, J. Desrosiers and M. Solomon, A new optimization algorithm for the vehicle routing problem with time windows, Oper. Res. 40 (1992) 342\u2013354.","journal-title":"Oper. Res."},{"key":"BF02601637_CR7","first-page":"65","volume-title":"Vehicle Routing: Methods and Studies","author":"M. Desrochers","year":"1988","unstructured":"M. Desrochers, J.K. Lenstra, J.K. Savelsberg and F. Soumis, Vehicle routing with time windows: Optimization and approximation, in:Vehicle Routing: Methods and Studies, ed. B.L. Golden and A.A. Assad. (North-Holland, Amsterdam, 1988), pp. 65\u201384."},{"key":"BF02601637_CR8","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 generalized assignment heuristic for vehicle routing, Networks 11 (1981) 109\u2013124.","journal-title":"Networks"},{"key":"BF02601637_CR9","series-title":"Research Report 4C\/1991","volume-title":"Vehicle routing with time windows","author":"M. Fisher","year":"1991","unstructured":"M. Fisher K.O. J\u00f6rnsten and O.B.G. Madsen, Vehicle routing with time windows, Research Report 4C\/1991, IMSOR, Technical University of Denmark, DK-2800 Lyngby, Denmark (1991)."},{"key":"BF02601637_CR10","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1287\/trsc.26.1.18","volume":"26","author":"T. Friesz","year":"1992","unstructured":"T. Friesz, H.-J. Cho, N. Mehta, R. Tobin and G. Anandalingam, A simulated annealing approach to the network design problem with variational inequality constraints, Transp. Sci. 26 (1992) 18\u201326.","journal-title":"Transp. Sci."},{"key":"BF02601637_CR11","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1016\/0305-0548(86)90048-1","volume":"5","author":"F. Glover","year":"1986","unstructured":"F. Glover, Future paths for integer programming and links to artificial intelligence, Comp. Oper. Res. 5 (1986) 533\u2013549.","journal-title":"Comp. Oper. Res."},{"key":"BF02601637_CR12","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F. Glover","year":"1990","unstructured":"F. Glover, Tabu search, Part 1, ORSA J. Comp. 1 (1990) 190\u2013206.","journal-title":"ORSA J. Comp."},{"key":"BF02601637_CR13","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1287\/inte.20.4.74","volume":"20","author":"F. Glover","year":"1990","unstructured":"F. Glover, Tabu search: A tutorial, Interfaces 20 (1990) 74\u201394.","journal-title":"Interfaces"},{"key":"BF02601637_CR14","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","volume":"2","author":"F. Glover","year":"1991","unstructured":"F. Glover, Tabu search, Part 2, ORSA J. Comp. 2 (1991) 4\u201332.","journal-title":"ORSA J. Comp."},{"key":"BF02601637_CR15","unstructured":"F. Glover and M.M. Laguna, Tabu search, in:Modern Heuristic Techniques for Combinatorial Problems, ed. C.R. Reeves (1993) pp. 70\u2013150."},{"key":"BF02601637_CR16","first-page":"3","volume":"40","author":"F. Glover","year":"1993","unstructured":"F. Glover, E. Taillard and D. de Werra, A user's guide to tabu search, Ann. Oper Res. 40 (1993) 3\u201330.","journal-title":"Ann. Oper Res."},{"key":"BF02601637_CR17","doi-asserted-by":"crossref","first-page":"865","DOI":"10.1287\/opre.37.6.865","volume":"37","author":"D.S. Johnson","year":"1989","unstructured":"D.S. Johnson, C.R. Aragon, L.A. McGeoch and C. Schevon, Optimization by simulated annealing: An experimental evaluation: Part I, Graph partitioning, Oper. Res. 37 (1989) 865\u2013892.","journal-title":"Oper. Res."},{"key":"BF02601637_CR18","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1287\/opre.39.3.378","volume":"39","author":"D.S. Johnson","year":"1991","unstructured":"D.S. Johnson, C.R. Aragon, L.A. McGeoch and C. Schevon, Optimization by simulated annealing: An experimental evaluation: Part II, Graph coloring and number partitioning, Oper. Res. 39 (1991) 378\u2013406.","journal-title":"Oper. Res."},{"key":"BF02601637_CR19","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S. Kirkpatrick","year":"1983","unstructured":"S. Kirkpatrick, D.D. Gelatt and M.P. Vecchi, Optimization by simulated annealing, Science 220 (1983) 671\u2013680.","journal-title":"Science"},{"key":"BF02601637_CR20","unstructured":"G. Kontoravdis and J. Bard, Improved heuristics for the vehicle routing problems with time windows, Working Paper, Operations Research Group, The University of Texas at Austin (1992)."},{"key":"BF02601637_CR21","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1287\/trsc.26.2.69","volume":"26","author":"Y.A. Koskosidis","year":"1992","unstructured":"Y.A. Koskosidis, W.B. Powell and M.M. Solomon, An optimization-based heuristic for vehicle routing and scheduling with soft time window constraints, Transp. Sci. 26 (1992) 69\u201385.","journal-title":"Transp. Sci."},{"key":"BF02601637_CR22","doi-asserted-by":"crossref","first-page":"492","DOI":"10.1287\/mnsc.39.4.492","volume":"39","author":"M.M. Laguna","year":"1993","unstructured":"M.M. Laguna and F. Glover, Bandwidth packing: A tabu search approach, Manag. Sci. 39 (1993) 492\u2013500.","journal-title":"Manag. Sci."},{"key":"BF02601637_CR23","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/BF02022094","volume":"21","author":"H. Matsuo","year":"1989","unstructured":"H. Matsuo, C. Suh and R. Sullivan, A controlled search simulated annealing method for the single machine weighted tardiness problems, Ann. Oper. Res. 21 (1989) 85\u2013108.","journal-title":"Ann. Oper. Res."},{"key":"BF02601637_CR24","unstructured":"H. Matsuo, C. Suh and R. Sullivan, A controlled search simulated annealing method for the general job shop scheduling problem, Working Paper, Graduate School of Business, University of Texas at Austin (1987)."},{"key":"BF02601637_CR25","doi-asserted-by":"crossref","first-page":"1087","DOI":"10.1063\/1.1699114","volume":"21","author":"N. Metropolis","year":"1953","unstructured":"N. Metropolis, A. Rosenbluth, M. Rosenbluth, A. Teller and E. Teller, Equation of state calculation by fast computing machines, J. Chem. Phys. 21 (1953) 1087\u20131091.","journal-title":"J. Chem. Phys."},{"key":"BF02601637_CR26","unstructured":"I. Or, Traveling salesman-type combinatorial problems and their relation to the logistics of blood banking, Ph.D. Thesis, Department of Industrial Engineering and Management Sciences, Northwestern University (1976)."},{"key":"BF02601637_CR27","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1007\/BF02023004","volume":"40","author":"I.H. Osman","year":"1993","unstructured":"I.H. Osman, Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problems, Ann. Oper. Res. 40 (1993) 421\u2013452.","journal-title":"Ann. Oper. Res."},{"key":"BF02601637_CR28","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1016\/0377-2217(93)90221-8","volume":"66","author":"J.Y. Potvin","year":"1993","unstructured":"J.Y. Potvin and J.M. Rousseau, A parallel route building algorithm for the vehicle routing and scheduling problem with time windows, Euro. J. Oper. Res. 66 (1993) 331\u2013340.","journal-title":"Euro. J. Oper. Res."},{"key":"BF02601637_CR29","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1287\/opre.25.3.517","volume":"25","author":"R. Russell","year":"1977","unstructured":"R. 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":"BF02601637_CR30","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1287\/trsc.29.2.156","volume":"29","author":"R. Russell","year":"1995","unstructured":"R. Russell, Hybrid heuristics for the vehicle routing problem with time windows, Transp. Sci. 29 (1995) 156\u2013166.","journal-title":"Transp. Sci."},{"key":"BF02601637_CR31","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/BF02022044","volume":"4","author":"M. Savelsbergh","year":"1985","unstructured":"M. Savelsbergh, Local search in routing problems with time windows, Ann. Oper. Res. 4 (1985) 285\u2013305.","journal-title":"Ann. Oper. Res."},{"key":"BF02601637_CR32","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1287\/opre.35.2.254","volume":"35","author":"M. Solomon","year":"1987","unstructured":"M. Solomon, Algorithms for the vehicle routing and cheduling problem with time window constraints, Oper. Res. 35 (1987) 254\u2013265.","journal-title":"Oper. Res."},{"key":"BF02601637_CR33","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/trsc.22.1.1","volume":"22","author":"M. Solomon","year":"1988","unstructured":"M. Solomon and J. Desrosiers, Time window constrained routing and scheduling problems, Transp. Sci. 22 (1988) 1\u201313.","journal-title":"Transp. Sci."},{"key":"BF02601637_CR34","first-page":"85","volume-title":"Vehicle Routing: Methods and Studies","author":"M.M. Solomon","year":"1985","unstructured":"M.M. Solomon, E.K. Baker and J.R. Schaffer, Vehicle routing and scheduling problems with time window constraints: Efficient implementations of solution improvement procedures, in:Vehicle Routing: Methods and Studies, ed. B.L. Golden and A.A. Assad (North-Holland, Amsterdam, 1985), pp. 85\u2013105."},{"key":"BF02601637_CR35","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 tabu search for the quadratic assignment problem, Parallel Comp 17 (1991) 443\u2013455.","journal-title":"Parallel Comp"},{"key":"BF02601637_CR36","unstructured":"S.R. Thangiah, K.E. Nygard and P.L. Juell, GIDEON: A genetic algorithm system for vehicle routing problems with time windows,Proc. 7th IEEE Conf. on Artificial Intelligence Applications, Miami, FL (1991)."},{"key":"BF02601637_CR37","unstructured":"S.R. Thangiah, I.H. Osman and T. Sun, Hybrid genetic algorithms, simulated annealing and tabu search methods for the vehicle routing problem with time windows (1994)."},{"key":"BF02601637_CR38","doi-asserted-by":"crossref","first-page":"935","DOI":"10.1287\/opre.41.5.935","volume":"41","author":"P.M. Thompson","year":"1993","unstructured":"P.M. Thompson and H. Psaraftis, Cyclic transfer algorithms for multi-vehicle routing and scheduling problems, Oper. Res. 41 (1993) 935\u2013946.","journal-title":"Oper. Res."},{"key":"BF02601637_CR39","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-015-7744-1","volume-title":"Simulated Annealing: Theory and Applications","author":"P.J.M. Laarhoven van","year":"1987","unstructured":"P.J.M. van Laarhoven and E.H. Aarts,Simulated Annealing: Theory and Applications, (Reidel, Dordrecht, 1987)."},{"key":"BF02601637_CR40","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1080\/07408178708975376","volume":"19","author":"M.R. Wilhelm","year":"1987","unstructured":"M.R. Wilhelm and T.L. Ward, Solving quadratic assignment problems by simulated annealing, IEEE Trans. 19 (1987) 107\u2013119.","journal-title":"IEEE Trans."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02601637.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02601637\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02601637","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T08:14:48Z","timestamp":1558340088000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02601637"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,2]]},"references-count":40,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1996,2]]}},"alternative-id":["BF02601637"],"URL":"https:\/\/doi.org\/10.1007\/bf02601637","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,2]]}}}