4.6 Article

Electric Vehicle Charging Station Location-Routing Problem with Time Windows and Resource Sharing

Journal

SUSTAINABILITY
Volume 14, Issue 18, Pages -

Publisher

MDPI
DOI: 10.3390/su141811681

Keywords

charging station location-routing problem; multi-depot multi-period electric vehicle routing optimization; resource sharing; bi-objective nonlinear programming model; hybrid algorithm

Funding

  1. National Natural Science Foundation of China [71871035]
  2. Key Science and Technology Research Project of Chongqing Municipal Education Commission [KJZDK202000702]
  3. Key Project of the Human Social Science of Chongqing Municipal Education Commission [20SKGH079]
  4. Chongqing Liuchuang Plan Innovation Project [cx2021038]
  5. Team Building Project for Graduate Tutors in Chongqing [JDDSTD2019008]
  6. Chongqing Bayu Scholar Youth Project [YS2021058]
  7. Research and Innovation Program for Graduate Students in Chongqing [CYS22424]

Ask authors/readers for more resources

This study introduces a problem involving the optimization of electric vehicle charging station locations and routes, considering time windows and resource sharing. A bi-objective programming model and a hybrid algorithm are proposed to solve the problem, and an empirical study is conducted in Chongqing City, China. The results demonstrate the effectiveness and practicality of the proposed solution method in achieving sustainable operations.
Electric vehicles (EVs) are widely applied in logistics companies' urban logistics distribution, as fuel prices increase and environmental awareness grows. This study introduces an EV charging station (CS) location-routing problem with time windows and resource sharing (EVCS-LRPTWRS). Resource sharing, among multiple depots within multiple service periods is proposed to adjust the transportation resource configuration for a sustainable logistics development. Solving the EVCS-LRPTWRS involves a periodic CS location selection and a multi-depot multi-period EV routing optimization. A bi-objective nonlinear programming model is proposed to formulate the EVCS-LRPTWRS with a minimum total operating cost and number of EVs. A hybrid algorithm combining the Gaussian mixture clustering algorithm (GMCA) with the improved nondominated sorting genetic algorithm-II (INSGA-II) is designed to address the EVCS-LRPTWRS. The GMCA is employed to assign customers to appropriate depots in various service periods in order to reduce the computational complexity. The INSGA-II is adopted to obtain the Pareto optimal solutions by using the CS insertion operation to select CS locations and integrating the elite retention mechanism to ensure a stable and excellent performance. The superiority of the hybrid algorithm is proven by comparison with the other three algorithms (i.e., multi-objective genetic algorithm, multi-objective particle swarm optimization, and multi-objective ant colony optimization). An empirical study of the EVCS-LRPTWRS in Chongqing City, China is conducted. Then, four types of service period divisions and three scenarios of resource sharing modes are further analyzed and discussed. The empirical results demonstrate the validity and practicability of the proposed solution method in realizing a sustainable operation in EV distribution networks.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.6
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available