{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:11:24Z","timestamp":1767337884752,"version":"3.40.3"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031445040"},{"type":"electronic","value":"9783031445057"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-44505-7_14","type":"book-chapter","created":{"date-parts":[[2023,10,24]],"date-time":"2023-10-24T18:03:41Z","timestamp":1698170621000},"page":"194-207","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Learning the\u00a0Bias Weights for\u00a0Generalized Nested Rollout Policy Adaptation"],"prefix":"10.1007","author":[{"given":"Julien","family":"Sentuc","sequence":"first","affiliation":[]},{"given":"Farah","family":"Ellouze","sequence":"additional","affiliation":[]},{"given":"Jean-Yves","family":"Lucas","sequence":"additional","affiliation":[]},{"given":"Tristan","family":"Cazenave","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,10,25]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Abdo, A., Edelkamp, S., Lawo, M.: Nested rollout policy adaptation for optimizing vehicle selection in complex VRPs, pp. 213\u2013221 (2016)","key":"14_CR1","DOI":"10.1109\/LCN.2016.050"},{"issue":"1","key":"14_CR2","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/S0004-3702(01)00127-8","volume":"132","author":"B Bouzy","year":"2001","unstructured":"Bouzy, B., Cazenave, T.: Computer go: an AI oriented survey. Artif. Intell. 132(1), 39\u2013103 (2001)","journal-title":"Artif. Intell."},{"issue":"1","key":"14_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TCIAIG.2012.2186810","volume":"4","author":"C Browne","year":"2012","unstructured":"Browne, C., et al.: A survey of Monte Carlo tree search methods. IEEE Trans. Comput. Intell. AI Games 4(1), 1\u201343 (2012)","journal-title":"IEEE Trans. Comput. Intell. AI Games"},{"unstructured":"Br\u00fcgmann, B.: Monte Carlo Go. Max-Planke-Inst. Phys., Munich, Technical report (1993)","key":"14_CR4"},{"doi-asserted-by":"crossref","unstructured":"Cazenave, T.: Nested Monte-Carlo search. In: Boutilier, C. (ed.) IJCAI, pp. 456\u2013461 (2009)","key":"14_CR5","DOI":"10.1109\/IPDPS.2009.5161122"},{"doi-asserted-by":"crossref","unstructured":"Cazenave, T.: Generalized nested rollout policy adaptation. In: Monte Carlo Search at IJCAI (2020)","key":"14_CR6","DOI":"10.1007\/978-3-030-89453-5"},{"doi-asserted-by":"crossref","unstructured":"Cazenave, T., Fournier, T.: Monte Carlo inverse folding. In: Monte Carlo Search at IJCAI (2020)","key":"14_CR7","DOI":"10.1007\/978-3-030-89453-5"},{"unstructured":"Cazenave, T., Lucas, J.Y., Kim, H., Triboulet, T.: Monte Carlo vehicle routing. In: ATT at ECAI (2020)","key":"14_CR8"},{"key":"14_CR9","doi-asserted-by":"publisher","first-page":"21","DOI":"10.3233\/AIC-201577","volume":"34","author":"T Cazenave","year":"2021","unstructured":"Cazenave, T., Lucas, J.Y., Triboulet, T., Kim, H.: Policy adaptation for vehicle routing. AI Commun. 34, 21\u201335 (2021)","journal-title":"AI Commun."},{"key":"14_CR10","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, pp. 42\u201354. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-34413-8_4"},{"unstructured":"Cornu, M.L: Local search, data structures and Monte Carlo search for multi-objective combinatorial optimization problems. (recherche locale, structures de donn\u00e9es et recherche Monte-carlo pour les probl\u00e8mes d\u2019optimisation combinatoire multi-objectif) (2017)","key":"14_CR11"},{"key":"14_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/978-3-540-75538-8_7","volume-title":"Computers and Games","author":"R Coulom","year":"2007","unstructured":"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\u201383. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-75538-8_7"},{"key":"14_CR13","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1007\/978-3-030-86514-6_30","volume-title":"Machine Learning and Knowledge Discovery in Databases. Applied Data Science Track","author":"C Dang","year":"2021","unstructured":"Dang, C., Bazgan, C., Cazenave, T., Chopin, M., Wuillemin, P.-H.: Monte Carlo search algorithms for\u00a0network traffic engineering. In: Dong, Y., Kourtellis, N., Hammer, B., Lozano, J.A. (eds.) ECML PKDD 2021. LNCS (LNAI), vol. 12978, pp. 486\u2013501. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-86514-6_30"},{"issue":"1","key":"14_CR14","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1287\/mnsc.6.1.80","volume":"6","author":"GB Dantzig","year":"1959","unstructured":"Dantzig, G.B., Ramser, J.H.: The truck dispatching problem. Manage. Sci. 6(1), 80\u201391 (1959)","journal-title":"Manage. Sci."},{"doi-asserted-by":"crossref","unstructured":"Edelkamp, S., Gath, M., Cazenave, T., Teytaud, F.: Algorithm and knowledge engineering for the TSPTW problem. In: Computational Intelligence in Scheduling (SCIS), 2013 IEEE Symposium on, pp. 44\u201351. IEEE (2013)","key":"14_CR15","DOI":"10.1109\/SCIS.2013.6613251"},{"key":"14_CR16","series-title":"Lecture Notes in Logistics","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/978-3-319-21266-1_28","volume-title":"Commercial Transport","author":"S Edelkamp","year":"2016","unstructured":"Edelkamp, S., Gath, M., Greulich, C., Humann, M., Herzog, O., Lawo, M.: Monte-Carlo tree search for logistics. In: Clausen, U., Friedrich, H., Thaller, C., Geiger, C. (eds.) Commercial Transport. LNL, pp. 427\u2013440. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-21266-1_28"},{"key":"14_CR17","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/978-3-319-11206-0_28","volume-title":"KI 2014: Advances in Artificial Intelligence","author":"S Edelkamp","year":"2014","unstructured":"Edelkamp, S., Gath, M., Rohde, M.: Monte-Carlo tree search for 3D packing with object orientation. In: Lutz, C., Thielscher, M. (eds.) KI 2014. LNCS (LNAI), vol. 8736, pp. 285\u2013296. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-11206-0_28"},{"key":"14_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-319-27992-3_1","volume-title":"Advances in Computer Games","author":"T Graf","year":"2015","unstructured":"Graf, T., Platzner, M.: Adaptive playouts in Monte-Carlo tree search with policy-gradient reinforcement learning. In: Plaat, A., van den Herik, J., Kosters, W. (eds.) ACG 2015. LNCS, vol. 9525, pp. 1\u201311. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-27992-3_1"},{"unstructured":"Hu, H., Zhang, X., Yan, X., Wang, L., Xu, Y.: Solving a new 3D bin packing problem with deep reinforcement learning method. arXiv:1708.05930 (2017)","key":"14_CR19"},{"key":"14_CR20","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1007\/11871842_29","volume-title":"Machine Learning: ECML 2006","author":"L Kocsis","year":"2006","unstructured":"Kocsis, L., Szepesv\u00e1ri, C.: Bandit based Monte-Carlo planning. In: F\u00fcrnkranz, J., Scheffer, T., Spiliopoulou, M. (eds.) ECML 2006. LNCS (LNAI), vol. 4212, pp. 282\u2013293. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11871842_29"},{"doi-asserted-by":"publisher","unstructured":"Maniezzo, V., Gambardella, L.M., de Luigi, F.: Ant colony optimization. In: New Optimization Techniques in Engineering. Studies in Fuzziness and Soft Computing, vol. 141, pp. 101\u2013121. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-39930-8_5","key":"14_CR21","DOI":"10.1007\/978-3-540-39930-8_5"},{"issue":"4","key":"14_CR22","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1109\/TCIAIG.2010.2088123","volume":"2","author":"J M\u00e9hat","year":"2010","unstructured":"M\u00e9hat, J., Cazenave, T.: Combining UCT and nested Monte Carlo Search for single-player general game playing. IEEE Trans. Comput. Intell. AI Games 2(4), 271\u2013277 (2010)","journal-title":"IEEE Trans. Comput. Intell. AI Games"},{"doi-asserted-by":"crossref","unstructured":"Portela, F.: An unexpectedly effective Monte Carlo technique for the RNA inverse folding problem. BioRxiv, p. 345587 (2018)","key":"14_CR23","DOI":"10.1101\/345587"},{"doi-asserted-by":"crossref","unstructured":"Qi, C., Sun, Y.: An improved ant colony algorithm for VRPTW. In: 2008 International Conference on Computer Science and Software Engineering, vol. 1, pp. 455\u2013458. IEEE (2008)","key":"14_CR24","DOI":"10.1109\/CSSE.2008.1339"},{"doi-asserted-by":"crossref","unstructured":"Rizzoli, A.E., Montemanni, R., Lucibello, E., Gambardella, L.M.. Ant colony optimization for real-world vehicle routing problems. Swarm Intell. 1(2), 135\u2013151 (2007)","key":"14_CR25","DOI":"10.1007\/s11721-007-0005-x"},{"unstructured":"Rosin, C.D.: Nested rollout policy adaptation for Monte Carlo Tree Search. In: IJCAI 2011, Proceedings of the 22nd International Joint Conference on Artificial Intelligence, pp. 649\u2013654 (2011)","key":"14_CR26"},{"doi-asserted-by":"crossref","unstructured":"Sentuc, J., Cazenave, T., Lucas, J.Y.: Generalized nested rollout policy adaptation with dynamic bias for vehicle routing. In: AI for Transportation at AAAI (2022)","key":"14_CR27","DOI":"10.1007\/978-3-031-44505-7_14"},{"unstructured":"Solomon, M.M.: Algorithms for the vehicle routing and scheduling problems with time window constraints. In: Operations Research (1985)","key":"14_CR28"},{"doi-asserted-by":"crossref","unstructured":"Wang, F., Hauser, K.: Stable bin packing of non-convex 3D objects with a robot manipulator. arXiv:1812.04093v1 (2018)","key":"14_CR29","DOI":"10.1109\/ICRA.2019.8794049"},{"unstructured":"Zhao, H., Yu, Y., Xu, K.: Learning efficient online 3D bin packing on packing configuration trees. In: International Conference on Learning Representations (2022)","key":"14_CR30"},{"doi-asserted-by":"crossref","unstructured":"Zhen, T., Zhang, Q., Zhang, W., Ma, Z.: Hybrid ant colony algorithm for the vehicle routing with time windows. In: 2008 ISECS International Colloquium on Computing, Communication, Control, and Management, vol. 1, pp. 8\u201312. IEEE (2008)","key":"14_CR31","DOI":"10.1109\/CCCM.2008.85"}],"container-title":["Lecture Notes in Computer Science","Learning and Intelligent Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-44505-7_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,24]],"date-time":"2023-12-24T17:44:35Z","timestamp":1703439875000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-44505-7_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031445040","9783031445057"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-44505-7_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"25 October 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LION","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Learning and Intelligent Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Nice","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 June 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 June 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lion2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/lion17.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"83","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"40","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"48% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4.7","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4.4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}