{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T14:07:26Z","timestamp":1726409246341},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319112053"},{"type":"electronic","value":"9783319112060"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-11206-0_28","type":"book-chapter","created":{"date-parts":[[2014,9,15]],"date-time":"2014-09-15T01:31:55Z","timestamp":1410744715000},"page":"285-296","source":"Crossref","is-referenced-by-count":21,"title":["Monte-Carlo Tree Search for 3D Packing with Object Orientation"],"prefix":"10.1007","author":[{"given":"Stefan","family":"Edelkamp","sequence":"first","affiliation":[]},{"given":"Max","family":"Gath","sequence":"additional","affiliation":[]},{"given":"Moritz","family":"Rohde","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"28_CR1","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/0377-2217(90)90362-F","volume":"44","author":"E.E. Bischoff","year":"1990","unstructured":"Bischoff, E.E., Marriott, M.D.: A comparative evaluation of heuristics for container loading. European Journal of Operational Research\u00a044, 267\u2013276 (1990)","journal-title":"European Journal of Operational Research"},{"key":"28_CR2","doi-asserted-by":"crossref","unstructured":"Bjarnason, R., Fern, A., Tadepalli, P.: Lower bounding Klondike solitaire with Monte-Carlo planning. In: ICAPS (2009)","DOI":"10.1609\/icaps.v19i1.13363"},{"key":"28_CR3","unstructured":"Cazenave, T.: Nested monte-carlo search. In: IJCAI"},{"key":"28_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1007\/978-3-642-34413-8_4","volume-title":"Learning and Intelligent Optimization","author":"T. Cazenave","year":"2012","unstructured":"Cazenave, T., Teytaud, F.: Application of the nested rollout policy adaptation algorithm to the traveling salesman problem with time windows. In: Hamadi, Y., Schoenauer, M. (eds.) LION 2012. LNCS, vol.\u00a07219, pp. 42\u201354. Springer, Heidelberg (2012)"},{"issue":"3","key":"28_CR5","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1287\/ijoc.1070.0250","volume":"20","author":"T.G. Crainic","year":"2008","unstructured":"Crainic, T.G., Perboli, G., Tadei, R.: Extreme point-based heuristics for three-dimensional bin packing. INFORMS Journal on Computing\u00a020(3), 368\u2013384 (2008)","journal-title":"INFORMS Journal on Computing"},{"key":"28_CR6","doi-asserted-by":"crossref","unstructured":"de Berg, M., van Kreveld, M., Overmars, M., Schwarzkopf, O.: Computational Geometry: Algorithms and Applications, 2nd edn. Springer (2000)","DOI":"10.1007\/978-3-662-04245-8"},{"key":"28_CR7","first-page":"1637","volume":"29","author":"W.B. Dowsland","year":"1991","unstructured":"Dowsland, W.B.: Three dimensional packing solution approaches and heuristic development. International Journal of Operational Research\u00a029, 1637\u20131685 (1991)","journal-title":"International Journal of Operational Research"},{"key":"28_CR8","unstructured":"Echelmeyer, W., Kirchheim, A., Lilienthal, A.L., Akbiyik, H., Bonini, M.: Performance indicators for robotics systems in logistics applications. In: IROS Workshop on Metrics and Methodologies for Autonomous Robot Teams in Logistics, MMARTLOG (2011)"},{"key":"28_CR9","doi-asserted-by":"crossref","unstructured":"Edelkamp, S., Gath, M., Cazenave, T., Teytaud, F.: Algorithm and knowledge engineering for the TSPTW problem. In: IEEE Symposium Series on Computational Intelligence, SSCI (2013)","DOI":"10.1109\/SCIS.2013.6613251"},{"key":"28_CR10","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/0305-0548(80)90001-5","volume":"7","author":"J.A. George","year":"1980","unstructured":"George, J.A., Robinson, D.F.: A heuristic for packing boxes into a container. Computer and Operational Research\u00a07, 147\u2013156 (1980)","journal-title":"Computer and Operational Research"},{"issue":"7","key":"28_CR11","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1109\/TC.1984.5009341","volume":"33","author":"R.H. Gueting","year":"1984","unstructured":"Gueting, R.H., Wood, D.: Finding rectangle intersections by divide-and-conquer. IEEE Transactions on Computers\u00a033(7), 671\u2013675 (1984)","journal-title":"IEEE Transactions on Computers"},{"key":"28_CR12","doi-asserted-by":"crossref","unstructured":"Huang, E., Korf, R.E.: Optimal packing of high-precision rectangles. In: The International Symposium on Combinatorial Search, SOCS (2011)","DOI":"10.1609\/aaai.v25i1.7814"},{"key":"28_CR13","doi-asserted-by":"crossref","unstructured":"Huang, E., Korf, R.E.: Optimal rectangle packing on non-square benchmarks. In: AAAI (2010)","DOI":"10.1609\/aaai.v24i1.7538"},{"issue":"5","key":"28_CR14","doi-asserted-by":"publisher","first-page":"757","DOI":"10.1080\/00207548908942585","volume":"27","author":"K. Knott","year":"1989","unstructured":"Knott, K., Han, C.P., Egbelu, P.J.: A heuristic approach to the three-dimensional cargoloading problem. Int. J. Prod. Res.\u00a027(5), 757\u2013774 (1989)","journal-title":"Int. J. Prod. Res."},{"key":"28_CR15","unstructured":"Korf, R.E.: Optimal rectangle packing: Initial results. In: ICAPS, pp. 287\u2013295 (2003)"},{"key":"28_CR16","unstructured":"Korf, R.E.: Optimal rectangle packing: New results. In: ICAPS, pp. 142\u2013149 (2004)"},{"key":"28_CR17","first-page":"342","volume-title":"Proceedings of the 17th International Joint Conference on Artificial Intelligence, IJCAI 2001","author":"A. Lim","year":"2001","unstructured":"Lim, A., Ying, W.: A new method for the three dimensional container packing problem. In: Proceedings of the 17th International Joint Conference on Artificial Intelligence, IJCAI 2001, vol.\u00a01, pp. 342\u2013347. Morgan Kaufmann Publishers Inc., San Francisco (2001)"},{"issue":"44","key":"28_CR18","first-page":"277","volume":"1","author":"K. Menschner","year":"1990","unstructured":"Menschner, K., Gehring, H., Meyer, M.: A computer-based heuristic for packing pooled shipment containers. European Journal of Operational Research\u00a01(44), 277\u2013288 (1990)","journal-title":"European Journal of Operational Research"},{"key":"28_CR19","unstructured":"Moffitt, M.D., Pollack, M.E.: Optimal rectangle packing: A Meta-CSP approach. In: ICAPS, pp. 93\u2013102 (2006)"},{"issue":"1","key":"28_CR20","first-page":"1","volume":"3","author":"M. Rohde","year":"2010","unstructured":"Rohde, M., Echelmeyer, W.: Cooperation possibilities between research and industry: Parcelrobot. Bremer Value Reports f\u00fcr Produktion und Logistik\u00a03(1), 1\u201318 (2010)","journal-title":"Bremer Value Reports f\u00fcr Produktion und Logistik"},{"key":"28_CR21","unstructured":"Rosin, C.D.: Nested rollout policy adaptation for monte carlo tree search. In: IJCAI, pp. 649\u2013654 (2011)"},{"key":"28_CR22","unstructured":"Wang, Y.: 3D container packing. PhD thesis, National University of Singapore (2001)"},{"key":"28_CR23","unstructured":"Zhang, Z., Guo, S., Zhu, W., Oon, W.-C., Lim, A.: Space defragmentation heuristic for 2D and 3D bin packing problems. In: IJCAI, pp. 699\u2013704 (2011)"}],"container-title":["Lecture Notes in Computer Science","KI 2014: Advances in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-11206-0_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,30]],"date-time":"2023-01-30T23:36:04Z","timestamp":1675121764000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-11206-0_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319112053","9783319112060"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-11206-0_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}