The Mathematical Model and an Genetic Algorithm for the Two-Echelon Electric Vehicle Routing Problem

6Citations
Citations of this article
15Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In order to cope with the challenges of high cargo load and high timeliness distribution in logistics industry, as well as to alleviate the current situation of oil resource depletion and air pollution, this study established a mathematical model of two-echelon electric vehicle routing problem (2E-EVRP) and design a heuristic algorithm. The 2E-EVRP can be divided into the multiple depot vehicle routing problem (MDEVRP) and the split delivery vehicle routing problem (SDVRP). The proposed genetic algorithm is used to solve the MDEVRP, and the actual case of a logistics company in Beijing is taken as the calculation experiment, so as to verify the feasibility of the proposed algorithm and provide decision-making reference for the development of logistics enterprises. The results show that the total path length obtained by the proposed algorithm is optimized by 20.82 kilometers compared with the traditional simulated annealing algorithm.

Cite

CITATION STYLE

APA

Zhang, Y., Zhou, S., Ji, X., Chen, B., Liu, H., Xiao, Y., & Chang, W. (2021). The Mathematical Model and an Genetic Algorithm for the Two-Echelon Electric Vehicle Routing Problem. In Journal of Physics: Conference Series (Vol. 1813). IOP Publishing Ltd. https://doi.org/10.1088/1742-6596/1813/1/012006

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free