Routing electric vehicles with a single recharge per route

Publication type:
Journal article
Metadata:
Autoren
  • Maximilian Loeffler
  • Guy Desaulniers
  • Stefan Irnich
  • Michael Schneider
Autoren-URL
https://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=fis-test-1&SrcAuth=WosAPI&KeyUT=WOS:000542719800001&DestLinkType=FullRecord&DestApp=WOS_CPL
DOI
10.1002/net.21964
eISSN
1097-0037
Externe Identifier
  • Clarivate Analytics Document Solution ID: MU1HR
ISSN
0028-3045
Ausgabe der Veröffentlichung
2
Zeitschrift
NETWORKS
Schlüsselwörter
  • electric vehicles
  • granular tabu search
  • implicit representation
  • large neighborhood search
  • time windows
  • vehicle routing
Paginierung
187 - 205
Datum der Veröffentlichung
2020
Status
Published
Titel
Routing electric vehicles with a single recharge per route
Sub types
  • Article
Ausgabe der Zeitschrift
76

Data source: Web of Science (Lite)

Other metadata sources:
Abstract
<jats:title>Abstract</jats:title><jats:p>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.</jats:p>
Autoren
  • Maximilian Löffler
  • Guy Desaulniers
  • Stefan Irnich
  • Michael Schneider
DOI
10.1002/net.21964
eISSN
1097-0037
ISSN
0028-3045
Ausgabe der Veröffentlichung
2
Zeitschrift
Networks
Sprache
en
Online publication date
2020
Paginierung
187 - 205
Datum der Veröffentlichung
2020
Status
Published
Herausgeber
Wiley
Herausgeber URL
http://dx.doi.org/10.1002/net.21964
Datum der Datenerfassung
2023
Titel
Routing electric vehicles with a single recharge per route
Ausgabe der Zeitschrift
76

Data source: Crossref

Autoren
  • Maximilian Löffler
  • Guy Desaulniers
  • Stefan Irnich
  • Michael Schneider
DOI
10.1002/net.21964
Zeitschrift
Networks
Artikelnummer
2
Paginierung
187 - 205
Datum der Veröffentlichung
2020
Titel
Routing electric vehicles with a single recharge per route.
Ausgabe der Zeitschrift
76

Data source: DBLP

Author's licence
CC-BY
Autoren
  • Maximilian Löffler
  • Guy Desaulniers
  • Stefan Irnich
  • Michael Schneider
Hosting institution
Universitätsbibliothek Mainz
Sammlungen
  • JGU-Publikationen
Resource version
Published version
DOI
10.1002/net.21964
File(s) embargoed
false
Open access
true
ISSN
1097-0037
Ausgabe der Veröffentlichung
2
Zeitschrift
Networks
Schlüsselwörter
  • 330 Wirtschaft
  • 330 Economics
Sprache
eng
Open access status
Open Access
Paginierung
187 - 205
Datum der Veröffentlichung
2020
Public URL
https://openscience.ub.uni-mainz.de/handle/20.500.12030/6243
Herausgeber
Wiley
Herausgeber URL
https://doi.org/10.1002/net.21964
Datum der Datenerfassung
2021
Datum, an dem der Datensatz öffentlich gemacht wurde
2021
Zugang
Public
Titel
Routing electric vehicles with a single recharge per route
Ausgabe der Zeitschrift
76

Files

löffler_maximilian-routing_electr-20210802212614244.pdf

Data source: OPENSCIENCE.UB

Beziehungen:
Property of

Tools