{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:26:58Z","timestamp":1759847218805},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2005,6,1]],"date-time":"2005-06-01T00:00:00Z","timestamp":1117584000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Optim Applic"],"published-print":{"date-parts":[[2005,6]]},"DOI":"10.1007\/s10589-005-2181-1","type":"journal-article","created":{"date-parts":[[2005,6,27]],"date-time":"2005-06-27T15:38:51Z","timestamp":1119886731000},"page":"221-244","source":"Crossref","is-referenced-by-count":10,"title":["Parallelization Strategies for Rollout Algorithms"],"prefix":"10.1007","volume":"31","author":[{"given":"F.","family":"Guerriero","sequence":"first","affiliation":[]},{"given":"M.","family":"Mancini","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"2181_CR1","unstructured":"J.L. Bentley, \u201cExperiments on traveling salesman heuristics,\u201d in Proc. 1st Ann. ACM-SIAM Symp. on Discrete Algorithms, Philadelphia, PA, SIAM, 1990."},{"key":"2181_CR2","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1023\/A:1009634810396","volume":"5","author":"D.P. Bertsekas","year":"1999","unstructured":"D.P. Bertsekas and D.A. Castanon, \u201cRollout algorithms for stochastic scheduling problems,\u201d Journal of Heuristics, vol. 5, pp. 89\u2013108, 1999.","journal-title":"Journal of Heuristics"},{"key":"2181_CR3","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1023\/A:1009635226865","volume":"3","author":"D.P. Bertsekas","year":"1997","unstructured":"D.P. Bertsekas, J.N. Tsitsiklis, and C. Wu, \u201cRollout algorithms for combinatorial optimization problems,\u201d Journal of Heuristics, vol. 3, pp. 245\u2013262, 1997.","journal-title":"Journal of Heuristics"},{"key":"2181_CR4","volume-title":"Neuro-Dynamic Programming","author":"D.P. Bertsekas","year":"1996","unstructured":"D.P. Bertsekas and J.N. Tsitsiklis, Neuro-Dynamic Programming, Athena Scientific: Belmont, MA, 1996."},{"key":"2181_CR5","unstructured":"F. Bock, \u201cAn algorithm for solving traveling-salesman and related network optimization problems,\u201d 1958."},{"key":"2181_CR6","unstructured":"M. Dorigo and L. Gambardella, \u201cHAS-SOP: An hybrid ant system for the sequential ordering problem,\u201d Technical Report IDSIA\/11-97, IDSIA, Lugano, Switzerland, 1997."},{"key":"2181_CR7","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1016\/0377-2217(88)90333-5","volume":"37","author":"L.F. Escudero","year":"1988","unstructured":"L.F. Escudero, \u201cAn inexact algorithm for the sequential ordering problem,\u201d European Journal of Operational Research, vol. 37, pp. 232\u2013253, 1988.","journal-title":"European Journal of Operational Research"},{"key":"2181_CR8","doi-asserted-by":"crossref","unstructured":"F. Glover and M. Laguna, Tabu Search, Kluwer Academic Publishers, 1997.","DOI":"10.1007\/978-1-4615-6089-0"},{"key":"2181_CR9","doi-asserted-by":"crossref","first-page":"627","DOI":"10.1080\/1055678021000049354","volume":"17","author":"F. Guerriero","year":"2002","unstructured":"F. Guerriero, M. Mancini, and R. Musmanno, \u201cNew rollout algorithms for combinatorial optimization problems,\u201d Optimization Methods and Software, vol. 17, pp. 627\u2013654, 2002.","journal-title":"Optimization Methods and Software"},{"issue":"4598","key":"2181_CR10","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S. Kirkpatrick","year":"1983","unstructured":"S. Kirkpatrick, C.D. Gelatt, and M.P. Vecchi, \u201cOptimization by simulated annealing,\u201d Science, vol. 220, no. 4598, pp. 671\u2013680, 1983.","journal-title":"Science"},{"key":"2181_CR11","volume-title":"The Traveling Salesman Problem","author":"E.L. Lawler","year":"1985","unstructured":"E.L. Lawler, A.H. Lenstra, A.H.G. Rinnooy Kan, and D.B. Shmoys, The Traveling Salesman Problem, John Wiley & Sons, Chichester, 1985."},{"key":"2181_CR12","volume-title":"\u201cReinforcement and local search: A case study,\u201d UM-CS-1997-044, Computer Science","author":"R. Moll","year":"1997","unstructured":"R. Moll, A. Barto, T. Perkins, and R. Sutton, \u201cReinforcement and local search: A case study,\u201d UM-CS-1997-044, Computer Science, University of Massachusetts, Amherst, MA, 1997."},{"key":"2181_CR13","unstructured":"W.H. Press, S.A. Teukolsky, W.T. Vetterling, and B.P. Flannery, \u201cNumerical Recipes in C: The Art of Scientific Computing.\u201d 2nd edn. Cambridge University Press, 1992."},{"key":"2181_CR14","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","volume":"3","author":"G. Reinelt","year":"1991","unstructured":"G. Reinelt, \u201cA traveling salesman problem library,\u201d ORSA Journal on Computing, vol. 3, pp. 376\u2013384, 1991.","journal-title":"ORSA Journal on Computing"},{"key":"2181_CR15","unstructured":"N. Secomandi, \u201cExact and heuristic dynamic programming algorithms for the vehicle routing problem with stochastic demands,\u201d PhD thesis, College of Business Administration, University of Houston, Houston, TX, 1998."},{"key":"2181_CR16","unstructured":"N. Secomandi, \u201cA rollout algorithm for sequencing problems,\u201d Technical Report, Department of Decision and Information Sciences, College of Business Administration, University of Houston, Houston, TX, 1998."},{"key":"2181_CR17","first-page":"1171","volume":"27","author":"N. Secomandi","year":"2000","unstructured":"N. Secomandi,\u201cComparing neuro-dynamic programming algorithms for the vehicle routing problem with stochastic demands,\u201d Computers and Operation Research, Special Issue on Neural Networks for Business Applications, vol. 27, pp. 1171\u20131200, 2000.","journal-title":"Computers and Operation Research, Special Issue on Neural Networks for Business Applications"},{"key":"2181_CR18","unstructured":"C. Wu, \u201cThe job shop scheduling problem,\u201d Technical report, L.I.D.S., May 1999."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-005-2181-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-005-2181-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-005-2181-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T11:36:28Z","timestamp":1559302588000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-005-2181-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,6]]},"references-count":18,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2005,6]]}},"alternative-id":["2181"],"URL":"https:\/\/doi.org\/10.1007\/s10589-005-2181-1","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,6]]}}}