Discrete differential evolution algorithm for solving shared bicycle scheduling problem
[1]Wang Shenwen,Yang Feng,Xu Liang,et al.Discrete differential evolution algorithm for solving shared bicycle scheduling problem[J].Journal of Zhengzhou University (Engineering Science),2019,40(04):9-.[doi:10.13705/j.issn.1671-6833.2019.04.022]
Copy
Journal of Zhengzhou University (Engineering Science)[ISSN
1671-6833/CN
41-1339/T] Volume:
40卷
Number of periods:
2019 04
Page number:
9-
Column:
Public date:
2019-07-10
- Title:
- Discrete differential evolution algorithm for solving shared bicycle scheduling problem
- Keywords:
- shared bicycles; Scheduling issues; Discrete differential evolution algorithm; vehicle routing issues
- CLC:
- -
- DOI:
- 10.13705/j.issn.1671-6833.2019.04.022
- Abstract:
- In order to solve the problem of shared bicycle scheduling, a discrete differential evolution algorithm is designed to solve it. This paper systematically introduces the solution of discrete differential evolution algorithm in the face of shared bicycle scheduling problem, improves its mutation operator and repair operator for scheduling problem, and proposes a new mutation and repair method for discrete variables and path planning problem. The specific path can be calculated in the execution process. The results show that compared with greedy algorithm and ant colony algorithm, the proposed algorithm has higher quality and faster convergence speed and has certain practical value in a series of scheduling problems such as shared bicycle scheduling.
- References:
- -
- Similar References:
Memo
-
Last Update:
2019-07-29