A Hybrid Iterative Local Search Algorithm for the Electric Fleet Size and Mix Vehicle Routing Problem with Time Windows and Recharging Stations

Abstract

  As the cities around the world become larger, quality of life of the citizens is more and more threatened due to the traffic congestion, energy consumption, noise disturbance and carbon emissions because of of increasing transport. Electrical vehicles present an opportunity to reduce greenhouse gas emissions. But limited driving range and long recharging times are among the challenges that the research community has to face. This paper proposes an iterative local search algorithm coupled with a set partitioning model to solve The Electric Fleet Size and Mix Vehicle Routing Problem with Time Windows and Recharging Stations. Several types of electrical vehicles with varying driving range, capacity and fixed cost should service a set of customers within their time limits and during their tours each vehicle can be recharged in stations. We show the efficiency and the quality of our method by solving benchmark instances of the Heterogeneous Fleet Electric Vehicle Problems with Time Windows.

Original document

The different versions of the original document can be found in:

• https://doi.org/10.1016/j.ifacol.2016.07.899

• https://hal-utt.archives-ouvertes.fr/hal-02485692

• https://api.elsevier.com/content/article/PII:S2405896316311855?httpAccept=text/plain,

https://api.elsevier.com/content/article/PII:S2405896316311855?httpAccept=text/xml,

http://dx.doi.org/10.1016/j.ifacol.2016.07.899 under the license https://www.elsevier.com/tdm/userlicense/1.0/

• https://www.sciencedirect.com/science/article/pii/S2405896316311855,

https://academic.microsoft.com/#/detail/2516609535