Electric Vehicle Routing Problem Research Articles

A new Hyper-heuristic based on Adaptive Simulated Annealing and Reinforcement Learning for the Capacitated Electric Vehicle Routing Problem

Electric vehicles (EVs) have been adopted in urban areas to reduce environmental pollution and global warming due to the increasing number of freight vehicles. However, there are still deficiencies in routing the trajectories of last-mile logistics that continue to impact social and economic sustainability. For that reason, in this paper, a hyper-heuristic (HH) approach called Hyper-heuristic Adaptive Simulated Annealing with Reinforcement Learning (HHASARL) is proposed. It is composed of a multi-armed bandit method and the self-adaptive Simulated Annealing (SA) metaheuristic algorithm for solving the problem called Capacitated Electric Vehicle Routing Problem (CEVRP). Due to the limited number of charging stations and the travel range of EVs, the EVs must require battery recharging moments in advance and reduce travel times and costs. The implementation of the HH improves multiple minimum best-known solutions and obtains the best mean values for some high-dimensional instances for the proposed benchmark for the IEEE WCCI2020 competition.

Electric Vehicle Routing Problem with States of Charging Stations

This paper proposes an electric vehicle routing problem, considers the states of charging stations and suggests solution strategies. The charging of electric vehicles is a main issue in the field of electric vehicle routing. There are many studies that find the locations of charging stations, recharging functions for the batteries of vehicles, and so on. However, the state of charging stations significantly affects the routes of electric vehicles, which is not much explored. The states may include open or closed charging stations, occupied or empty charging slots, and so on. This paper investigates how the states of charging stations are estimated and how routing strategies are determined. We formulate a mixed integer programming model and suggest how to solve the problem with an exact method. Numerical examples provide the optimal routing strategies of electric vehicles for the changing environments regarding the states of charging stations.

Mathematical Modelling Approaches for Integrated Single Machine Scheduling and Electric Vehicle Routing Problem

Mathematical Modelling Approaches for Integrated Single Machine Scheduling and Electric Vehicle Routing Problem

A hybrid metaheuristic to optimize electric first-mile feeder services with charging synchronization constraints and customer rejections

This paper addresses the on-demand meeting-point-based feeder electric bus routing and charging scheduling problem under charging synchronization constraints. The problem considered exhibits the structure of the location routing problem, which is more difficult to solve than many electric vehicle routing problems with capacitated charging stations. We propose to model the problem using a mixed-integer linear programming approach based on a layered graph structure. An efficient hybrid metaheuristic solution algorithm is proposed. A mixture of random and greedy partial charging scheduling strategies is used to find feasible charging schedules under the synchronization constraints. The algorithm is tested on instances with up to 100 customers and 49 bus stops/meeting points. The results show that the proposed algorithm provides near-optimal solutions within less one minute on average compared with the best solutions found by a mixed-integer linear programming solver set with a 4-hour computation time limit. A case study on a larger sized case with 1000 customers and 111 meeting points shows the proposed method is applicable to real-world situations.

Electric Vehicle Routing Problem with an Enhanced Vehicle Dispatching Approach Considering Real-Life Data

Although the EVRP (Electric Vehicle routing problem) has promising results on the environmental scale, its implementation has proved challenging. The difficulty of the EVRP resides in the limited driving range of the electric vehicles, combined with the significant charging time. While the charging cost is less than the cost of fuel, this charge time adds to the overall travel time and may overlap with customers’ time windows. All these factors increased the computational time exponentially and resulted in the need to overlook some constraints such as traffic congestion, road conditions, weather impact on energy consumption, and driving style, to name a few, in order to speed up execution time. While this method proved effective in accelerating the process of the EVRP, it did, however, render the approach unrealistic, as it steered far from real-life settings and made the approach unpredictable when facing dynamic and changing parameters. In this paper, we try to remedy this issue by proposing an approach in which we try to replicate real-life parameters such as heterogenous fleets, energy consumption, and infrastructure data. The objective of our approach was to minimize the total travel time, travel distance, energy consumed, and the number of vehicles deployed. To solve this problem, we propose a three-stages approach, in which the first stage consists of a newly developed dispatching approach where customers are assigned to vehicles. The second stage uses the genetic algorithm to find a set of optimal paths, and, finally, in the third stage, charging stations are inserted in the selected paths. Upon testing our approach on Solomon’s instances, our approach proved effective in finding optimal solutions in a reasonable time for five- to fifteen-customer datasets. However, when trying to solve larger datasets, the approach was slowed down by the extreme number of constraints it had to satisfy.

Bilevel planning of electric vehicle charging station and battery swapping station considering real-time uncertainty

