离散差分进化算法求解共享单车调度问题-《郑州大学学报(工学版)》

文章信息/Info

Title:: Discrete differential evolution algorithm for solving shared bicycle scheduling problem

作者:: 汪慎文; 杨锋; 徐亮; 李美羽; 1. 河北地质大学信息工程学院;2. 河北地质大学人工智能与机器学习研究室;3. 北京交通大学交通运输学院

Author(s):: Wang Shenwen1; 2; Yang Feng1; 2; Xu Liang1; 2; Li Meiyu 1; 3; 1. School of Information Engineering, Hebei University of Geosciences; 2. Laboratory of Artificial Intelligence and Machine Learning, Hebei University of Geosciences; 3. School of Transportation, Beijing Jiaotong University

Keywords:: shared bicycles; Scheduling issues; Discrete differential evolution algorithm; vehicle routing issues

摘要:: 为了解决共享单车调度问题，设计了一种离散差分进化算法进行求解。系统的介绍了离散差分进化算法在面对共享单车调度问题时的解决方法，并针对调度问题改进了本身的变异算子、修补算子，提出了针对调度问题的一种针对离散变量及路径规划问题的新的变异方式以及修补方式，使得在算法的执行过程中能够对具体路径进行计算。结果表明，相比于贪心算法和蚁群算法，本文的算法解的质量较高且收敛速度较快，在共享单车调度等一系列的调度问题中具有一定的实用价值。

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.