Improved formulations and algorithmic components for the electric vehicle routing problem with nonlinear charging functions
Reads0
Chats0
TLDR
A new model, a heuristic, and an exact labeling algorithm for the problem of finding the optimal charging decisions for a given route, and introduces a path-based model which outperforms the classical models in experiments.About:
This article is published in Computers & Operations Research.The article was published on 2019-04-01 and is currently open access. It has received 119 citations till now. The article focuses on the topics: Vehicle routing problem & Node (circuits).read more
Figures
Table 15: Detailed computational results on the 10-customer instances for the path-based model 
Table 14: Detailed computational results on the 20-customer instances for the CS replication-based models (β 4) 
Figure 5: Performance charts of the different models on small size instances 
Table 4: E-VRP-NL solutions of (Montoya et al., 2017) improved by applying the labeling algorithm on each route 
Table 3: Computational results for the different algorithms on 29,443 routes 
Table 7: Detailed computational results on the 10-customer instances for the CS replication-based models (β 1)
Citations
More filters
Journal ArticleDOI
A Survey on the Electric Vehicle Routing Problem: Variants and Solution Approaches
Tomislav Erdelic,Tonči Carić +1 more
TL;DR: The challenges that emerged with the integration of electric vehicles in the delivery processes are described, together with electric vehicle characteristics and recent energy consumption models.
Journal ArticleDOI
Electric Vehicle Routing Problem with Time-Dependent Waiting Times at Recharging Stations
TL;DR: The results show that waiting at the stations may increase the total cost by 1%–26%, depending on the problem type and queue length, and that recharges tend to shift to less crowded mid-day hours due to the time-dependent waiting times.
Journal ArticleDOI
Green vehicle routing problem: A state-of-the-art review
TL;DR: This paper investigates the main contributions related to the green vehicle routing problem (Green-VRP) and presents a classification scheme based on its variants considered in scientific literature, in particular, three major and applicable streams including internal combustion engine vehicles (ICEVs), alternative-fuel powered vehicles (AFVs), and hybrid electric vehicles (HEVs).
Journal ArticleDOI
Operating Electric Vehicle Fleet for Ride-Hailing Services With Reinforcement Learning
TL;DR: A reinforcement learning based algorithm to operate a community owned electric vehicle fleet, which provides ride-hailing services to local residents, and results show that the proposed approach outperforms the benchmark algorithms in terms of societal cost reduction.
Journal ArticleDOI
The electric vehicle routing problem and its variations: A literature review
TL;DR: A comprehensive literature review of the electric vehicle routing problem (EVRP) and its extensions is presented, the EVRP is clearly defined, variations on the basic EVRP are discussed, and interesting future research directions are discussed.
References
More filters
Journal ArticleDOI
A Green Vehicle Routing Problem
Sevgi Erdogan,Elise Miller-Hooks +1 more
TL;DR: In this paper, a green vehicle routing problem (G-VRP) is formulated and solution techniques are developed to aid organizations with alternative fuel-powered vehicle fleets in overcoming difficulties that exist as a result of limited vehicle driving range in conjunction with limited refueling infrastructure.
Journal ArticleDOI
The Electric Vehicle-Routing Problem with Time Windows and Recharging Stations
TL;DR: This work introduces the electric vehicle-routing problem with time windows and recharging stations E-VRPTW and presents a hybrid heuristic that combines a variable neighborhood search algorithm with a tabu search heuristic, which incorporates the possibility of recharging at any of the available stations using an appropriate recharging scheme.
Posted Content
The Electric Vehicle Routing Problem with Time Windows and Recharging Stations
Abstract: Driven by new laws and regulations concerning the emission of greenhouse gases, carriers are starting to use electric vehicles for last-mile deliveries. The limited battery capacities of these vehicles necessitate visits to recharging stations during delivery tours of industry-typical length, which have to be considered in the route planning to avoid inefficient vehicle routes with long detours. We introduce the electric vehicle-routing problem with time windows and recharging stations E-VRPTW, which incorporates the possibility of recharging at any of the available stations using an appropriate recharging scheme. Furthermore, we consider limited vehicle freight capacities as well as customer time windows, which are the most important constraints in real-world logistics applications. As a solution method, we present a hybrid heuristic that combines a variable neighborhood search algorithm with a tabu search heuristic. Tests performed on newly designed instances for the E-VRPTW as well as on benchmark instances of related problems demonstrate the high performance of the heuristic proposed as well as the positive effect of the hybridization.
Journal ArticleDOI
The Electric Fleet Size and Mix Vehicle Routing Problem with Time Windows and Recharging Stations
TL;DR: A new problem, the so-called Electric Fleet Size and Mix Vehicle Routing Problem with Time Windows (EFSMVRPTW), covers real world applications where an optimal mix of different available battery powered (and conventional) vehicles has to be found.
Journal ArticleDOI
A heuristic approach for the green vehicle routing problem with multiple technologies and partial recharges
TL;DR: In this article, the authors present several heuristics for a variation of the vehicle routing problem in which the transportation fleet is composed of electric vehicles with limited autonomy in need for recharge during their duties.