[1]WANG Chao,QIN Fang,LIU Rongrong,et al.Dual-population co-evolutionary algorithm for solving electric vehicle route problems[J].CAAI Transactions on Intelligent Systems,2024,19(2):438-445.[doi:10.11992/tis.202209007]
Copy
CAAI Transactions on Intelligent Systems[ISSN 1673-4785/CN 23-1538/TP] Volume:
19
Number of periods:
2024 2
Page number:
438-445
Column:
学术论文—人工智能基础
Public date:
2024-03-05
- Title:
-
Dual-population co-evolutionary algorithm for solving electric vehicle route problems
- Author(s):
-
WANG Chao; QIN Fang; LIU Rongrong; JIANG Hao
-
School of Artificial Intelligence, Anhui University, Hefei 230601, China
-
- Keywords:
-
green logistics; electric vehicle routing problem; electricity constraint; two-population; evolutionary algorithm; distance adjacency matrix; denoising autoencoder; knowledge transfer
- CLC:
-
TP273
- DOI:
-
10.11992/tis.202209007
- Abstract:
-
The emerging field of green logistics presents a challenge in the form of electric vehicle routing. This issue requires simultaneous optimization of routing and charging decisions, significantly expanding the search space. Moreover, solutions must comply with capacity and power constraints, making it difficult to quickly find feasible solutions using existing methods. To address these challenges, we propose a dual population-based co-evolutionary algorithm. This approach involves constructing a simpler problem to expedite the solution process for the original, more complicated problem. To facilitate information exchange between these two heterogeneous problems, we designed a solution representation method. This method, which is based on an improved distance adjacency matrix, allows to obtain information on customer visits and vehicle assignments. Subsequently, we employed a commonly used denoising autoencoder to establish the transformation relationship between solutions from these two problems. This step enables knowledge transfer between the two problem domains. Our proposed algorithm was tested against three heuristic methods and two evolutionary algorithms on test sets of different sizes. The experimental results show that the proposed algorithm not only converges faster but also yields solutions with superior convergence.