{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:41:05Z","timestamp":1760708465303},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642344121"},{"type":"electronic","value":"9783642344138"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-34413-8_4","type":"book-chapter","created":{"date-parts":[[2012,10,1]],"date-time":"2012-10-01T05:58:57Z","timestamp":1349071137000},"page":"42-54","source":"Crossref","is-referenced-by-count":28,"title":["Application of the Nested Rollout Policy Adaptation Algorithm to the Traveling Salesman Problem with Time Windows"],"prefix":"10.1007","author":[{"given":"Tristan","family":"Cazenave","sequence":"first","affiliation":[]},{"given":"Fabien","family":"Teytaud","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"5","key":"4_CR1","doi-asserted-by":"publisher","first-page":"938","DOI":"10.1287\/opre.31.5.938","volume":"31","author":"E. Baker","year":"1983","unstructured":"Baker, E.: An exact algorithm for the time-constrained traveling salesman problem. Operations Research\u00a031(5), 938\u2013945 (1983)","journal-title":"Operations Research"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Cazenave, T.: Nested Monte-Carlo search. In: IJCAI, pp. 456\u2013461 (2009)","DOI":"10.1109\/IPDPS.2009.5161122"},{"issue":"2","key":"4_CR3","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1002\/net.3230110207","volume":"11","author":"N. Christofides","year":"1981","unstructured":"Christofides, N., Mingozzi, A., Toth, P.: State-space relaxation procedures for the computation of bounds to routing problems. Networks\u00a011(2), 145\u2013164 (1981)","journal-title":"Networks"},{"issue":"4","key":"4_CR4","doi-asserted-by":"crossref","first-page":"221","DOI":"10.3233\/ICG-2009-32404","volume":"32","author":"P. Drake","year":"2009","unstructured":"Drake, P.: The last-good-reply policy for monte-carlo go. ICGA Journal\u00a032(4), 221\u2013227 (2009)","journal-title":"ICGA Journal"},{"issue":"2","key":"4_CR5","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1287\/opre.43.2.367","volume":"43","author":"Y. Dumas","year":"1995","unstructured":"Dumas, Y., Desrosiers, J., Gelinas, E., Solomon, M.: An optimal algorithm for the traveling salesman problem with time windows. Operations Research\u00a043(2), 367\u2013371 (1995)","journal-title":"Operations Research"},{"issue":"4","key":"4_CR6","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1287\/ijoc.14.4.403.2827","volume":"14","author":"F. Focacci","year":"2002","unstructured":"Focacci, F., Lodi, A., Milano, M.: A hybrid exact algorithm for the tsptw. Informs Journal on Computing\u00a014(4), 403\u2013417 (2002)","journal-title":"Informs Journal on Computing"},{"issue":"3","key":"4_CR7","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1287\/opre.46.3.330","volume":"46","author":"M. Gendreau","year":"1998","unstructured":"Gendreau, M., Hertz, A., Laporte, G., Stan, M.: A generalized insertion heuristic for the traveling salesman problem with time windows. Operations Research\u00a046(3), 330\u2013335 (1998)","journal-title":"Operations Research"},{"key":"4_CR8","unstructured":"Johnson, D., Papadimitriou, C.: Computational complexity and the traveling salesman problem. Mass. Inst. of Technology, Laboratory for Computer Science (1981)"},{"issue":"9","key":"4_CR9","doi-asserted-by":"publisher","first-page":"1570","DOI":"10.1016\/j.cor.2009.11.015","volume":"37","author":"M. L\u00f3pez-Ib\u00e1\u00f1ez","year":"2010","unstructured":"L\u00f3pez-Ib\u00e1\u00f1ez, M., Blum, C.: Beam-ACO for the travelling salesman problem with time windows. Computers & OR\u00a037(9), 1570\u20131583 (2010)","journal-title":"Computers & OR"},{"issue":"1","key":"4_CR10","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1287\/trsc.32.1.12","volume":"32","author":"G. Pesant","year":"1998","unstructured":"Pesant, G., Gendreau, M., Potvin, J., Rousseau, J.: An exact constraint logic programming algorithm for the traveling salesman problem with time windows. Transportation Science\u00a032(1), 12\u201329 (1998)","journal-title":"Transportation Science"},{"issue":"2","key":"4_CR11","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1287\/ijoc.8.2.165","volume":"8","author":"J. Potvin","year":"1996","unstructured":"Potvin, J., Bengio, S.: The vehicle routing problem with time windows part II: genetic search. Informs Journal on Computing\u00a08(2), 165 (1996)","journal-title":"Informs Journal on Computing"},{"key":"4_CR12","unstructured":"Rechenberg, I.: Evolutionsstrategie: Optimierung technischer Systeme nach Prinzipien der biologischen Evolution, Fromman-Holzboog, Stuttgart, German (1973)"},{"key":"4_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/978-3-642-20520-0_51","volume-title":"Applications of Evolutionary Computation","author":"A. Rimmel","year":"2011","unstructured":"Rimmel, A., Teytaud, F., Cazenave, T.: Optimization of the Nested Monte-Carlo Algorithm on the Traveling Salesman Problem with Time Windows. In: Di Chio, C., Brabazon, A., Di Caro, G.A., Drechsler, R., Farooq, M., Grahl, J., Greenfield, G., Prins, C., Romero, J., Squillero, G., Tarantino, E., Tettamanzi, A.G.B., Urquhart, N., Uyar, A.\u015e. (eds.) EvoApplications 2011, Part II. LNCS, vol.\u00a06625, pp. 501\u2013510. Springer, Heidelberg (2011)"},{"key":"4_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/978-3-642-17928-0_6","volume-title":"Computers and Games","author":"A. Rimmel","year":"2011","unstructured":"Rimmel, A., Teytaud, F., Teytaud, O.: Biasing Monte-Carlo Simulations through RAVE Values. In: van den Herik, H.J., Iida, H., Plaat, A. (eds.) CG 2010. LNCS, vol.\u00a06515, pp. 59\u201368. Springer, Heidelberg (2011)"},{"key":"4_CR15","unstructured":"Rosin, C.D.: Nested rollout policy adaptation for monte carlo tree search. In: Walsh, T. (ed.) IJCAI, pp. 649\u2013654. IJCAI\/AAAI (2011)"},{"key":"4_CR16","unstructured":"Schwefel, H.: Adaptive Mechanismen in der biologischen Evolution und ihr Einflu\u00df auf die Evolutionsgeschwindigkeit. Interner Bericht der Arbeitsgruppe Bionik und Evolutionstechnik am Institut f\u00fcr Mess-und Regelungstechnik Re\u00a0215(3) (1974)"},{"issue":"2","key":"4_CR17","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1287\/opre.35.2.254","volume":"35","author":"M. Solomon","year":"1987","unstructured":"Solomon, M.: Algorithms for the vehicle routing and scheduling problems with time window constraints. Operations Research\u00a035(2), 254\u2013265 (1987)","journal-title":"Operations Research"}],"container-title":["Lecture Notes in Computer Science","Learning and Intelligent Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-34413-8_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,8]],"date-time":"2019-05-08T02:53:40Z","timestamp":1557284020000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-34413-8_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642344121","9783642344138"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-34413-8_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}