Optimizing electric vehicle routing with nonlinear charging and time windows using improved differential evolution algorithm

Date

2024-01-28

Advisors

Journal Title

Journal ISSN

ISSN

Volume Title

Publisher

Springer

Type

Article

Peer reviewed

Yes

Abstract

In real-life, green logistics is prevalent with the advent of pollution reduction; therefore, electric vehicle routing problem (EVRP) gains more focus. However, nonlinear charging technique has not obtained adequate attention for EVRP with time windows. In this study, an improved differential evolution (IDE) algorithm is introduced to address a variant of EVRP, which involves time windows and partial recharging policy with nonlinear charging. In IDE, a productive approach is developed to instruct the electric vehicle to charge in advance. A modified crossover operator is proposed to make populations more diverse. Five local neighborhood operators and a simulated annealing algorithm are embedded to enhance search quality. Further, we generate 55 instances based on Solomon benchmark and Analysis of Variance is leveraged to manifest the efficacy. Similarly, three algorithms are selected for comparison, i.e., genetic algorithm, artificial bee colony algorithm, and adaptive large neighborhood search. Experimental comparisons reveal that IDE outperforms others.

Description

The file attached to this record is the author's final peer reviewed version. The Publisher's final version can be found by following the DOI link.

Keywords

Electric vehicle, scheduling, differential evolution algorithm, routing

Citation

Deng, J., Zhang, J., and Yang, S. (2024) Optimizing electric vehicle routing with nonlinear charging and time windows using improved differential evolution algorithm. Cluster Computing,

Rights

Attribution-NonCommercial-NoDerivs 2.0 UK: England & Wales
http://creativecommons.org/licenses/by-nc-nd/2.0/uk/

Research Institute

Institute of Artificial Intelligence (IAI)