Memetic algorithm for vehicle routing problem with time windows

Bo Li · Computer Engineering and Applications Journal · 2012

The Vehicle Routing Problem with Time Windows(VRPTW)is addressed in this paper. A mathematical model is designed and a memetic algorithm is proposed for VRPTW. The pattern of population search is genetic algorithm and the local search used tabu. The feasible neighborhoods are integrated into the algorithm to avoid the search for infeasible solutions, thus it improves search efficiency. Compared with the pure genetic algorithm and the tabu search, computational experiments on Solomon benchmarks show the effectiveness of the proposed memetic algorithm for VRPTW.

Read the paper · More papers on PaperTik