{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T19:31:18Z","timestamp":1743017478383,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030535513"},{"type":"electronic","value":"9783030535520"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-53552-0_21","type":"book-chapter","created":{"date-parts":[[2020,7,17]],"date-time":"2020-07-17T16:50:23Z","timestamp":1595004623000},"page":"201-215","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Automated Tuning of a Column Generation Algorithm"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0339-217X","authenticated-orcid":false,"given":"Dario","family":"Bezzi","sequence":"first","affiliation":[]},{"given":"Alberto","family":"Ceselli","sequence":"additional","affiliation":[]},{"given":"Giovanni","family":"Righini","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,7,18]]},"reference":[{"key":"21_CR1","unstructured":"Gleixner, A., et al.: The SCIP optimization suite 6.0, July 2018. Available at Optimization Online and as ZIB-Report 18\u201326. \nhttp:\/\/nbn-resolving.de\/urn:nbn:de:0297-zib-69361\n\n. Accessed 28 Jan 2019"},{"key":"21_CR2","volume-title":"Data Mining: Concepts and Techniques","author":"J Han","year":"2012","unstructured":"Han, J., Kamber, M., Pei, J.: Data Mining: Concepts and Techniques, 3rd edn. Morgan Kaufmann Publishers, Waltam (2012)","edition":"3"},{"key":"21_CR3","unstructured":"Therneau, T., Atkinson, B.: rpart: recursive partitioning and regression trees. R package version 4.1-15 (2019). \nhttps:\/\/CRAN.R-project.org\/package=rpart\n\n. Accessed 22 Jan 2019"},{"key":"21_CR4","unstructured":"Meyer, D., Dimitriadou, E., Hornik, K., Weingessel, A., Leisch, F.: e1071: Misc Functions of the Department of Statistics, Probability Theory Group (Formerly: E1071), TU Wien. R package version 1.7-2. \nhttps:\/\/CRAN.R-project.org\/package=e1071\n\n. Accessed 22 Jan 2019"},{"key":"21_CR5","unstructured":"Chen, T., He, T., Benesty, M.: xgboost: extreme gradient boosting. R package version 0.4-2. \nhttps:\/\/CRAN.R-project.org\/package=xgboost\n\n. Accessed 22 Jan 2019"},{"key":"21_CR6","doi-asserted-by":"publisher","first-page":"1269","DOI":"10.1287\/opre.1110.0975","volume":"59","author":"R Baldacci","year":"2011","unstructured":"Baldacci, R., Mingozzi, A., Roberti, R.: New route relaxation and pricing strategies for the vehicle routing problem. Oper. Res. 59, 1269\u20131283 (2011)","journal-title":"Oper. Res."},{"key":"21_CR7","unstructured":"Bezzi, D.: Algoritmo di ottimizzazione per l\u2019Electric Vehicle Orienteering Problem. Master degree thesis, University of Milan (2017)"},{"key":"21_CR8","unstructured":"Bezzi, D., Ceselli, A., Righini, G.: Dynamic programming for the electric vehicle orienteering problem with multiple technologies. In: Odysseus 2018, Cagliari, Italy (2018)"},{"key":"21_CR9","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/BF01589353","volume":"20","author":"N Christofides","year":"1981","unstructured":"Christofides, N., Mingozzi, A., Toth, P.: Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations. Math. Program. 20, 255\u2013282 (1981). \nhttps:\/\/doi.org\/10.1007\/BF01589353","journal-title":"Math. Program."},{"issue":"6","key":"21_CR10","doi-asserted-by":"publisher","first-page":"1388","DOI":"10.1287\/opre.2016.1535","volume":"64","author":"G Desaulniers","year":"2016","unstructured":"Desaulniers, G., Errico, F., Irnich, S., Schneider, M.: Exact algorithms for electric vehicle-routing problems with time windows. Oper. Res. 64(6), 1388\u20131405 (2016)","journal-title":"Oper. Res."},{"key":"21_CR11","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1002\/net.20033","volume":"44","author":"D Feillet","year":"2004","unstructured":"Feillet, D., Dejax, P., Gendreau, M., Gueguen, C.: An exact algorithm for the elementary shortest path problem with resource constraints: application to some vehicle routing problems. Networks 44, 216\u2013229 (2004)","journal-title":"Networks"},{"key":"21_CR12","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/j.tre.2014.09.003","volume":"71","author":"A Felipe Ortega","year":"2014","unstructured":"Felipe Ortega, A., Ortu\u00f1o S\u00e1nchez, M.T., Righini, G., Tirado Dom\u00ednguez, G.: A heuristic approach for the green vehicle routing problem with multiple technologies and partial recharges. Transp. Res. Part E 71, 111\u2013128 (2014)","journal-title":"Transp. Res. Part E"},{"key":"21_CR13","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/j.cor.2019.02.014","volume":"107","author":"M Keskin","year":"2019","unstructured":"Keskin, M., Laporte, G., \u00c7atay, B.: Electric vehicle routing problem with time-dependent waiting times at recharging stations. Comput. Oper. Res. 107, 77\u201394 (2019)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"21_CR14","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1287\/trsc.2015.0646","volume":"50","author":"S Pelletier","year":"2016","unstructured":"Pelletier, S., Jabali, O., Laporte, G.: Goods distribution with electric vehicles: review and research perspectives. Transp. Sci. 50(1), 3\u201322 (2016)","journal-title":"Transp. Sci."},{"key":"21_CR15","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/j.disopt.2006.05.007","volume":"3","author":"G Righini","year":"2006","unstructured":"Righini, G., Salani, M.: Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints. Discret. Optim. 3, 255\u2013273 (2006)","journal-title":"Discret. Optim."},{"key":"21_CR16","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1002\/net.20212","volume":"51","author":"G Righini","year":"2008","unstructured":"Righini, G., Salani, M.: New dynamic programming algorithms for the resource-constrained elementary shortest path problem. Networks 51, 155\u2013170 (2008)","journal-title":"Networks"},{"key":"21_CR17","doi-asserted-by":"publisher","first-page":"1191","DOI":"10.1016\/j.cor.2008.01.003","volume":"36","author":"G Righini","year":"2009","unstructured":"Righini, G., Salani, M.: Decremental state space relaxation strategies and initialization heuristics for solving the orienteering problem with time windows with dynamic programming. Comput. Oper. Res. 36, 1191\u20131203 (2009)","journal-title":"Comput. Oper. Res."},{"key":"21_CR18","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1287\/trsc.2013.0490","volume":"48","author":"M Schneider","year":"2014","unstructured":"Schneider, M., Stenger, A., Goeke, D.: The electric vehicle-routing problem with time windows and recharging stations. Transp. Sci. 48, 500\u2013520 (2014)","journal-title":"Transp. Sci."},{"key":"21_CR19","unstructured":"Schneider, M.: Personal Communication (2014)"},{"key":"21_CR20","unstructured":"Khalil, E.B.: Machine learning for integer programming. In: Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence (2016)"},{"key":"21_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/978-3-319-59776-8_16","volume-title":"Integration of AI and OR Techniques in Constraint Programming","author":"M Kruber","year":"2017","unstructured":"Kruber, M., L\u00fcbbecke, M.E., Parmentier, A.: Learning when to use a decomposition. In: Salvagnin, D., Lombardi, M. (eds.) CPAIOR 2017. LNCS, vol. 10335, pp. 202\u2013210. Springer, Cham (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-319-59776-8_16"},{"key":"21_CR22","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/s10479-018-3067-9","volume":"284","author":"S Basso","year":"2018","unstructured":"Basso, S., Ceselli, A., Tettamanzi, A.: Random sampling and machine learning to understand good decompositions. Ann. Oper. Res. 284, 501\u2013526 (2018). \nhttps:\/\/doi.org\/10.1007\/s10479-018-3067-9","journal-title":"Ann. Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Learning and Intelligent Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-53552-0_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,17]],"date-time":"2020-07-17T17:00:50Z","timestamp":1595005250000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-53552-0_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030535513","9783030535520"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-53552-0_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"18 July 2020","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":"Athens","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 May 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 May 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lion2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.caopt.com\/LION14\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}