4.7 Article

Optimizing nonlinear charging times of electric vehicle routing with genetic algorithm

期刊

EXPERT SYSTEMS WITH APPLICATIONS
卷 164, 期 -, 页码 -

出版社

PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.eswa.2020.114039

关键词

Vehicle routing problem; Electric vehicles; Battery charging optimization; Nonlinear charging function; Genetic algorithm

资金

  1. Slovenian Research Agency [P2-0057]

向作者/读者索取更多资源

With the increasing use of electric vehicles in the service industry, optimizing their specific constraints has become more important. This paper presents a Two-Layer Genetic Algorithm for solving the capacitated Multi-Depot Vehicle Routing Problem with Time Windows and Electric Vehicles with partial nonlinear recharging times, aiming to minimize driving times, number of stops at charging stations, and recharging time.
With the rising share of electric vehicles used in the service industry, the optimization of their specific constraints is gaining importance. Lowering energy consumption, time of charging and the strain on the electric grid are just some of the issues that must be tackled, to ensure a cleaner and more efficient industry. This paper presents a Two-Layer Genetic Algorithm (TLGA) for solving the capacitated Multi-Depot Vehicle Routing Problem with Time Windows (MDVRPTW) and Electric Vehicles (EV) with partial nonlinear recharging times (NL) - E-MDVRPTW-NL. Here, the optimization goal is to minimize driving times, number of stops at electric charging stations and time of recharging while taking the nonlinear recharging times into account. This routing problem closes the gap between electric vehicle routing problem research on the one hand and its applications to several problems with numerous real-world constraints of electric vehicles on the other. Next to the definition and the formulation of the E-MDVRPTW-NL, this paper presents the evolutionary method for solving this problem using the Genetic Algorithm (GA), where a novel two-layer genotype with multiple crossover operators is considered. This allows the GA to not only solve the order of the routes but also the visits to electric charging stations and the electric battery recharging times. Various settings of the proposed method are presented, tested and compared to competing meta-heuristics using well-known benchmarks with the addition of charging stations.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据