OPTIMIZATION METHOD FOR THE MULTI-ROUTE SEARCHING PROBLEM

A new optimization method for the multi-route searching problem is proposed. The problem that the vehicles go to the goal through each city from a starting point is discussed. In this problem, the combinations of the routes become enormous, because the combinations of the vehicles and the visited cities need to be considered. The proposed method consists of two parts. (1) Dividing of the area, and (2) Deciding of the routes. In the first part, the area is divided using the geometric information. In the second part, the orders of visiting the cities are decided using Nearest Neighbor Heuristics. As the result of the simulations, the solutions are better than that of the genetic algorithm (GA). Furthermore, the computation time of using the proposed method is below 1 second, as against that the computation time of using GA is about 20 minutes. (A*) For the covering abstract see ITRD E110327.