Gutenberg Open Science: Routing electric vehicles with a single recharge per route

Please use this identifier to cite or link to this item: http://doi.org/10.25358/openscience-6233

Full metadata record

DC Field	Value	Language
dc.contributor.author	Löffler, Maximilian	-
dc.contributor.author	Desaulniers, Guy	-
dc.contributor.author	Irnich, Stefan	-
dc.contributor.author	Schneider, Michael	-
dc.date.accessioned	2021-08-03T09:24:19Z	-
dc.date.available	2021-08-03T09:24:19Z	-
dc.date.issued	2020	-
dc.identifier.uri	https://openscience.ub.uni-mainz.de/handle/20.500.12030/6243	-
dc.description.abstract	Driven 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.language.iso	eng	de
dc.rights	CC BY	*
dc.rights.uri	https://creativecommons.org/licenses/by/4.0/	*
dc.subject.ddc	330 Wirtschaft	de_DE
dc.subject.ddc	330 Economics	en_GB
dc.title	Routing electric vehicles with a single recharge per route	en_GB
dc.type	Zeitschriftenaufsatz	de
dc.identifier.doi	http://doi.org/10.25358/openscience-6233	-
jgu.type.dinitype	article	en_GB
jgu.type.version	Published version	de
jgu.type.resource	Text	de
jgu.organisation.department	FB 03 Rechts- und Wirtschaftswissenschaften	de
jgu.organisation.number	2300	-
jgu.organisation.name	Johannes Gutenberg-Universität Mainz	-
jgu.rights.accessrights	openAccess	-
jgu.journal.title	Networks	de
jgu.journal.volume	76	de
jgu.journal.issue	2	de
jgu.pages.start	187	de
jgu.pages.end	205	de
jgu.publisher.year	2020	-
jgu.publisher.name	Wiley	de
jgu.publisher.place	New York, NY	de
jgu.publisher.uri	https://doi.org/10.1002/net.21964	de
jgu.publisher.issn	1097-0037	de
jgu.organisation.place	Mainz	-
jgu.subject.ddccode	330	de
jgu.publisher.doi	10.1002/net.21964
jgu.organisation.ror	https://ror.org/023b0x485
Appears in collections:	JGU-Publikationen

Files in This Item:

	File	Description	Size	Format
	löffler_maximilian-routing_electr-20210802212614244.pdf		1.29 MB	Adobe PDF	View/Open

Show simple item record