Memetic algorithm for vehicle routing problem with time windows
基于Memetic算法的带时间窗车辆路径问题研究*

This paper proposed a Memetic algorithm, which simulated the process of culture evolution, to solve vehicle routing problem with time windows(VRPTW). To convert VRPTW into continuous problem, it designed a real coding method. The memetic algorithm helped the particles which had certain learning capacity accelerate convergence rate by local search strategy. Meanwhile, because of helping some particles which fell into the local optimum escape from local optimum by tabu search,it enhanced the diversity of swarm. The experimental result shows that the proposed algorithm can get the solution more effectively and it is an effective method for VRPTW.