Immune Algorithm for Vehicle Routing Problem with Time Windows
免疫算法在带时间窗的车辆路径问题中的应用

This paper proposes a novel affinity based on group match to apply immune algorithm to vehicle routing problem with time windows.It is proved that immune algorithm can find the optimal or nearly optimal solution effectively by the experiment.The result is better than saving algorithm,assignment algorithm and senetic algorithm.