Torch Relay Route Optimization by Using the Artificial Intelligence

Abstract

Ceremonial fire is an important symbol for an athletic game. Through the torch relay process, the atmosphere of peace and union is delivered and people are encouraged to participate in the athletic games together. Based on the data obtained from the global position system (GPS), in the study, various artificial intelligence approaches were used to solve the torch relay routing problem. The objective of the torch relay routing problem was to minimize the total distance of torch relay route. By reasonably combining genetic algorithms (GA) and particle swarm optimization (PSO), we developed a fast and easily implemented hybrid algorithm (HA) for solving the considered problem. The effectiveness and efficiency of the proposed HA were demonstrated and compared with those of standard ant colony optimization (ACO), PSO and GA by numerical results of the simulated instance with 10 spots and the real torch relay routing problems of National Intercollegiate Athletic Games in 2010. Numerical results indicate that the total distance of torch relay routes by HA was 335 km, which was 11.68% shorter than the original routes adopted by National Intercollegiate Athletic Games in 2010. It implies that the proposed HA can use the GPS information to schedule the torch relay routes, and it can reduce the cost of reconnoitering and management in an athletic game. Therefore, the proposed HA approach is an effective approach, and it can improve the efficiency for an athletic game.