本文用遗传算法求解有时间窗车辆路径问题，获得其近优解或最优解．传统的交叉算子如ＰＭＸ，ＥＲ和ＣＸ等对多约束问题的适用性受到限制，本文使用一种直观的编码方法，并提出基于优先关系的交叉算子．实验表明这种遗传算法能够有效地解决复杂的优化问题

In this paper,we apply genetic algorithm to solve the vehicle routing problem with time windows.The traditional crossover operators,such as PMX,ER and CX lose their power if used for problems with multiple constraints. A directly encoding method is used and a new crossover operator based upon precedence relationship is proposed. The experimental results show that this genetic algorithm can suit for solving complexity problems.