有时间窗约束非满载车辆调度问题的遗传算法

Genetic Algorithm for VRP of Non-full Loads with Time Windows

利用遗传算法解决单车场单车型有时间窗约束的非满载车辆调度问题。针对非满载的VRP问题具有组间无序、组内有序的特性,采用一种有效的改进交叉算子,最大程度的保留了父代的优良特性并增强了算法的寻优能力,避免了早熟现象的发生,应用此方法分别对8个和13个客户有时间窗约束非满载车辆调度问题进行计算机仿真,得出了最优解,证明了本算法的优越性。

The genetic arithmetic was applied in non-full loaded vehicle scheduling problem with single park and single vehicle type, which has time windows restriction, Aiming at the characteristic that disorders between the groups and orders in the same group of the non-full loaded VRP problem, an effective crossed arithmetic operators was adopted, So it furthest reserved the excellent characteristics of elder, built up the finding best abilities of the arithmetic, it also avoided the premature phenomenon. And the advantage of this arithmetic was proved by the computer imitation to the problems of 8-custom and 13-custom VRP.