Skip to main navigation Skip to search Skip to main content

Operating expense optimization for EVs in multiple depots and charge stations environment using evolutionary heuristic method

Research output: Journal Publications and ReviewsRGC 21 - Publication in refereed journalpeer-review

Abstract

In this paper, an operating cost optimization problem of electric vehicles (EVs) is studied in a large-scale logistics and transportation network. An extended EV operational model is proposed for a multiple depots and charge stations environment where practical constraints are included. In the proposed model, new practical mathematical schemes are proposed to describe the constraints. Then, a new two-step clustering heuristic optimization (TCHO) method is developed to minimize the total operating cost of the EV routes while satisfying all the constraints. In the first step, a novel heuristic edge sharing assigning algorithm is designed to split the large scale logistic network into different clusters. In the second step, a new shortest path heuristic method is developed to minimize the total expense of the EV routes for each cluster. Furthermore, based on the TCHO, a novel discrete differential evolution-TCHO is proposed to improve the performance on solving the problem. The effectiveness of the proposed models and methods is verified by comprehensive numerical simulations where the well-known vehicle routing problem benchmarks are applied. © 2017 IEEE.
Original languageEnglish
Pages (from-to)6599-6611
Number of pages13
JournalIEEE Transactions on Smart Grid
Volume9
Issue number6
Online published19 Jun 2017
DOIs
Publication statusPublished - Nov 2018
Externally publishedYes

Research Keywords

  • charge stations
  • discrete differential evolution
  • Electric vehicle
  • heuristic method
  • multiple depots

Fingerprint

Dive into the research topics of 'Operating expense optimization for EVs in multiple depots and charge stations environment using evolutionary heuristic method'. Together they form a unique fingerprint.

Cite this