{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T16:17:21Z","timestamp":1729613841954,"version":"3.28.0"},"reference-count":24,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,4]]},"DOI":"10.1109\/scis.2013.6613251","type":"proceedings-article","created":{"date-parts":[[2013,10,2]],"date-time":"2013-10-02T22:33:20Z","timestamp":1380753200000},"page":"44-51","source":"Crossref","is-referenced-by-count":32,"title":["Algorithm and knowledge engineering for the TSPTW problem"],"prefix":"10.1109","author":[{"given":"Stefan","family":"Edelkamp","sequence":"first","affiliation":[]},{"given":"Max","family":"Gath","sequence":"additional","affiliation":[]},{"given":"Tristan","family":"Cazenave","sequence":"additional","affiliation":[]},{"given":"Fabien","family":"Teytaud","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.32.1.12"},{"key":"22","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/978-3-642-17928-0_6","article-title":"Biasing Monte-Carlo simulations through rave values","author":"rimmel","year":"2011","journal-title":"Computers and Games"},{"journal-title":"General game playing Game description language specification","year":"2006","author":"love","key":"17"},{"key":"23","first-page":"649","article-title":"Nested rollout policy adaptation for monte-carlo tree search","author":"rosin","year":"2011","journal-title":"IJCAI"},{"key":"18","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/s11301-008-0036-4","article-title":"A survey on pickup and delivery problems","volume":"58","author":"parragh","year":"2008","journal-title":"Journal fu?r Betriebswirtschaft"},{"key":"24","doi-asserted-by":"publisher","DOI":"10.1287\/opre.35.2.254"},{"key":"15","first-page":"282","article-title":"Bandit based Monte-Carlo planning","author":"kocsis","year":"2006","journal-title":"ICML"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2009.11.015"},{"key":"13","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1287\/opre.46.3.330","article-title":"A generalized insertion heuristic for the traveling salesman problem with time windows","volume":"46","author":"gendreau","year":"1998","journal-title":"Operations Research"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(86)90073-8"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.14.4.403.2827"},{"key":"12","article-title":"Exploration exploitation in Go: UCT for Monte-Carlo Go","author":"gelly","year":"2006","journal-title":"Workshop On-line Trading of Exploration and Exploitation"},{"key":"21","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1007\/978-3-642-20520-0_51","article-title":"Optimization of the nested monte-carlo algorithm on the traveling salesman problem with time windows","author":"rimmel","year":"2011","journal-title":"Applications of Evolutionary Computation"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1287\/opre.31.5.938"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.8.2.165"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1023\/A:1013689704352"},{"key":"1","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-77778-8","author":"golden","year":"2008","journal-title":"The Vehicle Routing Problem Latest Advances and New Challenges"},{"key":"10","first-page":"1134","article-title":"Simulation-based approach to general game playing","author":"finnsson","year":"2008","journal-title":"AAAI"},{"key":"7","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1002\/net.3230110207","article-title":"State-space relaxation procedures for the computation of bounds to routing problems","volume":"11","author":"christofides","year":"1981","journal-title":"Networks"},{"key":"6","first-page":"42","article-title":"Application of the nested rollout policy adaptation algorithm to the traveling salesman problem with time windows","author":"cazenave","year":"2011","journal-title":"LION"},{"key":"5","first-page":"456","article-title":"Nested monte-carlo search","author":"cazenave","year":"2009","journal-title":"IJCAI"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/TCIAIG.2011.2180723"},{"key":"9","article-title":"Optimal decision making in agent-based autonomous groupage traffic","author":"edelkamp","year":"2013","journal-title":"ICAART"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1287\/opre.43.2.367"}],"event":{"name":"2013 IEEE Symposium on Computational Intelligence in Scheduling (CISched)","start":{"date-parts":[[2013,4,16]]},"location":"Singapore, Singapore","end":{"date-parts":[[2013,4,19]]}},"container-title":["2013 IEEE Symposium on Computational Intelligence in Scheduling (CISched)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6596012\/6613243\/06613251.pdf?arnumber=6613251","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,21]],"date-time":"2017-06-21T23:02:29Z","timestamp":1498086149000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6613251\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,4]]},"references-count":24,"URL":"https:\/\/doi.org\/10.1109\/scis.2013.6613251","relation":{},"subject":[],"published":{"date-parts":[[2013,4]]}}}