{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T04:27:45Z","timestamp":1772080065019,"version":"3.50.1"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2021,3,1]],"date-time":"2021-03-01T00:00:00Z","timestamp":1614556800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,3,1]],"date-time":"2021-03-01T00:00:00Z","timestamp":1614556800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100005758","name":"Universit\u00e0 Politecnica delle Marche","doi-asserted-by":"publisher","award":["RSA-B 2018"],"award-info":[{"award-number":["RSA-B 2018"]}],"id":[{"id":"10.13039\/501100005758","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2021,11]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The Green Vehicle Routing Problem with Capacitated Alternative Fuel Stations assumes that, at each station, the number of vehicles simultaneously refueling cannot exceed the number of available pumps. The state-of-the-art solution method, based on the generation of all feasible non-dominated paths, performs well only with up to 2 pumps. In fact, it needs cloning the paths between every pair of pumps. To overcome this issue, in this paper, we propose new path-based MILP models without cloning paths, for both the scenario with private stations (i.e., owned by the fleet manager) and that with public stations. Then, a more efficient cutting plane approach is designed for addressing both the scenarios. Numerical results, obtained considering a set of benchmark instances ad hoc generated for this work, show both the efficiency and the effectiveness of this new cutting plane approach proposed. Finally, a sensitivity analysis, carried out by varying the number of customers to be served and their distribution, shows very good performances of the proposed approach.<\/jats:p>","DOI":"10.1007\/s11590-021-01714-3","type":"journal-article","created":{"date-parts":[[2021,3,1]],"date-time":"2021-03-01T20:02:55Z","timestamp":1614628975000},"page":"2813-2829","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["A more efficient cutting planes approach for the green vehicle routing problem with capacitated alternative fuel stations"],"prefix":"10.1007","volume":"15","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4517-873X","authenticated-orcid":false,"given":"Maurizio","family":"Bruglieri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Simona","family":"Mancini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ornella","family":"Pisacane","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,3,1]]},"reference":[{"issue":"4","key":"1714_CR1","doi-asserted-by":"publisher","first-page":"1288","DOI":"10.1287\/trsc.2016.0734","volume":"51","author":"J Andelmin","year":"2017","unstructured":"Andelmin, J., Bartolini, E.: An exact algorithm for the green vehicle routing problem. Transp. Sci. 51(4), 1288\u20131303 (2017)","journal-title":"Transp. Sci."},{"key":"1714_CR2","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.cor.2019.04.018","volume":"109","author":"J Andelmin","year":"2019","unstructured":"Andelmin, J., Bartolini, E.: A multi-start local search heuristic for the green vehicle routing problem based on a multigraph reformulation. Comput. Oper. Res. 109, 43\u201363 (2019)","journal-title":"Comput. Oper. Res."},{"issue":"9","key":"1714_CR3","first-page":"821","volume":"30","author":"JF Bard","year":"1998","unstructured":"Bard, J.F., Huang, L., Dror, M., Jaillet, P.: A branch and cut algorithm for the VRP with satellite facilities. IIE Trans. 30(9), 821\u2013834 (1998)","journal-title":"IIE Trans."},{"key":"1714_CR4","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/j.endm.2014.11.029","volume":"47","author":"M Bruglieri","year":"2015","unstructured":"Bruglieri, M., Pezzella, F., Pisacane, O., Suraci, S.: A variable neighborhood search branching for the electric vehicle routing problem with time windows. Electron. Notes Discrete Math. 47, 221\u2013228 (2015)","journal-title":"Electron. Notes Discrete Math."},{"key":"1714_CR5","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/j.cor.2018.10.019","volume":"103","author":"M Bruglieri","year":"2019","unstructured":"Bruglieri, M., Mancini, S., Pezzella, F., Pisacane, O.: A path-based solution approach for the green vehicle routing problem. Comput. Oper. Res. 103, 109\u2013122 (2019a)","journal-title":"Comput. Oper. Res."},{"key":"1714_CR6","doi-asserted-by":"publisher","first-page":"104759","DOI":"10.1016\/j.cor.2019.07.017","volume":"112","author":"M Bruglieri","year":"2019","unstructured":"Bruglieri, M., Mancini, S., Pisacane, O.: The green vehicle routing problem with capacitated alternative fuel stations. Comput. Oper. Res. 112, 104759 (2019b)","journal-title":"Comput. Oper. Res."},{"key":"1714_CR7","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/j.trc.2019.05.040","volume":"105","author":"M Bruglieri","year":"2019","unstructured":"Bruglieri, M., Mancini, S., Pisacane, O.: More efficient formulations and valid inequalities for the green vehicle routing problem. Transp. Res. Part C Emerg. Technol. 105, 283\u2013296 (2019c)","journal-title":"Transp. Res. Part C Emerg. Technol."},{"issue":"6","key":"1714_CR8","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."},{"issue":"1","key":"1714_CR9","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1016\/j.tre.2011.08.001","volume":"48","author":"S Erdo\u011fan","year":"2012","unstructured":"Erdo\u011fan, S., Miller-Hooks, E.: A green vehicle routing problem. Transp. Res. Part E Logist. Transp. Rev. 48(1), 100\u2013114 (2012)","journal-title":"Transp. Res. Part E Logist. Transp. Rev."},{"key":"1714_CR10","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/j.tre.2014.09.003","volume":"71","author":"\u00c1 Felipe","year":"2014","unstructured":"Felipe, \u00c1., Ortu\u00f1o, M.T., Righini, G., Tirado, G.: A heuristic approach for the green vehicle routing problem with multiple technologies and partial recharges. Transp. Res. Part E Logist. Transp. Rev. 71, 111\u2013128 (2014)","journal-title":"Transp. Res. Part E Logist. Transp. Rev."},{"issue":"2\u20133","key":"1714_CR11","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1504\/IJPQM.2016.076719","volume":"18","author":"L Grandinetti","year":"2016","unstructured":"Grandinetti, L., Guerriero, F., Pezzella, F., Pisacane, O.: A pick-up and delivery problem with time windows by electric vehicles. Int. J. Product. Qual. Manag. 18(2\u20133), 403\u2013423 (2016)","journal-title":"Int. J. Product. Qual. Manag."},{"issue":"3","key":"1714_CR12","doi-asserted-by":"publisher","first-page":"995","DOI":"10.1016\/j.ejor.2016.01.038","volume":"252","author":"G Hiermann","year":"2016","unstructured":"Hiermann, G., Puchinger, J., Ropke, S., Hartl, R.F.: The electric fleet size and mix vehicle routing problem with time windows and recharging stations. Eur. J. Oper. Res. 252(3), 995\u20131018 (2016)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"1714_CR13","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/j.ejor.2018.06.025","volume":"272","author":"G Hiermann","year":"2018","unstructured":"Hiermann, G., Hartl, R.F., Puchinger, J., Vidal, T.: Routing a mix of conventional, plug-in hybrid, and electric vehicles. Eur. J. Oper. Res. 272(1), 235\u2013248 (2018)","journal-title":"Eur. J. Oper. Res."},{"key":"1714_CR14","unstructured":"IEA: Global ev outlook 2019. IEA, Paris (2019)"},{"key":"1714_CR15","doi-asserted-by":"crossref","unstructured":"Jemai, J., Zekri, M., Mellouli, K.: An NSGA-II algorithm for the green vehicle routing problem. In: European Conference on Evolutionary Computation in Combinatorial Optimization, pp 37\u201348. Springer (2012)","DOI":"10.1007\/978-3-642-29124-1_4"},{"key":"1714_CR16","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."},{"key":"1714_CR17","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1016\/j.asoc.2015.10.064","volume":"39","author":"\u00c7 Ko\u00e7","year":"2016","unstructured":"Ko\u00e7, \u00c7., Karaoglan, I.: The green vehicle routing problem: a heuristic based exact solution approach. Appl. Soft Comput. 39, 154\u2013164 (2016)","journal-title":"Appl. Soft Comput."},{"key":"1714_CR18","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.tre.2017.06.003","volume":"104","author":"V Leggieri","year":"2017","unstructured":"Leggieri, V., Haouari, M.: A practical solution approach for the green vehicle routing problem. Transp. Res. Part E Logist. Transp. Rev. 104, 97\u2013112 (2017)","journal-title":"Transp. Res. Part E Logist. Transp. Rev."},{"issue":"4","key":"1714_CR19","doi-asserted-by":"publisher","first-page":"1151","DOI":"10.1051\/ro\/2017007","volume":"51","author":"S Majidi","year":"2017","unstructured":"Majidi, S., Hosseini-Motlagh, S.M., Yaghoubi, S., Jokar, A.: Fuzzy green vehicle routing problem with simultaneous pickup-delivery and time windows. RAIRO Oper. Res. 51(4), 1151\u20131176 (2017)","journal-title":"RAIRO Oper. Res."},{"key":"1714_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.trc.2017.02.004","volume":"78","author":"S Mancini","year":"2017","unstructured":"Mancini, S.: The hybrid vehicle routing problem. Transp. Res. Part C Emerg. Technol. 78, 1\u201312 (2017)","journal-title":"Transp. Res. Part C Emerg. Technol."},{"key":"1714_CR21","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1016\/S0166-218X(01)00348-1","volume":"123","author":"H Marchand","year":"2002","unstructured":"Marchand, H., Martin, A., Weismantel, R., Wolsey, L.: Cutting planes in integer and mixed integer programming. Discrete Appl. Math. 123, 397\u2013446 (2002)","journal-title":"Discrete Appl. Math."},{"key":"1714_CR22","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/j.trc.2015.09.009","volume":"70","author":"A Montoya","year":"2016","unstructured":"Montoya, A., Gu\u00e9ret, C., Mendoza, J.E., Villegas, J.G.: A multi-space sampling heuristic for the green vehicle routing problem. Transp. Res. Part C Emerg. Technol. 70, 113\u2013128 (2016)","journal-title":"Transp. Res. Part C Emerg. Technol."},{"key":"1714_CR23","first-page":"61","volume":"27","author":"B Sawik","year":"2017","unstructured":"Sawik, B., Faulin, J., P\u00e9rez-Bernabeu, E.: Multi-criteria optimization for fleet size with environmental aspects. Transp. Res. Proc. 27, 61\u201368 (2017a)","journal-title":"Transp. Res. Proc."},{"key":"1714_CR24","first-page":"305","volume":"22","author":"B Sawik","year":"2017","unstructured":"Sawik, B., Faulin, J., P\u00e9rez-Bernabeu, E.: A multicriteria analysis for the green VRP: a case discussion for the distribution problem of a Spanish retailer. Transp. Res. Proc. 22, 305\u2013313 (2017b)","journal-title":"Transp. Res. Proc."},{"issue":"4","key":"1714_CR25","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(4), 500\u2013520 (2014)","journal-title":"Transp. Sci."},{"issue":"2","key":"1714_CR26","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/s00291-014-0376-5","volume":"37","author":"M Schneider","year":"2015","unstructured":"Schneider, M., Stenger, A., Hof, J.: An adaptive VNS algorithm for vehicle routing problems with intermediate stops. OR Spectr. 37(2), 353\u2013387 (2015)","journal-title":"OR Spectr."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-021-01714-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-021-01714-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-021-01714-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,24]],"date-time":"2021-09-24T01:32:29Z","timestamp":1632447149000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-021-01714-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,3,1]]},"references-count":26,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2021,11]]}},"alternative-id":["1714"],"URL":"https:\/\/doi.org\/10.1007\/s11590-021-01714-3","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,3,1]]},"assertion":[{"value":"26 December 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 February 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 March 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}