The placement of electric vehicle charging stations (EVCS) and battery swapping stations (BSS) is crucial to meet demand while minimizing their impact on the power system network. This article addresses the placement and scheduling of EVCS and BSS within a radial distribution network (RDN) overlaid with a road network. Electric Vehicle Routing Problem (EVRP) and Traffic Assignment Problem (TAP) is introduced to reduce EV energy consumption during trips to EVCS and BSS. A Bi-layer optimization approach is used, with the outer layer minimizing energy loss by allocating EVCS and BSS optimally, and the inner layer optimizing scheduling considering associated costs. Uncertainties related to EV is considered on a real-time trip basis and modelled using 2m-Point estimation method. The problem is solved using Differential Evolution (DE) and Prairie Dog Optimization (PDO) techniques. PDO results in a 9.6% reduction in total energy losses and a 22.5% decrease in total associated costs by optimally placing EVCS at 69, 25,114 and BSS at 19, 84,113 of the RDN compared to DE. Inclusion of 2-m PEM uncertainty increases total energy loss by 8.76% but decreases total associated costs by 6.97% compared to real-time uncertainty cases, enhancing the realism of the results.

The electric vehicle routing problem of a new mobile charging service

Abstract A novel mobile charging service that utilizes vehicle-to-vehicle (V2V) charging technology has recently been proposed as a supplement to fixed charging infrastructure (CI), enabling electric vehicles (EVs) to exchange electricity. This study formulates a vehicle routing problem (VRP) of vehicle-to-vehicle (V2V) charging, optimizing the routing of DVs to service RVs while taking into account their willingness to join the V2V charging platform. A mixed integer linear programming (MILP) model is established to optimize the VRP-V2V (i.e. the VRP of V2V charging), which is known to be NP-hard. To solve large-scale instances for real-world applications, we propose an adaptive large neighborhood search (ALNS) algorithm, which, when combined with the structure of the VRP-V2V problem, utilizes four local search procedures to enhance solution quality following destroy and repair operators. Results indicate that the proposed ALNS algorithm outperforms the optimization solver CPLEX in small-scale instances, and can solve large-scale instances that are infeasible using CPLEX solver. In a numerical analysis of Changsha's large-scale network, we demonstrate that the V2V platform can save an average of 33.1% on the charging cost of recharging vehicles, hence raising customer satisfaction with charging services and reducing range anxiety. The platform's profitability is also increased by using V2V charging in areas lacking fixed charging infrastructure.

Battery Management in Electric Vehicle Routing Problems: A Review

The adoption of electric vehicles (EVs) has gained significant momentum in recent years as a sustainable alternative to traditional internal combustion engine vehicles. However, the efficient utilization of batteries in EVs, coupled with the growing demand for sustainable transportation, has posed complex challenges for battery management in the context of electric vehicle routing problems in a broad sense, which includes vehicle routing problems, team orienteering problems, and arc routing problems, all of them using EVs. This paper presents a comprehensive review of the state-of-the-art approaches, methodologies, and strategies for battery management in each of the aforementioned optimization problems. We explore the relevant factors influencing battery performance and the interplay between routing, charging, and energy management in the context of EVs. The paper also discusses the advances in optimization algorithms, vehicle-to-grid integration, and intelligent decision-making techniques aimed at enhancing the range, reliability, and sustainability of EV operations. Key findings indicate a paradigm shift towards addressing uncertainties, dynamic conditions, and synchronization challenges inherent in large-scale and dynamic routing problems within the context of EVs that require efficient battery management.

Heuristic Algorithms for Heterogeneous and Multi-Trip Electric Vehicle Routing Problem with Pickup and Delivery

In light of the widespread use of electric vehicles for urban distribution, this paper delves into the electric vehicle routing problem (EVRP): specifically addressing multiple trips per vehicle, diverse vehicle types, and simultaneous pickup and delivery. The primary objective is to minimize the overall cost, which encompasses travel expenses, waiting times, recharging costs, and fixed vehicle costs. The focal problem is formulated as a heterogeneous and multi-trip electric vehicle routing problem with pickup and delivery (H-MT-EVRP-PD). Additionally, we introduce two heuristic algorithms to efficiently approximate solutions within a reasonable computational time. The variable neighborhood search (VNS) algorithm and the adaptive large neighborhood search (ALNS) algorithm are presented and compared based on our computational experiences with both. Through solving a series of large-scale real-world instances for the H-MT-EVRP-PD and smaller instances using an exact method, we demonstrate the efficacy of the proposed approaches.

Retraction Note: two-echelon electric vehicle routing problem with a developed moth-flame meta-heuristic algorithm

