A Clustering Approach for the Optimal Siting of Recharging Stations in the Electric Vehicle Routing Problem with Time Windows

21Citations
Citations of this article
91Readers
Mendeley users who have this article in their library.

Abstract

Transportation has been incorporating electric vehicles (EVs) progressively. EVs do not produce air or noise pollution, and they have high energy efficiency and low maintenance costs. In this context, the development of efficient techniques to overcome the vehicle routing problem becomes crucial with the proliferation of EVs. The vehicle routing problem concerns the freight capacity and battery autonomy limitations in different delivery-service scenarios, and the challenge of best locating recharging stations. This work proposes a mixed-integer linear programming model to solve the electric location routing problem with time windows (E-LRPTW) considering the state of charge, freight and battery capacities, and customer time windows in the decision model. A clustering strategy based on the k-means algorithm is proposed to divide the set of vertices (EVs) into small areas and define potential sites for recharging stations, while reducing the number of binary variables. The proposed model for E-LRPTW was implemented in Python and solved using mathematical modeling language AMPL together with CPLEX. Performed tests on instances with 5 and 10 clients showed a large reduction in the time required to find the solution (by about 60 times in one instance). It is concluded that the strategy of dividing customers by sectors has the potential to be applied and generate solutions for larger geographical areas and numbers of recharging stations, and determine recharging station locations as part of planning decisions in more realistic scenarios.

References Powered by Scopus

The global k-means clustering algorithm

2791Citations
N/AReaders
Get full text

Extensions to the k-means algorithm for clustering large data sets with categorical values

2088Citations
N/AReaders
Get full text

The electric vehicle-routing problem with time windows and recharging stations

964Citations
N/AReaders
Get full text

Cited by Powered by Scopus

Optimizing Electric Vehicle Charging Networks Using Clustering Technique

40Citations
N/AReaders
Get full text

Low-Carbon Routing Based on Improved Artificial Bee Colony Algorithm for Electric Trackless Rubber-Tyred Vehicles

17Citations
N/AReaders
Get full text

Electric vehicle charging service operations: A review of machine learning applications for infrastructure planning, control, pricing and routing

17Citations
N/AReaders
Get full text

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Cite

CITATION STYLE

APA

Sánchez, D. G., Tabares, A., Faria, L. T., Rivera, J. C., & Franco, J. F. (2022). A Clustering Approach for the Optimal Siting of Recharging Stations in the Electric Vehicle Routing Problem with Time Windows. Energies, 15(7). https://doi.org/10.3390/en15072372

Readers' Seniority

Tooltip

PhD / Post grad / Masters / Doc 15

71%

Lecturer / Post doc 3

14%

Researcher 3

14%

Readers' Discipline

Tooltip

Engineering 13

72%

Energy 2

11%

Immunology and Microbiology 2

11%

Social Sciences 1

6%

Article Metrics

Tooltip
Mentions
Blog Mentions: 1

Save time finding and organizing research with Mendeley

Sign up for free