{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,7]],"date-time":"2026-08-07T23:08:19Z","timestamp":1786144099178,"version":"3.56.0"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540220077","type":"print"},{"value":"9783540246770","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24677-0_57","type":"book-chapter","created":{"date-parts":[[2010,9,8]],"date-time":"2010-09-08T21:37:46Z","timestamp":1283981866000},"page":"552-561","source":"Crossref","is-referenced-by-count":6,"title":["Improved GRASP with Tabu Search for Vehicle Routing with Both Time Window and Limited Number of Vehicles"],"prefix":"10.1007","author":[{"given":"Zhiye","family":"Li","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Songshan","family":"Guo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fan","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Andrew","family":"Lim","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"57_CR1","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1080\/01966324.1986.10737197","volume":"6","author":"E. Baker","year":"1986","unstructured":"Baker, E., Schaffer, J.: Computational experience with branch exchange heuristics for vehicle routing problems with time window constraints. American Journal of Mathematical and Management Sciences\u00a06, 261\u2013300 (1986)","journal-title":"American Journal of Mathematical and Management Sciences"},{"key":"57_CR2","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1287\/ijoc.7.1.10","volume":"7","author":"G. Kontoravdis","year":"1995","unstructured":"Kontoravdis, G., Bard, J.F.: A grasp for the vehicle routing problem with time windows. ORSA Journal on Computing\u00a07, 10\u201323 (1995)","journal-title":"ORSA Journal on Computing"},{"key":"57_CR3","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1093\/comjnl\/10.1.10","volume":"10","author":"H. Pullen","year":"1967","unstructured":"Pullen, H., Webb, M.: A computer application to a transport scheduling problem. Computer Journal\u00a010, 10\u201313 (1967)","journal-title":"Computer Journal"},{"issue":"3","key":"57_CR4","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1016\/S0377-2217(02)00363-6","volume":"148","author":"H.C. Lau","year":"2003","unstructured":"Lau, H.C., Melvyn, S., Teo, K.M.: Vehicle routing problem with time windows and a limited number of vehicles. European Journal of Operational Research\u00a0148(3), 559\u2013569 (2003)","journal-title":"European Journal of Operational Research"},{"key":"57_CR5","doi-asserted-by":"crossref","first-page":"1433","DOI":"10.1057\/jors.1995.204","volume":"46","author":"J.-Y. Potvin","year":"1995","unstructured":"Potvin, J.-Y., Rousseau, J.-M.: An exchange heuristic for routing problems with time windows. Journal of Operational Research Society\u00a046, 1433\u20131446 (1995)","journal-title":"Journal of Operational Research Society"},{"key":"57_CR6","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1057\/jors.1968.73","volume":"19","author":"K. Knight","year":"1968","unstructured":"Knight, K., Hofer, J.: Vehicle scheduling with timed and connected calls: A case study. Operational Research Quarterly\u00a019, 299\u2013310 (1968)","journal-title":"Operational Research Quarterly"},{"key":"57_CR7","unstructured":"Resend, M.: Greedy randomized adaptive search procedures (grasp), Technical Report 98.41.1. AT&T Labs Research, Florham Park, NJ (1998)"},{"key":"57_CR8","unstructured":"Solomon, M.M.: \n                    \n                      http:\/\/web.cba.neu.edu\/msolomon\/problems.htm"},{"key":"57_CR9","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1287\/opre.35.2.254","volume":"32","author":"M.M. Solomon","year":"1987","unstructured":"Solomon, M.M.: Algorithms for vehicle routing and scheduling problems with time window constraints. Operations Research\u00a032, 254\u2013265 (1987)","journal-title":"Operations Research"},{"key":"57_CR10","first-page":"85","volume-title":"Vehicle routing: Methods and studies","author":"M.M. Solomon","year":"1988","unstructured":"Solomon, M.M., Barker, E., Schaffer, J.: Vehicle routing and scheduling problems with time windows constraints: Efficient implementations of solution improvement procedures. In: Golden, B.L., Assad, A.A. (eds.) Vehicle routing: Methods and studies, pp. 85\u2013106. North-Holland, Amsterdam (1988)"},{"key":"57_CR11","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/BF02022044","volume":"4","author":"M.W.P. Savelsbergh","year":"1985","unstructured":"Savelsbergh, M.W.P.: An efficient implementation of local search algorithms for constrained routing problems. Annals of Operations Research\u00a04, 285\u2013305 (1985)","journal-title":"Annals of Operations Research"},{"key":"57_CR12","first-page":"473","volume-title":"Meta Heuristics: Advances and Trends in Local Search Paradigms for Optimisation","author":"P.J. Kilby","year":"1998","unstructured":"Kilby, P.J., Prosser, P., Shaw, P.: Guided local search for the vehicle routing problem with time windows. In: Voss, S., Martello, S., Osman, I.H., Roucairol, C. (eds.) Meta Heuristics: Advances and Trends in Local Search Paradigms for Optimisation, pp. 473\u2013486. Kluwer, Boston (1998)"},{"key":"57_CR13","doi-asserted-by":"publisher","first-page":"935","DOI":"10.1287\/opre.41.5.935","volume":"41","author":"P.M. Thompson","year":"1993","unstructured":"Thompson, P.M., Psaraftis, H.N.: Cyclic transfer algorithms for multi-vehicle routing and scheduling problems. Operations Research\u00a041, 935\u2013946 (1993)","journal-title":"Operations Research"},{"key":"57_CR14","unstructured":"Cordone, R., Wolfer Calvo, R.: Note on time window constraints in routing problems, Internal Report 96.005, Politecnico di Milano, Dipartimento di Elettronica e Informazione, Milan, Italy (1996)"},{"key":"57_CR15","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1287\/opre.25.3.517","volume":"25","author":"R.A. Russell","year":"1977","unstructured":"Russell, R.A.: An effective heuristics for the m-tour traveling salesman problem with some side conditions. Operations Research\u00a025, 517\u2013524 (1977)","journal-title":"Operations Research"},{"key":"57_CR16","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1287\/trsc.29.2.156","volume":"29","author":"R.A. Russell","year":"1995","unstructured":"Russell, R.A.: Hybrid heuristics for the vehicle routing problem with time windows. Transportation Science\u00a029, 156\u2013166 (1995)","journal-title":"Transportation Science"},{"key":"57_CR17","unstructured":"Thangiah, S.R., Osman, I.H., Sun, T.: Hybird genetic algorithm, simulated annealing and tabu search methods for vehicle routing problems with time windows, Technical Report UKC\/OR94\/4, Institute of Mathematics and Statistics, University of Kent, Canterbury, UK (1994)"},{"issue":"2","key":"57_CR18","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0167-6377(89)90002-3","volume":"8","author":"T. Feo","year":"1989","unstructured":"Feo, T., Resende, M.: A probabilistic heuristic for a computationally difficult set covering problem. Operations Research letters\u00a08(2), 67\u201371 (1989)","journal-title":"Operations Research letters"},{"key":"57_CR19","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1287\/ijoc.9.4.417","volume":"9","author":"W.-C. Chiang","year":"1997","unstructured":"Chiang, W.-C., Russell, R.A.: A reactive tabu search metaheuristic for the vehicle routing problem with time windows. INFORMS Journal on Computing\u00a09, 417\u2013430 (1997)","journal-title":"INFORMS Journal on Computing"},{"key":"57_CR20","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/BF02430370","volume":"1","author":"Y. Rochat","year":"1995","unstructured":"Rochat, Y., Taillard, E.D.: Probabilistic diversification and intensification in local search for vehicle routing. Journal of Heuristics\u00a01, 147\u2013167 (1995)","journal-title":"Journal of Heuristics"}],"container-title":["Lecture Notes in Computer Science","Innovations in Applied Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24677-0_57.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:01:09Z","timestamp":1620010869000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24677-0_57"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540220077","9783540246770"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24677-0_57","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}