Retraction Note: two-echelon electric vehicle routing problem with a developed moth-flame meta-heuristic algorithm

Optimalitas Rute pada Pengiriman Multiperjalanan dengan Armada Kendaraan Listrik Heterogen

Electric vehicles are emerging as a key trend in sustainable mobility, mitigating emissions, and reducing dependence on fossil fuels. The challenge in optimizing route modeling lies in some limitations, such as battery range, charging time, and the diversity of electric vehicle types. This article explores the optimality of routes in a multiple-trip distribution system using a heterogeneous fleet of electric vehicles. The electric vehicle routing problem is formulated as a mixed-integer linear programming aiming to find the most cost-efficient optimal route. A notable feature of the model allows electric vehicle fleets to undertake additional travel to complete distribution tasks, i.e., multiple trips. The model is implemented in two illustrative examples involving the delivery of goods using homogeneous and heterogeneous electric vehicle fleets characterized by loading and battery capacities. Each case includes one depot, 8 and 10 customers, and 2 battery swapping stations, solved using the branch-and-bound method through Lingo 18.0. Simulation results indicate that battery capacity and the presence of battery swapping stations significantly influence the routes selection.

Mean–standard-deviation-based electric vehicle routing problem with time windows using Lagrangian relaxation and extended alternating direction method of multipliers-based decomposition algorithm

Mean–standard-deviation-based electric vehicle routing problem with time windows using Lagrangian relaxation and extended alternating direction method of multipliers-based decomposition algorithm

Joint electric vehicle routing and battery health management integrating an explicit state of charge model

Although fleet management has been extensively explored in transportation science, the rise of electromobility imposes several scientific challenges and opportunities. So far, few attempts were made to include battery degradation in the Electric Vehicle Routing Problem (EVRP). To do it realistically, it is necessary to model State of Charge (SoC), however most versions of routing problems use oversimplified SoC models or consider only energy consumption which leads to less robust solutions overall. In this work, a method for estimating battery degradation, which relies on a realistic SoC model is presented and incorporated into a new version of the electric vehicle routing problem. In this version, not only battery degradation is integrated, but also the possibility of limiting different vehicle parameters, such as maximum vehicle speed and acceleration. Due to the extra computational complexity related to the SoC and degradation models, a genetic algorithm capable of solving the aforementioned extended EVRP is presented. Finally, through different numerical experiments, the advantages of the proposed methodology are shown.

Using infeasible path cuts to solve Electric Vehicle Routing Problems with realistic charging functions exactly within a branch-and-cut framework

The paper investigates the Electric Vehicle Routing Problem with a non-linear concave and strictly monotonic increasing charging function. In the literature, the non-linear charging function is typically approximated by a piecewise linear charging function which does not overestimate the real charging function in any point. As the piecewise linear charging function underestimates the real state-of-charge in some points, such an approximation excludes feasible solutions from the solution space. To overcome this drawback we introduce a new method to determine a piecewise linear charging function overestimating the real charging function in a way that the area between both functions is minimized as well as an adaptation of a known linearization to include the piecewise linear charging function in a branch-and-cut approach. Thereby, we include infeasible solutions in the solution space. To declare them infeasible again we check every integer solution obtained in the branch-and-cut procedure and add an infeasible path cut if the solution is infeasible for the real charging function such that the procedure terminates with an optimal solution for the real charging function. Our approach is evaluated in a computational study in which instances with up to 100 customers were solved to optimality. Moreover, we evaluate the trade-off between a more complex model formulation due to more binary variables if the number of supporting points for the piecewise linear approximation is increased and the higher approximation error if fewer supporting points are used.

A Dual-Population Based Co-evolutionary Algorithm for Capacitated Electric Vehicle Routing Problems

A Dual-Population Based Co-evolutionary Algorithm for Capacitated Electric Vehicle Routing Problems

An Adaptive Large Neighborhood Search for Multi-depot Electric Vehicle Routing Problem with Time Windows

An Adaptive Large Neighborhood Search for Multi-depot Electric Vehicle Routing Problem with Time Windows

An electric vehicle routing model with charging stations consideration for sustainable logistics

