Routing electric vehicles with a single recharge per route

dc.contributor.authorLöffler, Maximilian
dc.contributor.authorDesaulniers, Guy
dc.contributor.authorIrnich, Stefan
dc.contributor.authorSchneider, Michael
dc.date.accessioned2021-08-03T09:24:19Z
dc.date.available2021-08-03T09:24:19Z
dc.date.issued2020
dc.description.abstractDriven by environmental considerations, regulations on vehicle emissions, and the offer of major subsidies, electric commercial vehicles (ECVs) are receiving ever stronger attention in logistics companies. Route planning for ECV fleets requires consideration of the special characteristics of ECVs, like limited driving range and the potential need to recharge en route at dedicated recharging stations. From a practical viewpoint, the number of recharge operations of each vehicle can very often be restricted to one recharge per route because (i) typical route distances in the most important application areas of ECVs, like small package shipping and food or beverage distribution, do not require more than one recharge given the current driving range of ECVs, and (ii) operations managers are very reluctant to plan vehicle routes with two or more recharges because recharging operations are perceived as unproductive idle times. We develop a simple hybrid of large neighborhood search and granular tabu search to solve the resulting electric vehicle-routing problem with time windows and single recharge (EVRPTWS), considering the possibility of both full and partial recharge. The heuristic works on routes represented as customer sequences, and recharge operations are implicitly considered by determining the recharging position in the route, the recharging station to visit, and the amount to be recharged in optimal fashion. We discuss how our algorithm can be extended to handle nonlinear recharging times, different recharging times per station, and time-dependent waiting times at stations. In numerical studies on EVRPTWS instances from the literature, the method provides optimal or near-optimal solutions for instances with up to 100 customers within reasonable runtimes. Additional studies investigate the cost savings potential of partial recharges in comparison to full recharges in the presence of time-window constraints, and examine the factors that influence this cost saving potential.en_GB
dc.identifier.doihttp://doi.org/10.25358/openscience-6233
dc.identifier.urihttps://openscience.ub.uni-mainz.de/handle/20.500.12030/6243
dc.language.isoengde
dc.rightsCC-BY-4.0*
dc.rights.urihttps://creativecommons.org/licenses/by/4.0/*
dc.subject.ddc330 Wirtschaftde_DE
dc.subject.ddc330 Economicsen_GB
dc.titleRouting electric vehicles with a single recharge per routeen_GB
dc.typeZeitschriftenaufsatzde
jgu.journal.issue2de
jgu.journal.titleNetworksde
jgu.journal.volume76de
jgu.organisation.departmentFB 03 Rechts- und Wirtschaftswissenschaftende
jgu.organisation.nameJohannes Gutenberg-Universität Mainz
jgu.organisation.number2300
jgu.organisation.placeMainz
jgu.organisation.rorhttps://ror.org/023b0x485
jgu.pages.end205de
jgu.pages.start187de
jgu.publisher.doi10.1002/net.21964
jgu.publisher.issn1097-0037de
jgu.publisher.nameWileyde
jgu.publisher.placeNew York, NYde
jgu.publisher.urihttps://doi.org/10.1002/net.21964de
jgu.publisher.year2020
jgu.rights.accessrightsopenAccess
jgu.subject.ddccode330de
jgu.type.dinitypeArticleen_GB
jgu.type.resourceTextde
jgu.type.versionPublished versionde

Files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
löffler_maximilian-routing_electr-20210802212614244.pdf
Size:
1.26 MB
Format:
Adobe Portable Document Format
Description:

License bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
license.txt
Size:
3.57 KB
Format:
Item-specific license agreed upon to submission
Description: