基于DNA进化算法的车辆调度问题

Vehicle Scheduling Problem Based on DNA Evolutionary Algorithm

在建立一种物流配送车辆调度模型的基础上,针对传统启发式算法对复杂问题搜索效率低、易陷入局部最优的缺点,构造了DNA进化算法求解该问题。将其在个体变异操作中进行了一些改进,避免陷入局部最优。车辆调度问题(V SP)属于组合优化NP难题。采用V SP问题进行测试,仿真结果表明:该算法简单可行,与其他算法相比较,不但有很好的求解性能,而且具有更快的收敛能力与搜索能力。

A model of distribution vehicle scheduling problem is established, on the basis of analyzing such shortcomings of traditional heuristic algorithms as low searching efficiency and immature convergence. A DNA evolutionary algorithm is established for solving the distribution vehicle scheduling problem. The algorithm is improved in mutation, and is applied to Vehicle Scheduling Problem （VSP） successfully. VSP is a combinatorial optimization problem. In order to verify the effectiveness of the DNA evolutionary algorithm, a standard VSP problem is used. The simulation results show that the algorithm is very easy and feasible, and compared with other optimization algorithms, it has rapid convergence ability and searching ability.