Monte-Carlo tree search for the physical travelling salesman problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 7248 LNCS, Issue , 2012, Pages 255-264

  Perez, Diego ^a   Rohlfshagen, Philipp ^a   Lucas, Simon M ^a  

^a UNIVERSITY OF ESSEX   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

MONTE CARLO; OPEN PROBLEMS; PROBLEM DOMAIN; REAL-TIME VIDEO GAMES; SHORT TERM; TRAVELLING SALESMAN PROBLEM; TREE SEARCH;

VISUALIZATION;

TRAVELING SALESMAN PROBLEM;

EID: 84859371332     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-29178-4_26     Document Type: Conference Paper

References (13)

1. Björnsson, Y., Finnsson, H.: CadiaPlayer: A Simulation-Based General Game Player. IEEE Trans. on Computational Intelligence and AI in Games 1(1), 4-15 (2009)
2. 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-30 (2011)
3. 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-217 (2006)
4. 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. 4630, pp. 72-83. Springer, Heidelberg (2007)
5. Den Teuling, N.G.P.:Monte-Carlo Tree Search for the Simultaneous Move Game Tron. Univ. Maastricht, Tech. Rep. (2011)
6. Gelly, S., Silver, D.: Monte-Carlo tree search and rapid action value estimation in computer Go. Artificial Intelligence 175(11), 1856-1875 (2011)
7. Kocsis, L., Szepesvári, C.: Bandit Based Monte-Carlo Planning. In: Fürnkranz, J., Scheffer, T., Spiliopoulou, M. (eds.) ECML 2006. LNCS (LNAI), vol. 4212, pp. 282-293. Springer, Heidelberg (2006)
8. 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. 3, pp. 2086-2091 (2010)
9. 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.Ş. (eds.) EvoApplications 2011, Part II. LNCS, vol. 6625, pp. 501-510. Springer, Heidelberg (2011)
10. 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-255 (2009)
11. 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-371 (2010)
12. Samothrakis, S., Robles, D., Lucas, S.M.: Fast Approximate Max-nMonte-Carlo Tree Search forMs Pac-Man. IEEE Trans. on Computational Intelligence and AI in Games 3(2), 142-154 (2011)
13. 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. 5131, pp. 1-12. Springer, Heidelberg (2008)