{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T17:23:53Z","timestamp":1742923433367,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031080104"},{"type":"electronic","value":"9783031080111"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-08011-1_24","type":"book-chapter","created":{"date-parts":[[2022,6,9]],"date-time":"2022-06-09T16:16:42Z","timestamp":1654791402000},"page":"358-373","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Hybrid Offline\/Online Optimization for\u00a0Energy Management via\u00a0Reinforcement Learning"],"prefix":"10.1007","author":[{"given":"Mattia","family":"Silvestri","sequence":"first","affiliation":[]},{"given":"Allegra","family":"De Filippo","sequence":"additional","affiliation":[]},{"given":"Federico","family":"Ruggeri","sequence":"additional","affiliation":[]},{"given":"Michele","family":"Lombardi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,6,10]]},"reference":[{"key":"24_CR1","doi-asserted-by":"crossref","unstructured":"Aloini, D., Crisostomi, E., Raugi, M., Rizzo, R.: Optimal power scheduling in a virtual power plant. In: 2011 2nd IEEE PES International Conference and Exhibition on Innovative Smart Grid Technologies, pp. 1\u20137 (2011)","DOI":"10.1109\/ISGTEurope.2011.6162768"},{"key":"24_CR2","unstructured":"Bello, I., Pham, H., Le, Q.V., Norouzi, M., Bengio, S.: Neural combinatorial optimization with reinforcement learning. arXiv preprint arXiv:1611.09940 (2016)"},{"key":"24_CR3","doi-asserted-by":"crossref","unstructured":"Cappart, Q., Moisan, T., Rousseau, L.M., Pr\u00e9mont-Schwarz, I., Cire, A.: Combining reinforcement learning and constraint programming for combinatorial optimization. arXiv preprint arXiv:2006.01610 (2020)","DOI":"10.1609\/aaai.v35i5.16484"},{"key":"24_CR4","unstructured":"Chen, X., Tian, Y.: Learning to perform local rewriting for combinatorial optimization (2019)"},{"key":"24_CR5","unstructured":"Garage contributors, T.: Garage: a toolkit for reproducible reinforcement learning research (2019). https:\/\/github.com\/rlworkgroup\/garage"},{"key":"24_CR6","unstructured":"Dai, H., Khalil, E.B., Zhang, Y., Dilkina, B., Song, L.: Learning combinatorial optimization algorithms over graphs. arXiv preprint arXiv:1704.01665 (2017)"},{"key":"24_CR7","doi-asserted-by":"crossref","unstructured":"De Filippo, A., Lombardi, M., Milano, M.: Methods for off-line\/on-line optimization under uncertainty. In: IJCAI, pp. 1270\u20131276 (2018)","DOI":"10.24963\/ijcai.2018\/177"},{"key":"24_CR8","doi-asserted-by":"crossref","unstructured":"De Filippo, A., Lombardi, M., Milano, M.: The blind men and the elephant: integrated offline\/online optimization under uncertainty. In: IJCAI (2020)","DOI":"10.24963\/ijcai.2020\/674"},{"key":"24_CR9","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1613\/jair.1.12333","volume":"70","author":"A De Filippo","year":"2021","unstructured":"De Filippo, A., Lombardi, M., Milano, M.: Integrated offline and online decision making under uncertainty. J. Artif. Intell. Res. 70, 77\u2013117 (2021)","journal-title":"J. Artif. Intell. Res."},{"key":"24_CR10","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1287\/mnsc.2020.3922","volume":"68","author":"AN Elmachtoub","year":"2021","unstructured":"Elmachtoub, A.N., Grigas, P.: Smart \u201cpredict, then optimize\u2019\u2019. Manag. Sci. 68, 9\u201326 (2021)","journal-title":"Manag. Sci."},{"key":"24_CR11","unstructured":"Espinosa, A., Ochoa, L.: Dissemination document \u201clow voltage networks models and low carbon technology profiles.\u201d University of Manchester, Technical report (2015)"},{"key":"24_CR12","unstructured":"Kool, W., Van Hoof, H., Welling, M.: Attention, learn to solve routing problems! arXiv preprint arXiv:1803.08475 (2018)"},{"issue":"2","key":"24_CR13","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/s11750-017-0451-6","volume":"25","author":"A Lodi","year":"2017","unstructured":"Lodi, A., Zarpellon, G.: On learning and branching: a survey. TOP 25(2), 207\u2013236 (2017). https:\/\/doi.org\/10.1007\/s11750-017-0451-6","journal-title":"TOP"},{"key":"24_CR14","doi-asserted-by":"crossref","unstructured":"Mazyavkina, N., Sviridov, S., Ivanov, S., Burnaev, E.: Reinforcement learning for combinatorial optimization: a survey. Comput. Oper. Res. 134, 105400 (2021)","DOI":"10.1016\/j.cor.2021.105400"},{"issue":"7540","key":"24_CR15","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":"24_CR16","unstructured":"Nazari, M., Oroojlooy, A., Snyder, L.V., Tak\u00e1\u010d, M.: Reinforcement learning for solving the vehicle routing problem. arXiv preprint arXiv:1802.04240 (2018)"},{"key":"24_CR17","volume-title":"Markov Decision Processes: Discrete Stochastic Dynamic Programming","author":"ML Puterman","year":"2014","unstructured":"Puterman, M.L.: Markov Decision Processes: Discrete Stochastic Dynamic Programming. John Wiley & Sons, Hoboken (2014)"},{"key":"24_CR18","unstructured":"Vaswani, A., et al.: Attention is all you need. In: Advances in Neural Information Processing Systems, pp. 5998\u20136008 (2017)"},{"key":"24_CR19","unstructured":"Vinyals, O., Fortunato, M., Jaitly, N.: Pointer networks. arXiv preprint arXiv:1506.03134 (2015)"},{"issue":"3","key":"24_CR20","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/BF00992696","volume":"8","author":"RJ Williams","year":"1992","unstructured":"Williams, R.J.: Simple statistical gradient-following algorithms for connectionist reinforcement learning. Mach. Learn. 8(3), 229\u2013256 (1992)","journal-title":"Mach. Learn."}],"container-title":["Lecture Notes in Computer Science","Integration of Constraint Programming, Artificial Intelligence, and Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-08011-1_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,8]],"date-time":"2022-11-08T13:05:46Z","timestamp":1667912746000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-08011-1_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031080104","9783031080111"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-08011-1_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"10 June 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CPAIOR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Los Angeles, CA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 June 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 June 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cpaior2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sites.google.com\/usc.edu\/cpaior-2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-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":"60","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":"28","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":"47% - 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":"3","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","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)"}}]}}