Abstract:

The Vehicle Routing Problem with Time Windows (VRPTW) is addressed in the paper. A multiobjective mathematic model is designed with goals of minimizing the vehicle number and the travel distance. A memetic algorithm is proposed, targeting this problem. The pattern of population search is genetic algorithm and Pareto ranking selection, while the local search uses tabu and solution pool to coordinate Pareto nondominated solutions obtained by the two searches. Compared with the multiobjective genetic algorithm without the local search and the singleobjective memetic algorithm, experimental results show the effectiveness of the proposed algorithm.

Key words: vehicle routing problem with time windows;memetic algorithm;multiobjective optimization;tabu search