.png){kind=icon}
返回
A greedy search based evolutionary algorithm for electric vehicle routing problem
.png){kind=icon}
PRE
AI
DOI：10.1007/s10489-022-03555-8.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Over the years, there have been many variations of the Vehicle Routing Problem created to fit the actual needs of society, one of which is the Electric Vehicle Routing Problem (EVRP). EVRP is a more complex and challenging combinatorial optimization than the conventional vehicle routing problem. This paper considers a specific model for the tram routing problem and proposes a clustering-inspired greedy search algorithm GS. GS algorithm aims to cluster charging routes and greedily search charging stations for the optimal route output. In this paper, we purposely implement GS into a meta-heuristic genetic algorithm GA to utilize GA's finding a globally optimal, leading to the formulation of the GSGA algorithm. To evaluate performance, we use a benchmark dataset found in the CEC-12 Tram Routing Problem CEC-12 Competition at the World Congress on Computational Intelligence (WCCI) 2020. The experiment evaluates GS's effectiveness when applied to other algorithms such as genetic algorithms and simulated annealing. The experiments results show that our proposed algorithm has better solution quality than previous algorithms.
Keyword:
Electric vehicle routing problem
Greedy search
Meta-heuristic algorithm
Genetic algorithm
期刊
IF:
3.5
论文数:
7.6K
被引数:
1.7W
机构
引用论文
.png){kind=icon}
Electric vehicle routing problem with recharging stations for minimizing energy consumption具有充电站的电动汽车路径问题，以最大程度地减少能源消耗
PREAI
分享收藏分享收藏Battery swap station location-routing problem with capacitated electric vehicles带容量的电动汽车的电池交换站位置-路由问题
PREAI
分享收藏
查看更多内容