{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T00:53:41Z","timestamp":1725670421962},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642291777"},{"type":"electronic","value":"9783642291784"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29178-4_26","type":"book-chapter","created":{"date-parts":[[2012,3,24]],"date-time":"2012-03-24T12:39:35Z","timestamp":1332592775000},"page":"255-264","source":"Crossref","is-referenced-by-count":17,"title":["Monte-Carlo Tree Search for the Physical Travelling Salesman Problem"],"prefix":"10.1007","author":[{"given":"Diego","family":"Perez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philipp","family":"Rohlfshagen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Simon M.","family":"Lucas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"26_CR1","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1109\/TCIAIG.2009.2018702","volume":"1","author":"Y. Bj\u00f6rnsson","year":"2009","unstructured":"Bj\u00f6rnsson, Y., Finnsson, H.: CadiaPlayer: A Simulation-Based General Game Player. IEEE Trans. on Computational Intelligence and AI in Games\u00a01(1), 4\u201315 (2009)","journal-title":"IEEE Trans. on Computational Intelligence and AI in Games"},{"key":"26_CR2","doi-asserted-by":"crossref","unstructured":"Bnaya, Z., Felner, A., Shimony, S.E., Fried, D., Maksin, O.: Repeated-task Canadian traveler problem. In: Proceedings of the International Symposium on Combinatorial Search, pp. 24\u201330 (2011)","DOI":"10.1609\/socs.v2i1.18197"},{"key":"26_CR3","doi-asserted-by":"crossref","unstructured":"Chaslot, G.M.J.-B., Bakkes, S., Szita, I., Spronck, P.: Monte-Carlo Tree Search: A New Framework for Game AI. In: Proc. of the Artificial Intelligence for Interactive Digital Entertainment Conference, pp. 216\u2013217 (2006)","DOI":"10.1609\/aiide.v4i1.18700"},{"key":"26_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/978-3-540-75538-8_7","volume-title":"Computers and Games","author":"R. Coulom","year":"2007","unstructured":"Coulom, R.: Efficient Selectivity and Backup Operators in Monte-Carlo Tree Search. In: van den Herik, H.J., Ciancarini, P., Donkers, H.H.L.M(J.) (eds.) CG 2006. LNCS, vol.\u00a04630, pp. 72\u201383. Springer, Heidelberg (2007)"},{"key":"26_CR5","unstructured":"Den Teuling, N.G.P.: Monte-Carlo Tree Search for the Simultaneous Move Game Tron. Univ. Maastricht, Tech. Rep. (2011)"},{"issue":"11","key":"26_CR6","doi-asserted-by":"publisher","first-page":"1856","DOI":"10.1016\/j.artint.2011.03.007","volume":"175","author":"S. Gelly","year":"2011","unstructured":"Gelly, S., Silver, D.: Monte-Carlo tree search and rapid action value estimation in computer Go. Artificial Intelligence\u00a0175(11), 1856\u20131875 (2011)","journal-title":"Artificial Intelligence"},{"key":"26_CR7","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1007\/11871842_29","volume-title":"Machine Learning: ECML 2006","author":"L. Kocsis","year":"2006","unstructured":"Kocsis, L., Szepesv\u00e1ri, C.: Bandit Based Monte-Carlo Planning. In: F\u00fcrnkranz, J., Scheffer, T., Spiliopoulou, M. (eds.) ECML 2006. LNCS (LNAI), vol.\u00a04212, pp. 282\u2013293. Springer, Heidelberg (2006)"},{"key":"26_CR8","unstructured":"Matsumoto, S., Hirosue, N., Itonaga, K., Yokoo, K., Futahashi, H.: Evaluation of Simulation Strategy on Single-Player Monte-Carlo Tree Search and its Discussion for a Practical Scheduling Problem. In: Proc. of the International Multi Conference of Engineers and Computer Scientists, vol.\u00a03, pp. 2086\u20132091 (2010)"},{"key":"26_CR9","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":"26_CR10","doi-asserted-by":"crossref","unstructured":"Robles, D., Lucas, S.M.: A Simple Tree Search Method for Playing Ms. Pac-Man. In: Proc. of the IEEE Conference on Computational Intelligence and Games, pp. 249\u2013255 (2009)","DOI":"10.1109\/CIG.2009.5286469"},{"key":"26_CR11","doi-asserted-by":"crossref","unstructured":"Samothrakis, S., Robles, D., Lucas, S.M.: A UCT Agent for Tron: Initial Investigations. In: Proc. of IEEE Conference on Computational Intelligence and Games, pp. 365\u2013371 (2010)","DOI":"10.1109\/ITW.2010.5593331"},{"issue":"2","key":"26_CR12","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1109\/TCIAIG.2011.2144597","volume":"3","author":"S. Samothrakis","year":"2011","unstructured":"Samothrakis, S., Robles, D., Lucas, S.M.: Fast Approximate Max-n Monte-Carlo Tree Search for Ms Pac-Man. IEEE Trans. on Computational Intelligence and AI in Games\u00a03(2), 142\u2013154 (2011)","journal-title":"IEEE Trans. on Computational Intelligence and AI in Games"},{"key":"26_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-87608-3_1","volume-title":"Computers and Games","author":"M.P.D. Schadd","year":"2008","unstructured":"Schadd, M.P.D., Winands, M.H.M., van den Herik, H.J., Chaslot, G.M.J.-B., Uiterwijk, J.W.H.M.: Single-Player Monte-Carlo Tree Search. In: van den Herik, H.J., Xu, X., Ma, Z., Winands, M.H.M. (eds.) CG 2008. LNCS, vol.\u00a05131, pp. 1\u201312. Springer, Heidelberg (2008)"}],"container-title":["Lecture Notes in Computer Science","Applications of Evolutionary Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29178-4_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,21]],"date-time":"2023-06-21T12:10:10Z","timestamp":1687349410000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-29178-4_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642291777","9783642291784"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29178-4_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}