scholarly journals Constructive Heuristics for Periodic Electric Vehicle Routing Problem

2018 ◽  
Author(s):  
Tayeb Oulad Kouider ◽  
Wahiba Ramdane Cherif-Khettaf ◽  
Ammar Oulamara
Keyword(s):  
Vehicle Routing ◽  
Electric Vehicle ◽  
Vehicle Routing Problem ◽  
Routing Problem ◽  
Constructive Heuristics

scholarly journals The Mathematical Model and an Genetic Algorithm for the Two-Echelon Electric Vehicle Routing Problem

2021 ◽  
Vol 1813 (1) ◽  
pp. 012006
Author(s):  
Yue Zhang ◽  
Shenghan Zhou ◽  
XinPeng Ji ◽  
Bang Chen ◽  
HouXiang Liu ◽  
...  
Keyword(s):  
Genetic Algorithm ◽  
Mathematical Model ◽  
Vehicle Routing ◽  
Electric Vehicle ◽  
Vehicle Routing Problem ◽  
Routing Problem ◽  
The Mathematical Model

scholarly journals Solving Practical Vehicle Routing Problem with Time Windows Using Metaheuristic Algorithms

1970 ◽  
Vol 24 (4) ◽  
pp. 343-351 ◽  
Author(s):  
Filip Taner ◽  
Ante Galić ◽  
Tonči Carić
Keyword(s):  
Vehicle Routing ◽  
Real World ◽  
Vehicle Routing Problem ◽  
Time Windows ◽  
Iterated Local Search ◽  
Metaheuristic Algorithms ◽  
Benchmark Problems ◽  
Routing Problem ◽  
Constructive Heuristics ◽  
Initial Feasible Solution

This paper addresses the Vehicle Routing Problem with Time Windows (VRPTW) and shows that implementing algorithms for solving various instances of VRPs can significantly reduce transportation costs that occur during the delivery process. Two metaheuristic algorithms were developed for solving VRPTW: Simulated Annealing and Iterated Local Search. Both algorithms generate initial feasible solution using constructive heuristics and use operators and various strategies for an iterative improvement. The algorithms were tested on Solomon’s benchmark problems and real world vehicle routing problems with time windows. In total, 44 real world problems were optimized in the case study using described algorithms. Obtained results showed that the same distribution task can be accomplished with savings up to 40% in the total travelled distance and that manually constructed routes are very ineffective.

scholarly journals Electric Vehicle Routing Problem with Industry Constraints: Trends and Insights for Future Research

2014 ◽  
Vol 3 ◽  
pp. 452-459 ◽  
Author(s):  
Anagnostopoulou Afroditi ◽  
Maria Boile ◽  
Sotirios Theofanis ◽  
Eleftherios Sdoukopoulos ◽  
Dimitrios Margaritis
Keyword(s):  
Vehicle Routing ◽  
Electric Vehicle ◽  
Vehicle Routing Problem ◽  
Future Research ◽  
Routing Problem

Recharge strategies for the electric vehicle routing problem with soft time windows and fast chargers

2021 ◽  
Vol 15 (4/5) ◽  
pp. 444
Author(s):  
Zhenping Li ◽  
Guohua Wu ◽  
Ke Zhang ◽  
Shuxuan Li ◽  
Chenglin Xiao ◽  
...  
Keyword(s):  
Vehicle Routing ◽  
Electric Vehicle ◽  
Vehicle Routing Problem ◽  
Time Windows ◽  
Routing Problem ◽  
Soft Time Windows

scholarly journals Electric Vehicle Routing Problem with Time-Dependent Waiting Times at Recharging Stations

2019 ◽  
Vol 107 ◽  
pp. 77-94 ◽  
Author(s):  
Merve Keskin ◽  
Gilbert Laporte ◽  
Bülent Çatay
Keyword(s):  
Vehicle Routing ◽  
Electric Vehicle ◽  
Vehicle Routing Problem ◽  
Waiting Times ◽  
Time Dependent ◽  
Routing Problem

scholarly journals Electric Vehicle Routing Problem with Battery Swapping Considering Energy Consumption and Carbon Emissions

2020 ◽  
Vol 12 (24) ◽  
pp. 10537
Author(s):  
Jin Li ◽  
Feng Wang ◽  
Yu He
Keyword(s):  
Energy Consumption ◽  
Vehicle Routing ◽  
Electric Vehicle ◽  
Carbon Emissions ◽  
Vehicle Routing Problem ◽  
Hill Climbing ◽  
Neighborhood Search ◽  
Battery Life ◽  
Routing Problem ◽  
Crossover And Mutation

In this paper, we study an electric vehicle routing problem while considering the constraints on battery life and battery swapping stations. We first introduce a comprehensive model consisting of speed, load and distance to measure the energy consumption and carbon emissions of electric vehicles. Second, we propose a mixed integer programming model to minimize the total costs related to electric vehicle energy consumption and travel time. To solve this model efficiently, we develop an adaptive genetic algorithm based on hill climbing optimization and neighborhood search. The crossover and mutation probabilities are designed to adaptively adjust with the change of population fitness. The hill climbing search is used to enhance the local search ability of the algorithm. In order to satisfy the constraints of battery life and battery swapping stations, the neighborhood search strategy is applied to obtain the final optimal feasible solution. Finally, we conduct numerical experiments to test the performance of the algorithm. Computational results illustrate that a routing arrangement that accounts for power consumption and travel time can reduce carbon emissions and total logistics delivery costs. Moreover, we demonstrate the effect of adaptive crossover and mutation probabilities on the optimal solution.

A Variable Neighborhood Search Branching for the Electric Vehicle Routing Problem with Time Windows

2015 ◽  
Vol 47 ◽  
pp. 221-228 ◽  
Author(s):  
Maurizio Bruglieri ◽  
Ferdinando Pezzella ◽  
Ornella Pisacane ◽  
Stefano Suraci
Keyword(s):  
Vehicle Routing ◽  
Electric Vehicle ◽  
Vehicle Routing Problem ◽  
Variable Neighborhood Search ◽  
Time Windows ◽  
Neighborhood Search ◽  
Routing Problem
Sign in / Sign up

Export Citation Format

Share Document