Abstract
In this paper, we propose a method generating initial solutions in a three-objective vehicle routing problem with two demand periods. We also propose a local search algorithm to increase the similarity of a solution for a high demand period and one for a normal demand. We consider three objectives in vehicle routing problems: minimizing the number of vehicles, minimizing the maximum routing duration, and maximizing the similarity between the solutions in the normal and high demand periods. Through computer simulation, we show the effectiveness of the generating method to improve the objective values. We also show that the proposed local search improves the similarity of solutions.
