{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T06:32:52Z","timestamp":1742970772046,"version":"3.40.3"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030033972"},{"type":"electronic","value":"9783030033989"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-03398-9_33","type":"book-chapter","created":{"date-parts":[[2018,11,1]],"date-time":"2018-11-01T13:12:41Z","timestamp":1541077961000},"page":"384-396","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Quasi-Monte-Carlo Tree Search for 3D Bin Packing"],"prefix":"10.1007","author":[{"given":"Hailiang","family":"Li","sequence":"first","affiliation":[]},{"given":"Yan","family":"Wang","sequence":"additional","affiliation":[]},{"given":"DanPeng","family":"Ma","sequence":"additional","affiliation":[]},{"given":"Yang","family":"Fang","sequence":"additional","affiliation":[]},{"given":"Zhibin","family":"Lei","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,11,2]]},"reference":[{"issue":"11","key":"33_CR1","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. Artif. Intell. 175(11), 1856\u20131875 (2011)","journal-title":"Artif. Intell."},{"key":"33_CR2","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1007\/978-1-4419-7997-1_35","volume-title":"Handbook of Combinatorial Optimization","author":"EG Coffman Jr","year":"2013","unstructured":"Coffman Jr., E.G., Csirik, J., Galambos, G., Martello, S., Vigo, D.: Bin packing approximation algorithms: survey and classification. In: Pardalos, P., Du, D.Z., Graham, R. (eds.) Handbook of Combinatorial Optimization, pp. 455\u2013531. Springer, New York (2013). https:\/\/doi.org\/10.1007\/978-1-4419-7997-1_35"},{"key":"33_CR3","doi-asserted-by":"publisher","first-page":"2.3:1","DOI":"10.1145\/1227161.1227165","volume":"12","author":"MA Bender","year":"2008","unstructured":"Bender, M.A., Bradley, B., Jagannathan, G., Pillaipakkamnatt, K.: Sum-of-squares heuristics for bin packing and memory allocation. J. Exp. Algorithmics 12, 2.3:1\u20132.3:19 (2008)","journal-title":"J. Exp. Algorithmics"},{"key":"33_CR4","doi-asserted-by":"crossref","unstructured":"Bansal, N., Elias, M., Khan, A.: Improved approximation for vector bin packing. In: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Philadelphia, PA, USA, pp. 1561\u20131579. Society for Industrial and Applied Mathematics (2016)","DOI":"10.1137\/1.9781611974331.ch106"},{"key":"33_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-71844-4","volume-title":"Combinatorial Optimization: Theory and Algorithms","author":"B Korte","year":"2007","unstructured":"Korte, B., Vygen, J.: Combinatorial Optimization: Theory and Algorithms, 4th edn. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-71844-4","edition":"4"},{"key":"33_CR6","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1111\/1475-3995.00369","volume":"9","author":"H Gehring","year":"2002","unstructured":"Gehring, H., Bortfeldt, A.: A parallel genetic algorithm for solving the container loading problem. Int. Trans. Oper. Res. 9, 497\u2013511 (2002)","journal-title":"Int. Trans. Oper. Res."},{"issue":"5\/6","key":"33_CR7","first-page":"263","volume":"27","author":"G Scheithauer","year":"1991","unstructured":"Scheithauer, G.: A three dimensional bin packing algorithm. Elektronische Informationsverarbeitung und Kybernetik 27(5\/6), 263\u2013271 (1991)","journal-title":"Elektronische Informationsverarbeitung und Kybernetik"},{"issue":"7540","key":"33_CR8","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1038\/nature14236","volume":"518","author":"V Mnih","year":"2015","unstructured":"Mnih, V., et al.: Human-level control through deep reinforcement learning. Nature 518(7540), 529\u2013533 (2015)","journal-title":"Nature"},{"key":"33_CR9","doi-asserted-by":"crossref","unstructured":"Tamar, A., Wu, Y., Thomas, G., Levine, S., Abbeel, P.: Value iteration networks. In: Advances in Neural Information Processing Systems, pp. 2154\u20132162 (2016)","DOI":"10.24963\/ijcai.2017\/700"},{"issue":"7587","key":"33_CR10","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1038\/nature16961","volume":"529","author":"D Silver","year":"2016","unstructured":"Silver, D., et al.: Mastering the game of Go with deep neural networks and tree search. Nature 529(7587), 484\u2013489 (2016)","journal-title":"Nature"},{"key":"33_CR11","doi-asserted-by":"crossref","unstructured":"Lim, A., Zhang, X.: The container loading problem. In: Proceedings of the 2005 ACM Symposium on Applied Computing. ACM (2005)","DOI":"10.1145\/1066677.1066888"},{"issue":"11","key":"33_CR12","first-page":"2147","volume":"32","author":"DF Zhang","year":"2009","unstructured":"Zhang, D.F., Peng, Y., Zhu, W.X., et al.: A hybrid simulated annealing algorithm for the three-dimensional packing problem. Chin. J. Comput. 32(11), 2147\u20132156 (2009)","journal-title":"Chin. J. Comput."},{"issue":"1","key":"33_CR13","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/s10479-009-0657-6","volume":"175","author":"P Hansen","year":"2010","unstructured":"Hansen, P., Mladenovi\u0107, N., Moreno P\u00e9rez, J.A.: Variable neighborhood search: methods and applications. Ann. Oper. Res. 175(1), 367\u2013407 (2010)","journal-title":"Ann. Oper. Res."},{"issue":"1","key":"33_CR14","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/j.cor.2010.04.015","volume":"38","author":"K He","year":"2011","unstructured":"He, K., Huang, W.: An efficient placement heuristic for three-dimensional rectangular packing. Comput. Oper. Res. 38(1), 227\u2013233 (2011)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"33_CR15","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1287\/ijoc.1090.0338","volume":"22","author":"T Fanslau","year":"2010","unstructured":"Fanslau, T., Bortfeldt, A.: A tree search algorithm for solving the container loading problem. INFORMS J. Comput. 22(2), 222\u2013235 (2010)","journal-title":"INFORMS J. Comput."},{"issue":"10","key":"33_CR16","doi-asserted-by":"publisher","first-page":"2267","DOI":"10.1016\/j.cor.2011.10.019","volume":"39","author":"D Zhang","year":"2012","unstructured":"Zhang, D., Peng, Y., Leung, S.C.H.: A heuristic block-loading algorithm based on multi-layer search for the container loading problem. Comput. Oper. Res. 39(10), 2267\u20132276 (2012)","journal-title":"Comput. Oper. Res."},{"key":"33_CR17","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1287\/opre.1060.0369","volume":"55","author":"SP Fekete","year":"2007","unstructured":"Fekete, S.P., Schepers, J., van der Veen, J.C.: An exact algorithm for higher dimensional orthogonal packing. Oper. Res. 55, 569\u2013587 (2007)","journal-title":"Oper. Res."},{"key":"33_CR18","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1016\/S0377-2217(02)00132-7","volume":"141","author":"D Pisinger","year":"2002","unstructured":"Pisinger, D.: Heuristics for the container loading problem. Eur. J. Oper. Res. 141, 382\u2013392 (2002)","journal-title":"Eur. J. Oper. Res."},{"key":"33_CR19","unstructured":"Hu, H., et al.: Solving a new 3D bin packing problem with deep reinforcement learning method. arXiv preprint arXiv:1708.05930 (2017). IJCAI-2017 Workshop"},{"key":"33_CR20","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1016\/S0377-2217(02)00135-2","volume":"141","author":"L Lins","year":"2002","unstructured":"Lins, L., Lins, S., Morabito, R.: An n-tet graph approach for non-guillotine packings of n-dimensional boxes into an n-container. Eur. J. Oper. Res. 141, 421\u2013439 (2002)","journal-title":"Eur. J. Oper. Res."},{"key":"33_CR21","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1016\/S0360-8352(98)00084-9","volume":"35","author":"CF Chien","year":"1998","unstructured":"Chien, C.F., Wu, W.T.: A recursive computational procedure for container loading. Comput. Ind. Eng. 35, 319\u2013322 (1998)","journal-title":"Comput. Ind. Eng."},{"key":"33_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10732-008-9081-3","volume":"16","author":"F Parre\u00f1o","year":"2010","unstructured":"Parre\u00f1o, F., Alvarez-Valdes, R., Oliveira, J.E., Tamarit, J.M.: Neighborhood structures for the container loading problem: a VNS implementation. J. Heuristics 16, 1\u201322 (2010)","journal-title":"J. Heuristics"},{"key":"33_CR23","doi-asserted-by":"crossref","unstructured":"Gelly, S., Silver, D.: Combining online and offline knowledge in UCT. In: Proceedings of the 24th International Conference on Machine Learning, pp. 273\u2013280. ACM (2007)","DOI":"10.1145\/1273496.1273531"},{"key":"33_CR24","doi-asserted-by":"crossref","unstructured":"Finnsson, H., Bjornsson, Y.: Learning simulation control in general game-playing agents. In: AAAI, vol. 10, pp. 954\u2013959 (2010)","DOI":"10.1609\/aaai.v24i1.7651"},{"key":"33_CR25","unstructured":"Brugmann, B.: Monte Carlo Go. Max Planck Institute of Physics, Munchen, Germany, Technical report (1993)"},{"key":"33_CR26","series-title":"IFIP \u2014 The International Federation for Information Processing","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/978-0-387-35706-5_11","volume-title":"Advances in Computer Games","author":"B Bouzy","year":"2004","unstructured":"Bouzy, B., Helmstetter, B.: Monte-Carlo Go developments. In: Van Den Herik, H.J., Iida, H., Heinz, E.A. (eds.) Advances in Computer Games. ITIFIP, vol. 135, pp. 159\u2013174. Springer, Boston, MA (2004). https:\/\/doi.org\/10.1007\/978-0-387-35706-5_11"},{"key":"33_CR27","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/978-3-642-05224-8_28","volume-title":"Advances in Machine Learning","author":"G Van den Broeck","year":"2009","unstructured":"Van den Broeck, G., Driessens, K., Ramon, J.: Monte-Carlo tree search in poker using expected reward distributions. In: Zhou, Z.-H., Washio, T. (eds.) ACML 2009. LNCS (LNAI), vol. 5828, pp. 367\u2013381. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-05224-8_28"},{"issue":"4","key":"33_CR28","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/0004-3702(75)90019-3","volume":"6","author":"DE Knuth","year":"1975","unstructured":"Knuth, D.E., Moore, R.W.: An analysis of alpha-beta pruning. Artif. Intell. 6(4), 293\u2013326 (1975)","journal-title":"Artif. Intell."}],"container-title":["Lecture Notes in Computer Science","Pattern Recognition and Computer Vision"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-03398-9_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,1]],"date-time":"2023-11-01T01:20:10Z","timestamp":1698801610000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-03398-9_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030033972","9783030033989"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-03398-9_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"2 November 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PRCV","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chinese Conference on Pattern Recognition and Computer Vision  (PRCV)","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Guangzhou","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 November 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 November 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ccprcv2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/prcv.qyhw.net.cn\/?lang=en&meeting_id=255","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}