{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,11]],"date-time":"2026-07-11T06:01:44Z","timestamp":1783749704719,"version":"3.55.0"},"reference-count":25,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2014,3,1]],"date-time":"2014-03-01T00:00:00Z","timestamp":1393632000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Comput. Intell. AI Games"],"published-print":{"date-parts":[[2014,3]]},"DOI":"10.1109\/tciaig.2013.2263884","type":"journal-article","created":{"date-parts":[[2013,5,17]],"date-time":"2013-05-17T18:02:22Z","timestamp":1368813742000},"page":"31-45","source":"Crossref","is-referenced-by-count":40,"title":["Solving the Physical Traveling Salesman Problem: Tree Search and Macro Actions"],"prefix":"10.1109","volume":"6","author":[{"given":"Diego","family":"Perez","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Edward J.","family":"Powley","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Daniel","family":"Whitehouse","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Philipp","family":"Rohlfshagen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Spyridon","family":"Samothrakis","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Peter I.","family":"Cowling","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Simon M.","family":"Lucas","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-29178-4_26"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/CIG.2012.6374161"},{"key":"ref12","author":"mcgovern","year":"1998","journal-title":"?Macro-actions in reinforcement learning An empirical analysis ?"},{"key":"ref13","author":"onta\ufffd\ufffdn","year":"2012","journal-title":"?Experiments with game tree search in real-time strategy games ?"},{"key":"ref14","first-page":"40","article-title":"UCT for tactical assault planning in real-time strategy games","author":"balla","year":"2009","journal-title":"Proc 21st Int Joint Conf Artif Intell"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/CIG.2008.5035667"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31866-5_2"},{"key":"ref17","first-page":"17","article-title":"Determinization in Monte-Carlo tree search for the card game Dou Di Zhu","author":"powley","year":"2011","journal-title":"Proc Artif Intell Simul Behav"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2012.6256440"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1023\/A:1013689704352"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TCIAIG.2009.2018703"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/11871842_29"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2010.5593331"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TCIAIG.2012.2186810"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/CIG.2011.6031987"},{"key":"ref7","first-page":"126","article-title":"Monte-Carlo tree search for the simultaneous move game Tron","author":"den teuling","year":"2012","journal-title":"Proc Comput Games Workshop at ECAI"},{"key":"ref2","first-page":"72","article-title":"Efficient selectivity and backup operators in Monte-Carlo tree search","author":"coulom","year":"2006","journal-title":"Proc 5th Int Conf Comput Games"},{"key":"ref9","first-page":"18","article-title":"Playing Tetris using bandit-based Monte-Carlo planning","author":"zhongjie","year":"2011","journal-title":"Proc AISB Symp AI Games"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/CIG.2012.6374159"},{"key":"ref20","author":"kocsis","year":"2006","journal-title":"?Improved Monte-Carlo search ?"},{"key":"ref22","first-page":"91","article-title":"Experiments on traveling salesman heuristics","author":"bentley","year":"1990","journal-title":"Proc 1st Annu ACM-SIAM Symp Discrete Algorithms"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/965139.807380"},{"key":"ref24","author":"johnson","year":"1997","journal-title":"The Traveling Salesman Problem A Case Study in Local Optimization"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1965.tb04146.x"},{"key":"ref25","first-page":"288","author":"snook","year":"2000","journal-title":"Game Programming Gems"}],"container-title":["IEEE Transactions on Computational Intelligence and AI in Games"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/4804728\/6766678\/06517274.pdf?arnumber=6517274","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:31:42Z","timestamp":1642005102000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/6517274\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,3]]},"references-count":25,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tciaig.2013.2263884","relation":{},"ISSN":["1943-068X","1943-0698"],"issn-type":[{"value":"1943-068X","type":"print"},{"value":"1943-0698","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,3]]}}}