Research on Optimization of Electric Vehicle Routing Problem With Time Window

As the urban population and scale gradually increase, the per capita income level of urban residents is also constantly increasing, more people have put forward higher requirements for material life. The degree of congestion of urban roads has a strong positive correlation with the development level...

Full description

Bibliographic Details
Main Authors: Hao Li, Zhenping Li, Li Cao, Ruoda Wang, Mu Ren
Format: Article
Language:English
Published: IEEE 2020-01-01
Series:IEEE Access
Subjects:
Online Access:https://ieeexplore.ieee.org/document/9160932/
_version_ 1818725942489513984
author Hao Li
Zhenping Li
Li Cao
Ruoda Wang
Mu Ren
author_facet Hao Li
Zhenping Li
Li Cao
Ruoda Wang
Mu Ren
author_sort Hao Li
collection DOAJ
description As the urban population and scale gradually increase, the per capita income level of urban residents is also constantly increasing, more people have put forward higher requirements for material life. The degree of congestion of urban roads has a strong positive correlation with the development level of the national economy. The crowded lanes directly affect the way people travel, especially in the field of logistics distribution. Electric vehicle distribution is one of the existing distribution methods that is less affected by traffic, but it is subject to mileage, cargo capacity and number of vehicles. In order to find an optimal urban distribution route that satisfies both the electric vehicle limitation and the customer time window limitation, a mixed planning model is established to conduct in-depth research on the routing problem. In the process of verifying the correctness of the model, a mixed algorithm with lower time complexity, which was calculated by the highest order in the model, is established, and two sets of instance data are used for calculation. The results show that the mixed algorithm not only has a faster calculation speed, but also can calculate the vehicle route in a large-scale situation.
first_indexed 2024-12-17T21:50:19Z
format Article
id doaj.art-14c6f30a09184766b856df3aa82b86be
institution Directory Open Access Journal
issn 2169-3536
language English
last_indexed 2024-12-17T21:50:19Z
publishDate 2020-01-01
publisher IEEE
record_format Article
series IEEE Access
spelling doaj.art-14c6f30a09184766b856df3aa82b86be2022-12-21T21:31:20ZengIEEEIEEE Access2169-35362020-01-01814670714671810.1109/ACCESS.2020.30146389160932Research on Optimization of Electric Vehicle Routing Problem With Time WindowHao Li0https://orcid.org/0000-0002-8714-0940Zhenping Li1https://orcid.org/0000-0002-3324-5405Li Cao2https://orcid.org/0000-0002-6023-4998Ruoda Wang3https://orcid.org/0000-0002-9502-2784Mu Ren4https://orcid.org/0000-0002-0580-3799School of Economics and Management, Inner Mongolia University, Hohhot, ChinaSchool of Information, Beijing Wuzi University, Beijing, ChinaSchool of Computer and Information, Inner Mongolia Medical University, Hohhot, ChinaHohhot Branch of Beijing No.4 High School, Hohhot, ChinaSchool of Management Science and Information Engineering, Jilin University of Finance and Economics, Changchun, ChinaAs the urban population and scale gradually increase, the per capita income level of urban residents is also constantly increasing, more people have put forward higher requirements for material life. The degree of congestion of urban roads has a strong positive correlation with the development level of the national economy. The crowded lanes directly affect the way people travel, especially in the field of logistics distribution. Electric vehicle distribution is one of the existing distribution methods that is less affected by traffic, but it is subject to mileage, cargo capacity and number of vehicles. In order to find an optimal urban distribution route that satisfies both the electric vehicle limitation and the customer time window limitation, a mixed planning model is established to conduct in-depth research on the routing problem. In the process of verifying the correctness of the model, a mixed algorithm with lower time complexity, which was calculated by the highest order in the model, is established, and two sets of instance data are used for calculation. The results show that the mixed algorithm not only has a faster calculation speed, but also can calculate the vehicle route in a large-scale situation.https://ieeexplore.ieee.org/document/9160932/Electric vehicleinsertion methodexchange methodheuristicvehicle route
spellingShingle Hao Li
Zhenping Li
Li Cao
Ruoda Wang
Mu Ren
Research on Optimization of Electric Vehicle Routing Problem With Time Window
IEEE Access
Electric vehicle
insertion method
exchange method
heuristic
vehicle route
title Research on Optimization of Electric Vehicle Routing Problem With Time Window
title_full Research on Optimization of Electric Vehicle Routing Problem With Time Window
title_fullStr Research on Optimization of Electric Vehicle Routing Problem With Time Window
title_full_unstemmed Research on Optimization of Electric Vehicle Routing Problem With Time Window
title_short Research on Optimization of Electric Vehicle Routing Problem With Time Window
title_sort research on optimization of electric vehicle routing problem with time window
topic Electric vehicle
insertion method
exchange method
heuristic
vehicle route
url https://ieeexplore.ieee.org/document/9160932/
work_keys_str_mv AT haoli researchonoptimizationofelectricvehicleroutingproblemwithtimewindow
AT zhenpingli researchonoptimizationofelectricvehicleroutingproblemwithtimewindow
AT licao researchonoptimizationofelectricvehicleroutingproblemwithtimewindow
AT ruodawang researchonoptimizationofelectricvehicleroutingproblemwithtimewindow
AT muren researchonoptimizationofelectricvehicleroutingproblemwithtimewindow