PurposeRecently, electric vehicles have been widely used in the cold chain logistics sector to reduce the effects of excessive energy consumption and to support environmental friendliness. Considering the limited battery capacity of electric vehicles, it is vital to optimize battery charging during the distribution process.Design/methodology/approachThis study establishes an electric vehicle routing model for cold chain logistics with charging stations, which will integrate multiple distribution centers to achieve sustainable logistics. The suggested optimization model aimed at minimizing the overall cost of cold chain logistics, which incorporates fixed, damage, refrigeration, penalty, queuing, energy and carbon emission costs. In addition, the proposed model takes into accounts factors such as time-varying speed, time-varying electricity price, energy consumption and queuing at the charging station. In the proposed model, a hybrid crow search algorithm (CSA), which combines opposition-based learning (OBL) and taboo search (TS), is developed for optimization purposes. To evaluate the model, algorithms and model experiments are conducted based on a real case in Chongqing, China.FindingsThe result of algorithm experiments illustrate that hybrid CSA is effective in terms of both solution quality and speed compared to genetic algorithm (GA) and particle swarm optimization (PSO). In addition, the model experiments highlight the benefits of joint distribution over individual distribution in reducing costs and carbon emissions.Research limitations/implicationsThe optimization model of cold chain logistics routes based on electric vehicles provides a reference for managers to develop distribution plans, which contributes to the development of sustainable logistics.Originality/valueIn prior studies, many scholars have conducted related research on the subject of cold chain logistics vehicle routing problems and electric vehicle routing problems separately, but few have merged the above two subjects. In response, this study innovatively designs an electric vehicle routing model for cold chain logistics with consideration of time-varying speeds, time-varying electricity prices, energy consumption and queues at charging stations to make it consistent with the real world.

A novel collaborative electric vehicle routing problem with multiple prioritized time windows and time-dependent hybrid recharging

Due to global warming and environmental deterioration, the development of electric vehicles (EVs) is seen as a key measure to promote energy saving and emission reduction in logistics industries. However, EVs’ limited driving range and long recharging time make them unable to be widely applied in logistics distribution activities. Thus, this study establishes a model for a novel collaborative electric vehicle routing problem with multiple prioritized time windows and time-dependent hybrid recharging to address the above difficulties. The model quantifies and incorporates the priority of different time windows into costs to better satisfy customer demands while minimizing the total costs. A time-dependent hybrid recharging strategy that integrates three modes of in-station fast, in-station normal, and en-route battery swapping with collaborative mobile battery swapping vans (BSVs) is presented to reduce the impact of recharging time on route decision-making. The possible queuing time due to the limited capacity of recharging stations is considered to simulate the practical application scenarios. To effectively solve the complex model of synchronous optimization of EV and BSV routes, an extended adaptive large neighborhood search algorithm with two-dimensional coding scheme is proposed. In the proposed algorithm, several removal and insertion operators are integrated to effectively evolve the solutions, and the variable neighborhood descent algorithm is combined with local search operators to further improve the algorithmic performance. Comparison experiments were conducted to verify the effectiveness of the proposed algorithm by comparing with the other baseline algorithms.

A GRASP Approach for the Energy-Minimizing Electric Vehicle Routing Problem with Drones

This study addresses the Electric Vehicle Routing Problem with Drones (EVRPD) by implementing and comparing two variants of the Greedy Randomized Adaptive Search Procedure (GRASP). The primary objective of the EVRPD is to optimize the routing of a combined fleet of ground and aerial vehicles, with the aim of improving delivery efficiency and minimizing energy consumption, which is directly influenced by the weight of the packages. The study assumes a standardized packing system consisting of three weight classes, where deliveries are exclusively performed by drones, while ground vehicles function as mobile depots. The two employed GRASP variants vary in their methods of generating the Restricted Candidate List (RCL), with one utilizing a cardinality-based RCL and the other adopting a value-based RCL. To evaluate their performance, benchmark instances from the existing EVRPD literature are utilized, extensive computational experiments are conducted, and the obtained computational results are compared and discussed. The findings of the research highlight the considerable impact of RCL generation strategies on solution quality. Lastly, the study reports four new best-known values.

Conflict-free electric vehicle routing problem: an improved compositional algorithm

AbstractThe Conflict-Free Electric Vehicle Routing Problem (CF-EVRP) is a combinatorial optimization problem of designing routes for vehicles to execute tasks such that a cost function, typically the number of vehicles or the total travelled distance, is minimized. The CF-EVRP involves constraints such as time windows on the tasks’ execution, limited operating range of the vehicles, and limited capacity on the number of vehicles that a road segment can simultaneously accommodate. In previous work, the compositional algorithm ComSat was introduced to solve the CF-EVRP by breaking it down into sub-problems and iteratively solve them to build an overall solution. Though ComSat showed good performance in general, some problem instances took significant time to solve due to the high number of iterations required to find solutions for two sub-problems, namely the Routing Problem, and the Paths Changing Problem. This paper addresses the bottlenecks of ComSat and presents new formulations for both sub-problems in order to reduce the number of iterations required to find feasible solutions to the CF-EVRP. Experiments on sets of benchmark instances show the effectiveness of the presented improvements.